Discrete-Variable Extremum Problems
George B. Dantzig · Operations Research · 1957
This paper reviews some recent successes in the use of linear programming methods for the solution of discrete-variable extremum problems. One example of the use of the multistage approach of dynamic programming for this purpose is also discussed.
Cited by 910 works. doi:10.1287/opre.5.2.266
Authors
References
- Solution of a Large-Scale Traveling-Salesman Problem
- The Hungarian method for the assignment problem
- Optimal two‐ and three‐stage production schedules with setup times included
- On the Solution of Discrete Programming Problems
- The theory of dynamic programming
- DYNAMIC PROGRAMMING AND A NEW FORMALISM IN THE CALCULUS OF VARIATIONS
- Bottleneck Problems and Dynamic Programming
- On some variational problems occurring in the theory of dynamic programming
- Some Problems in the Theory of Dynamic Programming
- Minimizing the number of tankers to meet a fixed schedule