Convexity cuts for multiple choice problems
From MaRDI portal
Publication:1393350
DOI10.1016/0012-365X(73)90095-2zbMath0276.90040MaRDI QIDQ1393350
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
90C10: Integer programming
Related Items
Stability in disjunctive optimization II:continuity of the feasible and optimal set, A heuristic for multiple choice programming, Quasi-concave minimization subject to linear constraints, Solving allocation and scheduling problems inherent in forest resource management using mixed-integer programming, A o(n logn) algorithm for LP knapsacks with GUB constraints, Polyhedral annexation in mixed integer and combinatorial programming
Cites Work