Polyhedral approaches to mixed integer linear programming

DOI10.1007/978-3-540-68279-0_11MaRDI QIDQ3565240zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Biographies, obituaries, personalia, bibliographies (01A70) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) History of operations research and mathematical programming (90-03) Mixed integer programming (90C11)

Recommendations

• Valid inequalities for mixed integer linear programs
• Cutting planes in integer and mixed integer programming
• Classical cuts for mixed-integer programming and branch-and-cut
• Classical cuts for mixed-integer programming and branch-and-cut
• Strengthening Gomory Mixed-Integer Cuts

Cited in

(32)

• Polyhedral functions and multiparametric linear programming
• Constraint qualification failure in action
• A polyhedral characterization of the inverse-feasible region of a mixed-integer program
• On finitely generated closures in the theory of cutting planes
• Partially distributed outer approximation
• Valid inequalities for mixed-integer programmes with fixed charges on sets of variables
• New valid inequalities for the fixed-charge and single-node flow polytopes
• On the structure of linear programs with overlapping cardinality constraints
• A geometric approach to cut-generating functions
• Convex hull of two quadratic or a conic quadratic and a quadratic inequality
• A cutting plane theory for mixed integer optimization
• The group-theoretic approach in mixed integer programming
• A polyhedral approach to the single row facility layout problem
• Some properties of convex hulls of integer points contained in general convex sets
• Gap inequalities for non-convex mixed-integer quadratic programs
• Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
• Test sets and inequalities for integer programs
• Exact solution of the evasive flow capturing problem
• Extended formulations in combinatorial optimization
• Classical cuts for mixed-integer programming and branch-and-cut
• Extended formulations in combinatorial optimization
• Relaxations of mixed integer sets from lattice-free polyhedra
• Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
• Multiphase-linear ranking functions and their relation to recurrent sets
• A surrogate-based heuristic for production planning problem of orders in small foundries
• On the split closure of the periodic timetabling polytope
• A diving heuristic for mixed-integer problems with unbounded semi-continuous variables
• The k-aggregation closure for covering sets
• Cutting planes in integer and mixed integer programming
• Last fifty years of integer linear programming: a focus on recent practical advances
• Chvátal closures for mixed integer programming problems
• Valid inequalities for mixed integer linear programs

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)