Mixed integer linear programming formulation techniques
From MaRDI portal
Publication:2808240
Recommendations
- Stronger formulations of mixed integer linear programs: an example
- Mixed integer linear programming models for combinatorial optimization problems
- scientific article; zbMATH DE number 2196290
- Two mixed integer programming formulations arising in manufacturing management
- Solving hard mixed-integer programming problems with Xpress-MP: a MIPLIB 2003 case study
Cites work
- scientific article; zbMATH DE number 5302815 (Why is no real title available?)
- scientific article; zbMATH DE number 3898606 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3550467 (Why is no real title available?)
- scientific article; zbMATH DE number 3551404 (Why is no real title available?)
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- scientific article; zbMATH DE number 1149836 (Why is no real title available?)
- scientific article; zbMATH DE number 1550909 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- scientific article; zbMATH DE number 2196290 (Why is no real title available?)
- 50 Years of Integer Programming 1958-2008
- A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
- A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- A hierarchy of relaxations for linear generalized disjunctive programming
- A linearization framework for unconstrained quadratic (0-1) problems
- A note on ``A superior representation method for piecewise linear functions
- A note on modeling multiple choice requirements for simple mixed integer programming solvers
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A simple recipe for concise mixed 0-1 linearizations
- A simplex algorithm for piecewise-linear programming I: Derivation and proof
- A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy
- A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
- A simplification for some disjunctive formulations
- A special ordered set approach for optimizing a discontinuous separable piecewise linear function
- A theorem about antiprisms
- A theoretical and computational comparison of “equivalent” mixed-integer formulations
- All-different polytopes
- An Automatic Method of Solving Discrete Programming Problems
- An Improved MIP Formulation for Products of Discrete and Continuous Variables
- An algorithm for disjunctive programs
- An integer programming approach for linear programs with probabilistic constraints
- Approximate extended formulations
- Approximating separable nonlinear functions via mixed zero-one programs
- Base-2 expansions for linearizing products of functions of discrete variables
- Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints
- Branch-and-price: Column generation for solving huge integer programs
- Branched polyhedral systems
- Column generation for extended formulations
- Combination of nonlinear and linear optimization of transient gas networks
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Compact formulations as a union of polyhedra
- Compact optimization can outperform separation: a case study in structural proteomics
- Compact vs. exponential-size LP relaxations
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- Conflict analysis in mixed integer programming
- Connecting special ordered inequalities and transformation and reformulation technique in multiple choice programming
- Constructing extended formulations from reflection relations
- Convex Polytopes
- Convexity, complexity, and high dimensions
- Cutting planes for branch-and-price algorithms
- Different transformations for solving non-convex trim-loss problems by MINLP
- Discontinuous piecewise linear optimization
- Discrete-variable extremum problems
- Disjunctive Programming
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Disjunctive programming: Properties of the convex hull of feasible points
- Dynamic resource allocation: a flexible and tractable modeling framework
- Editorial: Reformulation techniques in mathematical programming
- Equivalent Formulations of Nonlinear Integer Problems for Efficient Optimization
- Experimental Results on the New Techniques for Integer Programming Formulations
- Expressing combinatorial optimization problems by linear programs
- Extended formulations in combinatorial optimization
- Fifty-plus years of combinatorial integer programming
- Fitting piecewise linear continuous functions
- Forbidden vertices
- Global optimization for generalized geometric programs with mixed free-sign variables
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- Handbook of the geometry of Banach spaces. Volume 1
- Hybrid modeling
- Ideal representations of lexicographic orderings and base-2 expansions of integer variables
- Imposing Connectivity Constraints in Forest Planning Models
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
- Incremental and encoding formulations for mixed integer programming
- Integer Programming
- Integer and mixed-integer programming models: General properties
- Integer programming formulation of combinatorial optimization problems
- Integrated methods for optimization
- Jointly Constrained Biconvex Programming
- Lectures on Polytopes
- Linear forms of nonlinear expressions: new insights on old ideas
- Linear vs. semidefinite extended formulations
- Location, scheduling, design and integer programming
- Logic and integer programming
- Logic-based decision support. Mixed integer model formulation
- Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
- MIP: Theory and practice -- closing the gap
- Methods of Nonlinear 0-1 Programming
- Mixed integer linear programming formulations for probabilistic constraints
- Mixed integer minimization models for piecewise-linear functions of a single variable
- Mixed integer programming computation
- Mixed logical-linear programming
- Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
- Model tightening for integrated timber harvest and transportation planning
- Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- Modelling with integer variables
- Nonconvex, lower semicontinuous piecewise linear optimization
- On Polyhedral Approximations of the Second-Order Cone
- On a binary-encoded ILP coloring formulation
- On mixing sets arising in chance-constrained programming
- On project scheduling with irregular starting time costs
- On the Significance of Solving Linear Programming Problems with Some Integer Variables
- On the Value of Binary Expansions for General Mixed-Integer Linear Programs
- On the calculation of true and pseudo penalties in multiple choice integer programming
- On the convex hull of the union of certain polyhedra
- On the existence of optimal solutions to integer and mixed-integer programming problems
- Parsimonious binary-encoding in integer programming
- Piecewise linear approximation of functions of two variables in MILP models
- Piecewise-linear approximations of multidimensional functions
- Polyhedral Characterization of Discrete Dynamic Programming
- Polyhedral methods for piecewise-linear functions. I: The lambda method
- Preface: history of integer programming: distinguished personal notes and reminiscences
- Production Planning by Mixed Integer Programming
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- Rational Mixed-Integer and Polyhedral Union Minimization Models
- Reformulation and decomposition of integer programs
- Reformulations in Mathematical Programming: Definitions and Systematics
- Representability in mixed integer programming. I: Characterization results
- Representability of functions
- Representation for multiple right-hand sides
- Representation of Sets of Lattice Points
- Representations of unbounded optimization problems as integer programs
- SCIP: solving constraint integer programs
- Scheduling projects with labor constraints
- Smallest compact formulation for the permutahedron
- Solving Connected Subgraph Problems in Wildlife Conservation
- Some Basis Theorems for Integral Monoids
- Some properties of convex hulls of integer points contained in general convex sets
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints
- Using Piecewise Linear Functions for Solving MINLPs
- Using separation algorithms to generate mixed integer model reformulations
- Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
- ``Miniaturized linearizations for quadratic 0/1 problems
Cited in
(62)- Pump scheduling optimization in water distribution system based on mixed integer linear programming
- Distributionally robust portfolio optimization under marginal and copula ambiguity
- A linear programming approach to difference-of-convex piecewise linear approximation
- MIP relaxations in factorable programming
- Development of a heuristic based mixed integer linear programming model for resources allocation during cyberfraud mitigation
- Learning lyapunov functions for hybrid systems
- A unified framework for bivariate clustering and regression problems via mixed-integer linear programming
- Mathematical programming for simultaneous feature selection and outlier detection under l1 norm
- Modeling combinatorial disjunctive constraints via junction trees
- New multi-commodity flow formulations for the pooling problem
- Ellipsoidal mixed-integer representability
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances
- A rounding theorem for unique binary tomographic reconstruction
- Mixed-integer linear representability, disjunctions, and Chvátal functions -- modeling implications
- Beating the SDP bound for the floor layout problem: a simple combinatorial idea
- Computation of weighted sums of rewards for concurrent MDPs
- A combinatorial approach for small and strong formulations of disjunctive constraints
- Lifting for simplicity: concise descriptions of convex sets
- Balas formulation for the union of polytopes is optimal
- Disjunctive Programming for Multiobjective Discrete Optimisation
- Staircase compatibility and its applications in scheduling and piecewise linearization
- A geometric way to build strong mixed-integer programming formulations
- Between steps: intermediate relaxations between big-M and convex hull formulations
- Formulating a Mixed Integer Programming Problem to Improve Solvability
- Tighter MIP formulations for the discretised unit commitment problem with MIN-stop ramping constraints
- Building Representative Matched Samples With Multi-Valued Treatments in Large Observational Studies
- On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations
- Mixed integer linear programming models for combinatorial optimization problems
- Strong mixed-integer formulations for the floor layout problem
- Risk averse Stackelberg security games with quantal response
- Discretization and global optimization for mixed integer bilinear programming
- Worst-case analysis of clique MIPs
- Low-Complexity Method for Hybrid MPC with Local Guarantees
- On the Derivation of Continuous Piecewise Linear Approximating Functions
- Learning in combinatorial optimization: what and how to explore
- Comparative analysis of several models of the same same mixed-integer nonlinear programing problem
- Online over time processing of combinatorial problems
- Solving mixed integer bilinear problems using MILP formulations
- Optimization of tree ensembles
- Incremental and encoding formulations for mixed integer programming
- Mixed-integer bilevel representability
- Behavioral modeling in weight loss interventions
- Exact algorithms for the equitable traveling salesman problem
- Structural investigation of piecewise linearized network flow problems
- Influence maximization with latency requirements on social networks
- Optimization in liner shipping
- Optimization in liner shipping
- Variations and extensions of Proll's integer linear programming formulation techniques for the graph partitioning problem
- Characterizations of mixed binary convex quadratic representable sets
- Network models with unsplittable node flows with application to unit train scheduling
- On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs
- Integer Programming Formulations for Minimum Spanning Tree Interdiction
- Optimization over decision trees: a case study for the design of stable direct-current electricity networks
- An interleaved depth-first search method for the linear optimization problem with disjunctive constraints
- Locally ideal formulations for piecewise linear functions with indicator variables
- Ideal, non-extended formulations for disjunctive constraints admitting a network representation
- A unified approach to mixed-integer optimization problems with logical constraints
- Small and strong formulations for unions of convex sets from the Cayley embedding
- Evaluating mixed-integer programming models over multiple right-hand sides
- Mixed-integer convex representability
- Mathematical programming formulations for piecewise polynomial functions
This page was built for publication: Mixed integer linear programming formulation techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808240)
