Branch-and-cut for combinatorial optimisation problems without auxiliary binary variables

DOI10.1017/S0269888901000030MaRDI QIDQ2775776zbMATH OpenOpenAlexFDO

Authors G. L. Nemhauser, I. R. 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

zbMATH Keywords

production schedulingfibre optic cables

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Recommendations

• A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
• On disjunctive cuts for combinatorial optimization
• scientific article; zbMATH DE number 780782
• Branch and cut methods for network optimization
• Integer Programming and Combinatorial Optimization

Cited in

(24)

• Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints
• A special ordered set approach for optimizing a discontinuous separable piecewise linear function
• Semi-continuous network flow problems
• Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints
• A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
• Solving linear programs with complementarity constraints using branch-and-cut
• A combined variable aggregation presolving technique for mixed integer programming
• New classes of facets for complementarity knapsack problems
• Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints
• New classes of facets for complementarity knapsack problems
• Cardinality minimization, constraints, and regularization: a survey
• Integer-programming software systems
• Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
• Relaxations and cutting planes for linear programs with complementarity constraints
• A combinatorial approach for small and strong formulations of disjunctive constraints
• Mixed integer models for the stationary case of gas network optimization
• A family of inequalities valid for the robust single machine scheduling polyhedron
• Branch-and-cut for complementarity-constrained optimization
• Models for representing piecewise linear cost functions
• On cutting planes for cardinality-constrained linear programs
• On the structure of linear programs with overlapping cardinality constraints
• A polyhedral study of the semi-continuous knapsack problem
• The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints
• Branch-and-cut for linear programs with overlapping SOS1 constraints

This page was built for publication: Branch-and-cut for combinatorial optimisation problems without auxiliary binary variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2775776)