Incremental and encoding formulations for mixed integer programming
From MaRDI portal
Publication:2450751
DOI10.1016/j.orl.2013.09.004zbMath1287.90040OpenAlexW2035920312MaRDI QIDQ2450751
Sercan Yıldız, Juan Pablo Vielma
Publication date: 15 May 2014
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/107938
Related Items (11)
Linearization technique with superior expressions for centralized planning problem with discount policy ⋮ Sequence of polyhedral relaxations for nonlinear univariate functions ⋮ Alternative solution algorithm for winner determination problem with quantity discount of transportation service procurement ⋮ Tighter MIP formulations for the discretised unit commitment problem with MIN-stop ramping constraints ⋮ A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables ⋮ A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints ⋮ New multi-commodity flow formulations for the pooling problem ⋮ Mixed Integer Linear Programming Formulation Techniques ⋮ Enhanced linear reformulation for engineering optimization models with discrete and bounded continuous variables ⋮ An optimization approach for winner determination problem considering transportation cost discounts ⋮ Deterministic model for customized pilot manufacture production with various backplane sizes
Cites Work
- Unnamed Item
- Mixed integer linear programming formulations for probabilistic constraints
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- An integer programming approach for linear programs with probabilistic constraints
- Nonconvex, lower semicontinuous piecewise linear optimization
- A simplification for some disjunctive formulations
- On the convex hull of the union of certain polyhedra
- On the calculation of true and pseudo penalties in multiple choice integer programming
- Integer programming formulation of combinatorial optimization problems
- Location, scheduling, design and integer programming
- Approximating separable nonlinear functions via mixed zero-one programs
- Connecting special ordered inequalities and transformation and reformulation technique in multiple choice programming
- A note on modeling multiple choice requirements for simple mixed integer programming solvers
- Representation for multiple right-hand sides
- Using Piecewise Linear Functions for Solving MINLPs
- Global Optimization for Generalized Geometric Programs with Mixed Free-Sign Variables
- Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
- Modelling with integer variables
- On the Solution of Discrete Programming Problems
- On the Significance of Solving Linear Programming Problems with Some Integer Variables
- Base-2 Expansions for Linearizing Products of Functions of Discrete Variables
- On project scheduling with irregular starting time costs
- Scheduling projects with labor constraints
This page was built for publication: Incremental and encoding formulations for mixed integer programming
