Strong formulations for mixed integer programming: A survey
From MaRDI portal
Publication:1121789
DOI10.1007/BF01589102zbMath0674.90072OpenAlexW2088879400MaRDI QIDQ1121789
Publication date: 1989
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01589102
Mixed integer programming (90C11) Deterministic network models in operations research (90B10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Supernode processing of mixed-integer models, Long range planning in the process industries: A projection approach, \(O(n \log n)\) procedures for tightening cover inequalities, Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints, An analytical comparison of different formulations of the travelling salesman problem, Classical cuts for mixed-integer programming and branch-and-cut, Nonconvex, lower semicontinuous piecewise linear optimization, Identification of unidentified equality constraints for integer programming problems, Efficient reformulation for 0-1 programs -- methods and computational results, Theoretical and computational advances for network diversion, On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs, The splitting of variables and constraints in the formulation of integer programming models, Scheduling two chains of unit jobs on one machine: A polyhedral study, Projections of the capacitated network loading problem, On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0-1 knapsack constraint
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Valid inequalities and separation for uncapacitated fixed charge networks
- Valid inequalities for mixed 0-1 programs
- Valid inequalities and separation for capacitated economic lot sizing
- Lot-size models with backlogging: Strong reformulations and cutting planes
- Partitioning procedures for solving mixed-variables programming problems
- The ellipsoid method and its consequences in combinatorial optimization
- Using separation algorithms to generate mixed integer model reformulations
- Valid inequalities and facets of the capacitated plant location problem
- The perfectly matchable subgraph polytope of a bipartite graph
- A Cutting Plane Algorithm for the Linear Ordering Problem
- Modelling with integer variables
- Uncapacitated lot-sizing: The convex hull of solutions
- Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems
- Polyhedral Characterization of Discrete Dynamic Programming
- Solving Large-Scale Zero-One Linear Programming Problems
- Valid Linear Inequalities for Fixed Charge Problems
- On the facial structure of scheduling polyhedra
- Subset Coefficient Reduction Cuts for 0/1 Mixed-Integer Programming
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- On the symmetric travelling salesman problem: Solution of a 120-city problem
- Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
- Disjunctive Programming
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- A Deterministic Multi-Period Production Scheduling Model with Backlogging
