Pages that link to "Item:Q3565229"
From MaRDI portal
The following pages link to 50 Years of Integer Programming 1958-2008 (Q3565229):
Displayed 19 items.
- Solution of a Large-Scale Traveling-Salesman Problem (Q3565230) (← links)
- The Hungarian Method for the Assignment Problem (Q3565231) (← links)
- Integral Boundary Points of Convex Polyhedra (Q3565232) (← links)
- Outline of an Algorithm for Integer Solutions to Linear Programs and An Algorithm for the Mixed Integer Problem (Q3565233) (← links)
- An Automatic Method for Solving Discrete Programming Problems (Q3565234) (← links)
- Integer Programming: Methods, Uses, Computation (Q3565235) (← links)
- Matroid Partition (Q3565236) (← links)
- Reducibility Among Combinatorial Problems (Q3565237) (← links)
- Lagrangian Relaxation for Integer Programming (Q3565238) (← links)
- Disjunctive Programming (Q3565239) (← links)
- Polyhedral Approaches to Mixed Integer Linear Programming (Q3565240) (← links)
- Fifty-Plus Years of Combinatorial Integer Programming (Q3565241) (← links)
- Reformulation and Decomposition of Integer Programs (Q3565242) (← links)
- Integer Programming and Algorithmic Geometry of Numbers (Q3565243) (← links)
- Nonlinear Integer Programming (Q3565244) (← links)
- Mixed Integer Programming Computation (Q3565245) (← links)
- Symmetry in Integer Linear Programming (Q3565246) (← links)
- Semidefinite Relaxations for Integer Programming (Q3565247) (← links)
- The Group-Theoretic Approach in Mixed Integer Programming (Q3565248) (← links)