Branch-and-cut for combinatorial optimization problems without auxiliary binary variables
From MaRDI portal
Publication:2775776
DOI10.1017/S0269888901000030zbMath1060.90082MaRDI 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)
Related Items
A Combinatorial Approach for Small and Strong Formulations of Disjunctive 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, Integer-programming software systems, A special ordered set approach for optimizing a discontinuous separable piecewise linear function, Models for representing piecewise linear cost functions, Branch-and-cut for linear programs with overlapping SOS1 constraints, Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints, Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints, Semi-continuous network flow problems, 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, A polyhedral study of the semi-continuous knapsack problem, Mixed integer models for the stationary case of gas network optimization, Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints
