Using separation algorithms to generate mixed integer model reformulations
- 1 April 1991
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 10 (3) , 119-128
- https://doi.org/10.1016/0167-6377(91)90028-n
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- On the cut polytopeMathematical Programming, 1986
- Valid inequalities and separation for uncapacitated fixed charge networksOperations Research Letters, 1985
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization ProblemsSIAM Journal on Algebraic Discrete Methods, 1985
- Minimum cuts, modular functions, and matroid polyhedraNetworks, 1985
- A dual ascent approach for steiner tree problems on a directed graphMathematical Programming, 1984
- Modelling with integer variablesPublished by Springer Nature ,1984
- Uncapacitated lot-sizing: The convex hull of solutionsPublished by Springer Nature ,1984
- The perfectly matchable subgraph polytope of a bipartite graphNetworks, 1983
- Operations that preserve total dual integralityOperations Research Letters, 1983
- A Selection Problem of Shared Fixed Costs and Network FlowsManagement Science, 1970