Convexity cuts for multiple choice problems

DOI10.1016/0012-365X(73)90095-2MaRDI QIDQ1393350zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3215121 (Why is no real title available?)
• Hypercylindrically Deduced Cuts in Zero-One Integer Programs

Cited in

(6)

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

This page was built for publication: Convexity cuts for multiple choice problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1393350)