Polyhedral Approaches to Mixed Integer Linear Programming

DOI10.1007/978-3-540-68279-0_11zbMath1187.90002OpenAlexW2168004511MaRDI QIDQ3565240

Giacomo Zambelli, Michele Conforti, Cornuéjols, Gérard

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

Mixed integer programming (90C11) 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)

Related Items

Convex hull of two quadratic or a conic quadratic and a quadratic inequality, A polyhedral approach to the single row facility layout problem, Some properties of convex hulls of integer points contained in general convex sets, On finitely generated closures in the theory of cutting planes, Valid inequalities for mixed-integer programmes with fixed charges on sets of variables, Gap inequalities for non-convex mixed-integer quadratic programs, Constraint qualification failure in action, Exact Solution of the Evasive Flow Capturing Problem, Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON, Extended formulations in combinatorial optimization, Relaxations of mixed integer sets from lattice-free polyhedra, Extended formulations in combinatorial optimization, Intersection cuts for nonlinear integer programming: convexification techniques for structured sets, New valid inequalities for the fixed-charge and single-node flow polytopes, Partially distributed outer approximation, On the structure of linear programs with overlapping cardinality constraints