Branch-and-cut for combinatorial optimization problems without auxiliary binary variables
From MaRDI portal
Publication:2775776
DOI10.1017/S0269888901000030zbMath1060.90082OpenAlexW2139337114MaRDI QIDQ2775776
Nemhauser, George I., Ismael Regis jun. de Farias, Ellis L. Johnson
Publication date: 2001
Published in: The Knowledge Engineering Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0269888901000030
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items
Branch-and-cut for linear programs with overlapping SOS1 constraints, The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints, Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints, A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints, New classes of facets for complementarity knapsack problems, Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints, A polyhedral study of the semi-continuous knapsack problem, Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints, Models for representing piecewise linear cost functions, A special ordered set approach for optimizing a discontinuous separable piecewise linear function, Semi-continuous network flow problems, Modeling disjunctive constraints with a logarithmic number of binary variables and constraints, A family of inequalities valid for the robust single machine scheduling polyhedron, Solving linear programs with complementarity constraints using branch-and-cut, On the structure of linear programs with overlapping cardinality constraints, On cutting planes for cardinality-constrained linear programs, Mixed integer models for the stationary case of gas network optimization, Integer-programming software systems
