Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints
From MaRDI portal
Publication:3503848
DOI10.1007/978-3-540-68891-4_14zbMath1143.90384OpenAlexW2098425563MaRDI QIDQ3503848
Nemhauser, George I., Juan Pablo Vielma
Publication date: 10 June 2008
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-68891-4_14
Related Items
Reducing multivalued discrete variables in solving separable task assignment problems, Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations, A Hybrid Optimization Algorithm for Water Production and Distribution Operations in a Large Real-World Water Network, Modeling disjunctive constraints with a logarithmic number of binary variables and constraints, Piecewise linear approximation of functions of two variables in MILP models, Mixed Integer Linear Programming Formulation Techniques, Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Projection, lifting and extended formulation integer and combinatorial optimization
- Nonconvex, lower semicontinuous piecewise linear optimization
- Representability in mixed integer programming. I: Characterization results
- A simplification for some disjunctive formulations
- On the convex hull of the union of certain polyhedra
- Optimization with disjunctive constraints
- Integer programming formulation of combinatorial optimization problems
- Disjunctive programming: Properties of the convex hull of feasible points
- Models for representing piecewise linear cost functions
- Approximating separable nonlinear functions via mixed zero-one programs
- Mixed integer models for the stationary case of gas network optimization
- Representation for multiple right-hand sides
- Branch-and-cut for combinatorial optimization problems without auxiliary binary variables
- A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
- Modelling with integer variables
- On the Solution of Discrete Programming Problems
- On the Significance of Solving Linear Programming Problems with Some Integer Variables
- A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- A Suggested Extension of Special Ordered Sets to Non-Separable Non-Convex Programming Problems
- Two Rules for Deducing Valid Inequalities for 0-1 Problems
- Disjunctive Programming
- Integer Programming and Combinatorial Optimization
- Polyhedral methods for piecewise-linear functions. I: The lambda method
- On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions
