Skip to main content

Welcome to our new digital collections platform!
This system is still under development and we welcome any and all feedback. If you have suggestions, want to report an issue, or provide general feedback, please complete this form. 

Carnegie Mellon University Digital Collections

  • About
  • Collections
  • search

person

Klingman, D. (Darwin)

Authority record

NACO Authority File


Related items of Klingman, D. (Darwin)

  • papers (documents) -- #1 The Lower Bounded and Partial Upper Bounded

  • papers (documents) -- #19 Computational Results in the Decomposition of Discrete Frequency Spectra

  • papers (documents) -- Explicit Solutions in Convex Goal Programming

  • publications (documents) -- #5 The Distribution Problem with Upper and Lower Bounds on the Node Requirements

  • reports -- #143 The Transportation Problem with Mixed Constraints

  • reports -- #144 Augmented Threaded Index Method for Network Optimization

  • reports -- #37 The Generalized Lattice Point Problem

  • reports -- #38 The 'More for Less' Paradox in the Distribution Model

  • reports -- #42 A One-Pass Algorithm to Determine a Dual Feasible Basic Solution for a Class of Capacitated Generalized Networks

  • reports -- #5 The Distribution Problem with Upper and Lower Bounds on the Node Requirements

  • reports -- #55 Convex Programming and Decomposition of Discrete Frequency Spectra

  • reports -- Some Advanced Start Procedures for Manpower Planning in Goal Programming Models

  • reports -- Static and Dynamic Biased Quadratic Multi-Attribute Assignment Models: Solutions and Equivalents

  • reprints -- #143 The Transportation Problem with Mixed Constraints

Find Out More

  • Distinctive Collections
  • University Archives
  • Archives Finding Aids
  • Special Collections
  • Architecture Archives
  • Kilthub

© 2025 CARNEGIE MELLON UNIVERSITY

instagramtwitteryoutube

Help

  • Ask Us
  • Using the Collections
  • Report a Problem
  • Frequently Asked Questions
  • Feedback
  • Legal Disclaimer
CMU logo