An Introduction to the Theory of Cutting-Planes
From MaRDI portal
Publication:4198338
DOI10.1016/S0167-5060(08)70344-3zbMath0411.90053OpenAlexW1445158449MaRDI QIDQ4198338
Publication date: 1979
Published in: Discrete Optimization II, Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium co-sponsored by IBM Canada and SIAM Banff, Aha. and Vancouver (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70344-3
Related Items (5)
Duality for mixed-integer convex minimization ⋮ Classical cuts for mixed-integer programming and branch-and-cut ⋮ Lifting, superadditivity, mixed integer rounding and single node flow sets revisited ⋮ A primal dual integer programming algorithm ⋮ Stability in disjunctive optimization II:continuity of the feasible and optimal set
This page was built for publication: An Introduction to the Theory of Cutting-Planes
