Convexity cuts for multiple choice problems

DOI10.1016/0012-365X(73)90095-2zbMath0276.90040OpenAlexW1969293313MaRDI QIDQ1393350

Fred Glover

Publication date: 1973

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(73)90095-2

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items

A heuristic for multiple choice programming ⋮ Quasi-concave minimization subject to linear constraints ⋮ A o(n logn) algorithm for LP knapsacks with GUB constraints ⋮ Polyhedral annexation in mixed integer and combinatorial programming ⋮ Solving allocation and scheduling problems inherent in forest resource management using mixed-integer programming ⋮ Stability in disjunctive optimization II:continuity of the feasible and optimal set

Cites Work

• Hypercylindrically Deduced Cuts in Zero-One Integer Programs
• Unnamed Item