Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
From MaRDI portal
Publication:543399
DOI10.1007/s10107-009-0295-4zbMath1218.90137OpenAlexW4379506771MaRDI QIDQ543399
Juan Pablo Vielma, Nemhauser, George I.
Publication date: 17 June 2011
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-009-0295-4
Related Items (65)
Optimistic MILP modeling of non-linear optimization problems ⋮ A global optimization approach for solving three-dimensional open dimension rectangular packing problems ⋮ Finding all global optima of engineering design problems with discrete signomial terms ⋮ Mathematical programming techniques in water network optimization ⋮ Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems ⋮ An elastic demand model for locating electric vehicle charging stations ⋮ Ideal, non-extended formulations for disjunctive constraints admitting a network representation ⋮ Computing tight bounds via piecewise linear functions through the example of circle cutting problems ⋮ Piecewise linear bounding functions in univariate global optimization ⋮ Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms ⋮ Global optimization for transport network expansion and signal setting ⋮ Decomposing Loosely Coupled Mixed-Integer Programs for Optimal Microgrid Design ⋮ The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints ⋮ Fractional 0-1 programming: applications and algorithms ⋮ Global optimization of bilinear programs with a multiparametric disaggregation technique ⋮ Mathematical programming formulations for piecewise polynomial functions ⋮ Continuous piecewise linear delta-approximations for bivariate and multivariate functions ⋮ A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables ⋮ On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization ⋮ A partial outer convexification approach to control transmission lines ⋮ Algorithms for a risk-averse Stackelberg game with multiple adversaries ⋮ An efficient approach for the S‐shaped penalty function ⋮ An integrated planning model in centralized power systems ⋮ Continuous piecewise linear delta-approximations for univariate functions: computing minimal breakpoint systems ⋮ A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints ⋮ Modeling combinatorial disjunctive constraints via junction trees ⋮ A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems ⋮ Two-stage stochastic mixed-integer nonlinear programming model for post-wildfire debris flow hazard management: mitigation and emergency evacuation ⋮ Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems ⋮ Supervised homogeneity fusion: a combinatorial approach ⋮ Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints ⋮ Optimal incentive pricing on relaying services for maximizing connection availability in multihop cellular networks ⋮ Locally ideal formulations for piecewise linear functions with indicator variables ⋮ Incremental and encoding formulations for mixed integer programming ⋮ Efficient Convexification Strategy for Generalized Geometric Programming Problems ⋮ A note on linearized reformulations for a class of bilevel linear integer problems ⋮ Branch-and-cut for complementarity-constrained optimization ⋮ Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming ⋮ Relaxations and discretizations for the pooling problem ⋮ Three methods for robust grading ⋮ Optimizing invasive species management: a mixed-integer linear programming approach ⋮ Dynamic convexification within nested Benders decomposition using Lagrangian relaxation: an application to the strategic bidding problem ⋮ Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems ⋮ A computational analysis of multidimensional piecewise-linear models with applications to oil production optimization ⋮ An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs ⋮ Railway delay management with passenger rerouting considering train capacity constraints ⋮ Fuzzy score technique for the optimal location of wind turbines installations ⋮ Optimal influenza vaccine distribution with equity ⋮ A geometric way to build strong mixed-integer programming formulations ⋮ Mixed Integer Linear Programming Formulation Techniques ⋮ An effective logarithmic formulation for piecewise linearization requiring no inequality constraint ⋮ Strong mixed-integer programming formulations for trained neural networks ⋮ Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes ⋮ Piecewise Linear Function Fitting via Mixed-Integer Linear Programming ⋮ On the Derivation of Continuous Piecewise Linear Approximating Functions ⋮ A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts ⋮ Deterministic model for customized pilot manufacture production with various backplane sizes ⋮ Small and strong formulations for unions of convex sets from the Cayley embedding ⋮ Resilient layout, design and operation of energy-efficient water distribution networks for high-rise buildings using MINLP ⋮ Discretization and global optimization for mixed integer bilinear programming ⋮ Compact mixed-integer programming formulations in quadratic optimization ⋮ Properties, extensions and application of piecewise linearization for Euclidean norm optimization in \(\mathbb{R}^2\) ⋮ Non-convex nested Benders decomposition ⋮ An efficient deterministic optimization approach for rectangular packing problems ⋮ Between steps: intermediate relaxations between big-M and convex hull formulations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Piecewise linear interpolants to Lagrange and Hermite convex scattered data
- 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
- Mixed integer minimization models for piecewise-linear functions of a single variable
- 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
- All-different polytopes
- Representability of functions
- Integer and mixed-integer programming models: General properties
- Parsimonious binary-encoding in integer programming
- 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
- On a Binary-Encoded ILP Coloring Formulation
- Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
- 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
- Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints
- Experimental Results on the New Techniques for Integer Programming Formulations
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- A composite algorithm for a concave-cost network flow problem
- A theoretical and computational comparison of “equivalent” mixed-integer formulations
- A Suggested Extension of Special Ordered Sets to Non-Separable Non-Convex Programming Problems
- On the existence of optimal solutions to integer and mixed-integer 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
This page was built for publication: Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
