Strong formulations for mixed integer programming: A survey
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3908160 (Why is no real title available?)
- scientific article; zbMATH DE number 3568353 (Why is no real title available?)
- A Cutting Plane Algorithm for the Linear Ordering Problem
- A Deterministic Multi-Period Production Scheduling Model with Backlogging
- Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- Disjunctive Programming
- Lot-size models with backlogging: Strong reformulations and cutting planes
- Modelling with integer variables
- On the facial structure of scheduling polyhedra
- On the symmetric travelling salesman problem: Solution of a 120-city problem
- Partitioning procedures for solving mixed-variables programming problems
- Polyhedral Characterization of Discrete Dynamic Programming
- Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
- Solving Large-Scale Zero-One Linear Programming Problems
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- Subset Coefficient Reduction Cuts for 0/1 Mixed-Integer Programming
- The ellipsoid method and its consequences in combinatorial optimization
- The perfectly matchable subgraph polytope of a bipartite graph
- Uncapacitated lot-sizing: The convex hull of solutions
- Using separation algorithms to generate mixed integer model reformulations
- Valid Linear Inequalities for Fixed Charge Problems
- Valid inequalities and facets of the capacitated plant location problem
- Valid inequalities and separation for capacitated economic lot sizing
- Valid inequalities and separation for uncapacitated fixed charge networks
- Valid inequalities for mixed 0-1 programs
Cited in
(17)- Classical cuts for mixed-integer programming and branch-and-cut
- On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0-1 knapsack constraint
- Strong mixed-integer formulations for the floor layout problem
- An analytical comparison of different formulations of the travelling salesman problem
- \(O(n \log n)\) procedures for tightening cover inequalities
- Efficient reformulation for 0-1 programs -- methods and computational results
- Long range planning in the process industries: A projection approach
- Projections of the capacitated network loading problem
- Theoretical and computational advances for network diversion
- Nonconvex, lower semicontinuous piecewise linear optimization
- Stronger formulations of mixed integer linear programs: an example
- On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs
- Identification of unidentified equality constraints for integer programming problems
- The splitting of variables and constraints in the formulation of integer programming models
- Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints
- Supernode processing of mixed-integer models
- Scheduling two chains of unit jobs on one machine: a polyhedral study
This page was built for publication: Strong formulations for mixed integer programming: A survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121789)
