Classical cuts for mixed-integer programming and branch-and-cut

DOI10.1007/S001860100120zbMath1031.90017OpenAlexW2047480744MaRDI QIDQ5906949

Manfred W. Padberg

Publication date: 15 July 2003

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001860100120

zbMATH Keywords

cutting planesbranch-and-cutGomory cutsMixed-integer programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) History of operations research and mathematical programming (90-03)

Related Items (3)

Two-stage mean-risk stochastic mixed integer optimization model for location-allocation problems under uncertain environment ⋮ The rank of (mixed-) integer polyhedra ⋮ Single Straddle Carrier Routing Problem in Port Container Terminals: Mathematical Model and Solving Approaches

This page was built for publication: Classical cuts for mixed-integer programming and branch-and-cut