Mixed Integer Linear Programming Formulation Techniques (Q2808240)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Mixed Integer Linear Programming Formulation Techniques	scientific article

Statements

scholarly article

0 references

Mixed Integer Linear Programming Formulation Techniques (English)

0 references

zbMATH Open document ID

0 references

10.1137/130915303

0 references

Juan Pablo Vielma

0 references

0 references

publication date

20 May 2016

0 references

full work available at URL

http://hdl.handle.net/1721.1/96480

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

mixed integer linear programming

0 references

disjunctive programming

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

Conflict analysis in mixed integer programming

0 references

SCIP: solving constraint integer programs

0 references

A simple recipe for concise mixed 0-1 linearizations

0 references

Linear forms of nonlinear expressions: new insights on old ideas

0 references

Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs

0 references

Base-2 Expansions for Linearizing Products of Functions of Discrete Variables

0 references

A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems

0 references

Jointly Constrained Biconvex Programming

0 references

Forbidden Vertices

0 references

Disjunctive Programming

0 references

Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems

0 references

On the convex hull of the union of certain polyhedra

0 references

Disjunctive programming: Properties of the convex hull of feasible points

0 references

0 references

Branch-and-Price: Column Generation for Solving Huge Integer Programs

0 references

0 references

An algorithm for disjunctive programs

0 references

On Polyhedral Approximations of the Second-Order Cone

0 references

Dynamic resource allocation: a flexible and tractable modeling framework

0 references

0 references

0 references

Progress in computational mixed integer programming -- a look back from the other side of the tipping point

0 references

Representation for multiple right-hand sides

0 references

A theorem about antiprisms

0 references

Compact vs. exponential-size LP relaxations

0 references

Compact optimization can outperform separation: a case study in structural proteomics

0 references

Imposing Connectivity Constraints in Forest Planning Models

0 references

Scheduling projects with labor constraints

0 references

Extended formulations in combinatorial optimization

0 references

Integer Programming

0 references

Compact formulations as a union of polyhedra

0 references

Discontinuous piecewise linear optimization

0 references

Fifty-Plus Years of Combinatorial Integer Programming

0 references

Parsimonious binary-encoding in integer programming

0 references

Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs

0 references

Piecewise linear approximation of functions of two variables in MILP models

0 references

Discrete-Variable Extremum Problems

0 references

On the Significance of Solving Linear Programming Problems with Some Integer Variables

0 references

Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints

0 references

A special ordered set approach for optimizing a discontinuous separable piecewise linear function

0 references

Cutting planes for branch-and-price algorithms

0 references

Some properties of convex hulls of integer points contained in general convex sets

0 references

Solving Connected Subgraph Problems in Wildlife Conservation

0 references

Combination of Nonlinear and Linear Optimization of Transient Gas Networks

0 references

Linear vs. semidefinite extended formulations

0 references

A simplex algorithm for piecewise-linear programming I: Derivation and proof

0 references

A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy

0 references

A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications

0 references

Using Piecewise Linear Functions for Solving MINLPs

0 references

Improved Linear Integer Programming Formulations of Nonlinear Integer Problems

0 references

An Improved MIP Formulation for Products of Discrete and Continuous Variables

0 references

Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program

0 references

Smallest compact formulation for the permutahedron

0 references

Convex Polytopes

0 references

``Miniaturized'' linearizations for quadratic 0/1 problems

0 references

A linearization framework for unconstrained quadratic (0-1) problems

0 references

Model tightening for integrated timber harvest and transportation planning

0 references

Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables

0 references

Preface: history of integer programming: distinguished personal notes and reminiscences

0 references

Methods of Nonlinear 0-1 Programming

0 references

Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem

0 references

Different transformations for solving non-convex trim-loss problems by MINLP

0 references

Representation of Sets of Lattice Points

0 references

0 references

Hybrid Modeling

0 references

Integrated methods for optimization

0 references

Mixed logical-linear programming

0 references

0 references

Integer programming formulation of combinatorial optimization problems

0 references

Some Basis Theorems for Integral Monoids

0 references

Representations of unbounded optimization problems as integer programs

0 references

Representability in mixed integer programming. I: Characterization results

0 references

A simplification for some disjunctive formulations

0 references

Logic-based decision support. Mixed integer model formulation

0 references

Representability of functions

0 references

Modelling with integer variables

0 references

Experimental Results on the New Techniques for Integer Programming Formulations

0 references

Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition

0 references

0 references

50 Years of Integer Programming 1958-2008

0 references

Branched Polyhedral Systems

0 references

Constructing Extended Formulations from Reflection Relations

0 references

0 references

A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization

0 references

Equivalent Formulations of Nonlinear Integer Problems for Efficient Optimization

0 references

On mixing sets arising in chance-constrained programming

0 references

An Automatic Method of Solving Discrete Programming Problems

0 references

All-different polytopes

0 references

On a Binary-Encoded ILP Coloring Formulation

0 references

Polyhedral methods for piecewise-linear functions. I: The lambda method

0 references

Global Optimization for Generalized Geometric Programs with Mixed Free-Sign Variables

0 references

Reformulations in Mathematical Programming: Definitions and Systematics

0 references

Editorial: Reformulation techniques in mathematical programming

0 references

Connecting special ordered inequalities and transformation and reformulation technique in multiple choice programming

0 references

On the calculation of true and pseudo penalties in multiple choice integer programming

0 references

Mixed Integer Programming Computation

0 references

An integer programming approach for linear programs with probabilistic constraints

0 references

Using separation algorithms to generate mixed integer model reformulations

0 references

Polyhedral Characterization of Discrete Dynamic Programming

0 references

0 references

On the existence of optimal solutions to integer and mixed-integer programming problems

0 references

Integer and mixed-integer programming models: General properties

0 references

Mixed integer minimization models for piecewise-linear functions of a single variable

0 references

A theoretical and computational comparison of “equivalent” mixed-integer formulations

0 references

Rational Mixed-Integer and Polyhedral Union Minimization Models

0 references

Piecewise-linear approximations of multidimensional functions

0 references

Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations

0 references

On project scheduling with irregular starting time costs

0 references

Ideal representations of lexicographic orderings and base-2 expansions of integer variables

0 references

0 references

A note on modeling multiple choice requirements for simple mixed integer programming solvers

0 references

A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems

0 references

On the Value of Binary Expansions for General Mixed-Integer Linear Programs

0 references

The Boolean quadratic polytope: Some characteristics, facets and relatives

0 references

Approximating separable nonlinear functions via mixed zero-one programs

0 references

Location, scheduling, design and integer programming

0 references

Production Planning by Mixed Integer Programming

0 references

The Matching Polytope has Exponential Extension Complexity

0 references

Column Generation for Extended Formulations

0 references

A hierarchy of relaxations for linear generalized disjunctive programming

0 references

0 references

Combinatorial optimization. Polyhedra and efficiency (3 volumes)

0 references

A reformulation-linearization technique for solving discrete and continuous nonconvex problems

0 references

0 references

Fitting piecewise linear continuous functions

0 references

Reformulation and Decomposition of Integer Programs

0 references

Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions

0 references

A Note on “A Superior Representation Method for Piecewise Linear Functions”

0 references

Mixed integer linear programming formulations for probabilistic constraints

0 references

Nonconvex, lower semicontinuous piecewise linear optimization

0 references

Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints

0 references

Modeling disjunctive constraints with a logarithmic number of binary variables and constraints

0 references

Approximate extended formulations

0 references

0 references

Logic and integer programming

0 references

0 references

Expressing combinatorial optimization problems by linear programs

0 references

Incremental and encoding formulations for mixed integer programming

0 references

The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints

0 references

Lectures on Polytopes

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2808240

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2808240&oldid=36251217"