Integer Programming
From MaRDI portal
Publication:5130591
DOI10.1002/9781119606475zbMath1480.90175OpenAlexW4241768805MaRDI QIDQ5130591
Publication date: 28 October 2020
Full work available at URL: https://doi.org/10.1002/9781119606475
combinatorial optimizationvalid inequalitiesmixed-integer programmingcutting plane algorithmsmatchings and assignments problems
Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Related Items (7)
Column elimination for capacitated vehicle routing problems ⋮ Cutting plane selection with analytic centers and multiregression ⋮ Linear integer programming model as mathematical ware for an optimal flow production planning system at operational scheduling stage ⋮ Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing ⋮ A branch and bound algorithm for robust binary optimization with budget uncertainty ⋮ Feasibility jump: an LP-free Lagrangian MIP heuristic ⋮ Constructing two-level \(Q_B\)-optimal screening designs using mixed-integer programming and heuristic algorithms
Uses Software
This page was built for publication: Integer Programming
