Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
From MaRDI portal
Publication:543399
DOI10.1007/S10107-009-0295-4zbMATH Open1218.90137OpenAlexW4379506771MaRDI QIDQ543399FDOQ543399
Authors: J. P. Vielma, G. L. Nemhauser 
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
Recommendations
- 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
- On mathematical programming with indicator constraints
- Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
Cites Work
- Title not available (Why is that?)
- Mixed integer models for the stationary case of gas network optimization
- Integer programming formulation of combinatorial optimization problems
- Disjunctive programming: Properties of the convex hull of feasible points
- Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
- Modelling with integer variables
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Disjunctive Programming
- Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints
- On the existence of optimal solutions to integer and mixed-integer programming problems
- On the Significance of Solving Linear Programming Problems with Some Integer Variables
- Polyhedral methods for piecewise-linear functions. I: The lambda method
- A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
- Models for representing piecewise linear cost functions
- A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems
- On the Solution of Discrete Programming Problems
- Nonconvex, lower semicontinuous piecewise linear optimization
- Approximating separable nonlinear functions via mixed zero-one programs
- On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions
- Projection, lifting and extended formulation integer and combinatorial optimization
- Mixed integer minimization models for piecewise-linear functions of a single variable
- Integer and mixed-integer programming models: General properties
- Branch-and-cut for combinatorial optimisation problems without auxiliary binary variables
- Representability in mixed integer programming. I: Characterization results
- On the convex hull of the union of certain polyhedra
- Optimization with disjunctive constraints
- Title not available (Why is that?)
- A composite algorithm for a concave-cost network flow problem
- Piecewise linear interpolants to Lagrange and Hermite convex scattered data
- A simplification for some disjunctive formulations
- Representation for multiple right-hand sides
- A Suggested Extension of Special Ordered Sets to Non-Separable Non-Convex Programming Problems
- All-different polytopes
- Representability of functions
- Parsimonious binary-encoding in integer programming
- On a binary-encoded ILP coloring formulation
- Experimental Results on the New Techniques for Integer Programming Formulations
- A theoretical and computational comparison of “equivalent” mixed-integer formulations
- Two Rules for Deducing Valid Inequalities for 0-1 Problems
- Integer Programming and Combinatorial Optimization
Cited In (73)
- Piecewise linear trees as surrogate models for system design and planning under high-frequency temporal variability
- Pump scheduling optimization in water distribution system based on mixed integer linear programming
- A comparison of alternative models for solving a non-linear single plant hydro unit commitment problem
- A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables
- MIP relaxations in factorable programming
- Supervised homogeneity fusion: a combinatorial approach
- Decomposing Loosely Coupled Mixed-Integer Programs for Optimal Microgrid Design
- Statistical static timing analysis via modern optimization lens. I: Histogram-based approach
- Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms
- Fuzzy score technique for the optimal location of wind turbines installations
- Finding all global optima of engineering design problems with discrete signomial terms
- Modeling the road network capacity in a mixed HV and CAV environment
- Deterministic model for customized pilot manufacture production with various backplane sizes
- Modeling combinatorial disjunctive constraints via junction trees
- Non-convex nested Benders decomposition
- Three methods for robust grading
- Piecewise linear bounding functions in univariate global optimization
- A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts
- Two-stage stochastic mixed-integer nonlinear programming model for post-wildfire debris flow hazard management: mitigation and emergency evacuation
- Optimizing invasive species management: a mixed-integer linear programming approach
- Between steps: intermediate relaxations between big-M and convex hull formulations
- Efficient Convexification Strategy for Generalized Geometric Programming Problems
- A partial outer convexification approach to control transmission lines
- Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming
- Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints
- Small and strong formulations for unions of convex sets from the Cayley embedding
- An integrated planning model in centralized power systems
- Global optimization of bilinear programs with a multiparametric disaggregation technique
- Fractional 0-1 programming: applications and algorithms
- An Improved MIP Formulation for Products of Discrete and Continuous Variables
- A note on linearized reformulations for a class of bilevel linear integer problems
- Optimistic MILP modeling of non-linear optimization problems
- Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems
- Piecewise Linear Function Fitting via Mixed-Integer Linear Programming
- A global optimization approach for solving three-dimensional open dimension rectangular packing problems
- A combinatorial approach for small and strong formulations of disjunctive constraints
- Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes
- Railway delay management with passenger rerouting considering train capacity constraints
- Incremental and encoding formulations for mixed integer programming
- Mathematical programming techniques in water network optimization
- Resilient layout, design and operation of energy-efficient water distribution networks for high-rise buildings using MINLP
- An elastic demand model for locating electric vehicle charging stations
- Ideal, non-extended formulations for disjunctive constraints admitting a network representation
- On the Derivation of Continuous Piecewise Linear Approximating Functions
- Optimal influenza vaccine distribution with equity
- A geometric way to build strong mixed-integer programming formulations
- Dynamic convexification within nested Benders decomposition using Lagrangian relaxation: an application to the strategic bidding problem
- Mixed integer linear programming formulation techniques
- Computing tight bounds via piecewise linear functions through the example of circle cutting problems
- An effective logarithmic formulation for piecewise linearization requiring no inequality constraint
- Global optimization for transport network expansion and signal setting
- On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization
- Continuous piecewise linear delta-approximations for bivariate and multivariate functions
- A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems
- Continuous piecewise linear delta-approximations for univariate functions: computing minimal breakpoint systems
- Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems
- An efficient approach for the S‐shaped penalty function
- Branch-and-cut for complementarity-constrained optimization
- Locally ideal formulations for piecewise linear functions with indicator variables
- Algorithms for a risk-averse Stackelberg game with multiple adversaries
- A computational analysis of multidimensional piecewise-linear models with applications to oil production optimization
- Compact mixed-integer programming formulations in quadratic optimization
- Mathematical programming formulations for piecewise polynomial functions
- An efficient deterministic optimization approach for rectangular packing problems
- Optimal incentive pricing on relaying services for maximizing connection availability in multihop cellular networks
- On mathematical programming with indicator constraints
- Relaxations and discretizations for the pooling problem
- The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints
- Discretization and global optimization for mixed integer bilinear programming
- Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
- Properties, extensions and application of piecewise linearization for Euclidean norm optimization in \(\mathbb{R}^2\)
- Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints
Uses Software
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 Q543399)
