Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints
From MaRDI portal
Recommendations
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- scientific article; zbMATH DE number 2016110
- scientific article; zbMATH DE number 1213132
- Building tractable disjunctive constraints
- Modelling discrete optimisation problems in constraint logic programming
- Boolean Models and Simultaneous Inequalities
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
- scientific article; zbMATH DE number 512884
- On binary constraint problems
- Disjunctive Programs with Set Constraints
Cites work
- scientific article; zbMATH DE number 4137767 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3661134 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3559278 (Why is no real title available?)
- scientific article; zbMATH DE number 3410784 (Why is no real title available?)
- A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
- A Suggested Extension of Special Ordered Sets to Non-Separable Non-Convex Programming Problems
- A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems
- A simplification for some disjunctive formulations
- Approximating separable nonlinear functions via mixed zero-one programs
- Branch-and-cut for combinatorial optimisation problems without auxiliary binary variables
- Disjunctive Programming
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Disjunctive programming: Properties of the convex hull of feasible points
- Integer Programming and Combinatorial Optimization
- Integer programming formulation of combinatorial optimization problems
- Mixed integer models for the stationary case of gas network optimization
- Modelling with integer variables
- Models for representing piecewise linear cost functions
- Nonconvex, lower semicontinuous piecewise linear optimization
- On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions
- On the Significance of Solving Linear Programming Problems with Some Integer Variables
- On the Solution of Discrete Programming Problems
- On the convex hull of the union of certain polyhedra
- Optimization with disjunctive constraints
- Polyhedral methods for piecewise-linear functions. I: The lambda method
- Projection, lifting and extended formulation integer and combinatorial optimization
- Representability in mixed integer programming. I: Characterization results
- Representation for multiple right-hand sides
- Two Rules for Deducing Valid Inequalities for 0-1 Problems
Cited in
(13)- A hybrid optimization algorithm for water production and distribution operations in a large real-world water network
- An Improved MIP Formulation for Products of Discrete and Continuous Variables
- Reducing multivalued discrete variables in solving separable task assignment problems
- A mixed-integer PDE-constrained optimization formulation for constructing electromagnetic cloaks with multiple materials
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- A combinatorial approach for small and strong formulations of disjunctive constraints
- Ideal, non-extended formulations for disjunctive constraints admitting a network representation
- Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production
- Mixed integer linear programming formulation techniques
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- Piecewise linear approximation of functions of two variables in MILP models
- On mathematical programming with indicator constraints
- Modeling combinatorial disjunctive constraints via junction trees
This page was built for publication: Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503848)
