Polyhedral approaches to mixed integer linear programming
DOI10.1007/978-3-540-68279-0_11zbMATH Open1187.90002OpenAlexW2168004511MaRDI QIDQ3565240FDOQ3565240
Authors: Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli 
Publication date: 3 June 2010
Published in: 50 Years of Integer Programming 1958-2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-68279-0_11
Recommendations
Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Mixed integer programming (90C11) Biographies, obituaries, personalia, bibliographies (01A70) History of operations research and mathematical programming (90-03)
Cited In (28)
- Gap inequalities for non-convex mixed-integer quadratic programs
- Exact solution of the evasive flow capturing problem
- Extended formulations in combinatorial optimization
- Valid inequalities for mixed integer linear programs
- Convex hull of two quadratic or a conic quadratic and a quadratic inequality
- The group-theoretic approach in mixed integer programming
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- A polyhedral approach to the single row facility layout problem
- Extended formulations in combinatorial optimization
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
- Partially distributed outer approximation
- New valid inequalities for the fixed-charge and single-node flow polytopes
- A polyhedral characterization of the inverse-feasible region of a mixed-integer program
- A geometric approach to cut-generating functions
- Relaxations of mixed integer sets from lattice-free polyhedra
- Chvátal closures for mixed integer programming problems
- Constraint qualification failure in action
- Cutting planes in integer and mixed integer programming
- On the structure of linear programs with overlapping cardinality constraints
- A cutting plane theory for mixed integer optimization
- Test sets and inequalities for integer programs
- Some properties of convex hulls of integer points contained in general convex sets
- Multiphase-linear ranking functions and their relation to recurrent sets
- Valid inequalities for mixed-integer programmes with fixed charges on sets of variables
- A surrogate-based heuristic for production planning problem of orders in small foundries
- Classical cuts for mixed-integer programming and branch-and-cut
- Polyhedral functions and multiparametric linear programming
- On finitely generated closures in the theory of cutting planes
This page was built for publication: Polyhedral approaches to mixed integer linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3565240)
