Mixed Integer Linear Programming Formulation Techniques
From MaRDI portal
Publication:2808240
DOI10.1137/130915303zbMath1338.90277OpenAlexW2073576149MaRDI QIDQ2808240
Publication date: 20 May 2016
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/96480
Related Items
Strong mixed-integer formulations for the floor layout problem ⋮ Beating the SDP bound for the floor layout problem: a simple combinatorial idea ⋮ Online over time processing of combinatorial problems ⋮ Lifting for Simplicity: Concise Descriptions of Convex Sets ⋮ Risk Averse Stackelberg Security Games with Quantal Response ⋮ Ideal, non-extended formulations for disjunctive constraints admitting a network representation ⋮ Building Representative Matched Samples With Multi-Valued Treatments in Large Observational Studies ⋮ Mixed-Integer Convex Representability ⋮ Tighter MIP formulations for the discretised unit commitment problem with MIN-stop ramping constraints ⋮ Staircase compatibility and its applications in scheduling and piecewise linearization ⋮ Integer Programming Formulations for Minimum Spanning Tree Interdiction ⋮ Influence Maximization with Latency Requirements on Social Networks ⋮ Mathematical programming formulations for piecewise polynomial functions ⋮ Structural Investigation of Piecewise Linearized Network Flow Problems ⋮ Optimization over decision trees: a case study for the design of stable direct-current electricity networks ⋮ A linear programming approach to difference-of-convex piecewise linear approximation ⋮ A unified framework for bivariate clustering and regression problems via mixed-integer linear programming ⋮ A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints ⋮ Mixed-Integer Linear Representability, Disjunctions, and Chvátal Functions—Modeling Implications ⋮ Modeling combinatorial disjunctive constraints via junction trees ⋮ Development of a heuristic based mixed integer linear programming model for resources allocation during cyberfraud mitigation ⋮ Learning lyapunov functions for hybrid systems ⋮ On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations ⋮ Network Models with Unsplittable Node Flows with Application to Unit Train Scheduling ⋮ Mixed-integer bilevel representability ⋮ Optimization in liner shipping ⋮ Locally ideal formulations for piecewise linear functions with indicator variables ⋮ Disjunctive Programming for Multiobjective Discrete Optimisation ⋮ Computation of weighted sums of rewards for concurrent MDPs ⋮ Learning in Combinatorial Optimization: What and How to Explore ⋮ Optimization of Tree Ensembles ⋮ On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs ⋮ Optimization in liner shipping ⋮ A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints ⋮ Behavioral modeling in weight loss interventions ⋮ An interleaved depth-first search method for the linear optimization problem with disjunctive constraints ⋮ Exact algorithms for the equitable traveling salesman problem ⋮ New multi-commodity flow formulations for the pooling problem ⋮ A rounding theorem for unique binary tomographic reconstruction ⋮ Reachability in parametric interval Markov chains using constraints ⋮ Ellipsoidal mixed-integer representability ⋮ A geometric way to build strong mixed-integer programming formulations ⋮ Strong mixed-integer programming formulations for trained neural networks ⋮ Balas formulation for the union of polytopes is optimal ⋮ Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances ⋮ On the Derivation of Continuous Piecewise Linear Approximating Functions ⋮ Low-Complexity Method for Hybrid MPC with Local Guarantees ⋮ Small and strong formulations for unions of convex sets from the Cayley embedding ⋮ Characterizations of mixed binary convex quadratic representable sets ⋮ Worst-case analysis of clique MIPs ⋮ Discretization and global optimization for mixed integer bilinear programming ⋮ Between steps: intermediate relaxations between big-M and convex hull formulations
Uses Software
Cites Work
- Experimental Results on the New Techniques for Integer Programming Formulations
- A simplex algorithm for piecewise-linear programming I: Derivation and proof
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Methods of Nonlinear 0-1 Programming
- Rational Mixed-Integer and Polyhedral Union Minimization Models
- Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
- A theoretical and computational comparison of “equivalent” mixed-integer formulations
- A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
- On the existence of optimal solutions to integer and mixed-integer programming problems
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Some Basis Theorems for Integral Monoids
- Disjunctive Programming
- Lectures on Polytopes
- Convex Polytopes
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
- The Matching Polytope has Exponential Extension Complexity
- Base-2 Expansions for Linearizing Products of Functions of Discrete Variables
- Imposing Connectivity Constraints in Forest Planning Models
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Forbidden Vertices
- Discrete-Variable Extremum Problems
- Linear vs. semidefinite extended formulations
- Representation of Sets of Lattice Points
- Production Planning by Mixed Integer Programming
- On Polyhedral Approximations of the Second-Order Cone
- Extended formulations in combinatorial optimization
- Polyhedral methods for piecewise-linear functions. I: The lambda method
- On project scheduling with irregular starting time costs
- Scheduling projects with labor constraints
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dynamic resource allocation: a flexible and tractable modeling framework
- The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints
- Some properties of convex hulls of integer points contained in general convex sets
- A hierarchy of relaxations for linear generalized disjunctive programming
- Fitting piecewise linear continuous functions
- Mixed integer linear programming formulations for probabilistic constraints
- Preface: history of integer programming: distinguished personal notes and reminiscences
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- Integrated methods for optimization
- SCIP: solving constraint integer programs
- Smallest compact formulation for the permutahedron
- ``Miniaturized linearizations for quadratic 0/1 problems
- An integer programming approach for linear programs with probabilistic constraints
- Compact formulations as a union of polyhedra
- A special ordered set approach for optimizing a discontinuous separable piecewise linear function
- Nonconvex, lower semicontinuous piecewise linear optimization
- Piecewise-linear approximations of multidimensional functions
- Logic and integer programming
- Editorial: Reformulation techniques in mathematical programming
- A linearization framework for unconstrained quadratic (0-1) problems
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
- A theorem about antiprisms
- Representability in mixed integer programming. I: Characterization results
- A simplification for some disjunctive formulations
- A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy
- On the convex hull of the union of certain polyhedra
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- An algorithm for disjunctive programs
- Using separation algorithms to generate mixed integer model reformulations
- On the calculation of true and pseudo penalties in multiple choice integer programming
- A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
- Expressing combinatorial optimization problems by linear programs
- Logic-based decision support. Mixed integer model formulation
- Mixed integer minimization models for piecewise-linear functions of a single variable
- Integer programming formulation of combinatorial optimization problems
- Representations of unbounded optimization problems as integer programs
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Disjunctive programming: Properties of the convex hull of feasible points
- Different transformations for solving non-convex trim-loss problems by MINLP
- Location, scheduling, design and integer programming
- Discontinuous piecewise linear optimization
- Approximating separable nonlinear functions via mixed zero-one programs
- Connecting special ordered inequalities and transformation and reformulation technique in multiple choice programming
- All-different polytopes
- Compact vs. exponential-size LP relaxations
- Compact optimization can outperform separation: a case study in structural proteomics
- Model tightening for integrated timber harvest and transportation planning
- Representability of functions
- Integer and mixed-integer programming models: General properties
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- A simple recipe for concise mixed 0-1 linearizations
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints
- Mixed logical-linear programming
- Piecewise linear approximation of functions of two variables in MILP models
- Ideal representations of lexicographic orderings and base-2 expansions of integer variables
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- On mixing sets arising in chance-constrained programming
- Incremental and encoding formulations for mixed integer programming
- Linear forms of nonlinear expressions: new insights on old ideas
- Conflict analysis in mixed integer programming
- A note on modeling multiple choice requirements for simple mixed integer programming solvers
- Parsimonious binary-encoding in integer programming
- Approximate extended formulations
- Representation for multiple right-hand sides
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Column Generation for Extended Formulations
- On a Binary-Encoded ILP Coloring Formulation
- Using Piecewise Linear Functions for Solving MINLPs
- A Note on “A Superior Representation Method for Piecewise Linear Functions”
- Combination of Nonlinear and Linear Optimization of Transient Gas Networks
- Constructing Extended Formulations from Reflection Relations
- Hybrid Modeling
- Global Optimization for Generalized Geometric Programs with Mixed Free-Sign Variables
- Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
- Cutting planes for branch-and-price algorithms
- Integer Programming
- Modelling with integer variables
- On the Significance of Solving Linear Programming Problems with Some Integer Variables
- An Automatic Method of Solving Discrete Programming Problems
- An Improved MIP Formulation for Products of Discrete and Continuous Variables
- A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
- Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
- Equivalent Formulations of Nonlinear Integer Problems for Efficient Optimization
- Polyhedral Characterization of Discrete Dynamic Programming
- Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints
- Fifty-Plus Years of Combinatorial Integer Programming
- Reformulation and Decomposition of Integer Programs
- Mixed Integer Programming Computation
- Branched Polyhedral Systems
- Solving Connected Subgraph Problems in Wildlife Conservation
- Reformulations in Mathematical Programming: Definitions and Systematics
- On the Value of Binary Expansions for General Mixed-Integer Linear Programs
- 50 Years of Integer Programming 1958-2008
- Jointly Constrained Biconvex Programming
