Incremental and encoding formulations for mixed integer programming
From MaRDI portal
Publication:2450751
Recommendations
- Locally ideal formulations for piecewise linear functions with indicator variables
- Mixed integer linear programming formulation techniques
- Formulation of multiple-choice situations in linear programming models using binary coding matrices
- A geometric way to build strong mixed-integer programming formulations
- Mixed-Integer Linear-Programming Formulation of a Multi-Attribute Threshold Model of Choice
Cites work
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- A note on modeling multiple choice requirements for simple mixed integer programming solvers
- A simplification for some disjunctive formulations
- An integer programming approach for linear programs with probabilistic constraints
- Approximating separable nonlinear functions via mixed zero-one programs
- Base-2 expansions for linearizing products of functions of discrete variables
- Connecting special ordered inequalities and transformation and reformulation technique in multiple choice programming
- Global optimization for generalized geometric programs with mixed free-sign variables
- Integer programming formulation of combinatorial optimization problems
- Location, scheduling, design and integer programming
- Mixed integer linear programming formulations for probabilistic constraints
- Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- Modelling with integer variables
- Nonconvex, lower semicontinuous piecewise linear optimization
- On project scheduling with irregular starting time costs
- On the Significance of Solving Linear Programming Problems with Some Integer Variables
- On the Solution of Discrete Programming Problems
- On the calculation of true and pseudo penalties in multiple choice integer programming
- On the convex hull of the union of certain polyhedra
- Representation for multiple right-hand sides
- Scheduling projects with labor constraints
- Using Piecewise Linear Functions for Solving MINLPs
Cited in
(16)- A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables
- Linearization technique with superior expressions for centralized planning problem with discount policy
- MIP relaxations in factorable programming
- A combinatorial approach for small and strong formulations of disjunctive constraints
- Sequence of polyhedral relaxations for nonlinear univariate functions
- Comments on ``enhancements on the hyperplanes arrangements in mixed-integer programming techniques
- Mixed-integer programming approaches for index tracking and enhanced indexation
- Mixed integer linear programming formulation techniques
- An optimization approach for winner determination problem considering transportation cost discounts
- Alternative solution algorithm for winner determination problem with quantity discount of transportation service procurement
- Mixed-Integer Linear-Programming Formulation of a Multi-Attribute Threshold Model of Choice
- Tighter MIP formulations for the discretised unit commitment problem with MIN-stop ramping constraints
- Enhanced linear reformulation for engineering optimization models with discrete and bounded continuous variables
- New multi-commodity flow formulations for the pooling problem
- Deterministic model for customized pilot manufacture production with various backplane sizes
- Encoding binary arithmetic operations in integer programming formulations
This page was built for publication: Incremental and encoding formulations for mixed integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2450751)
