Representability in mixed integer programmiing, I: Characterization results
- 1 June 1987
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 17 (3) , 223-243
- https://doi.org/10.1016/0166-218x(87)90026-6
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Experimental Results on the New Techniques for Integer Programming FormulationsJournal of the Operational Research Society, 1985
- Constructive characterizations of the value function of a mixed-integer program IIDiscrete Applied Mathematics, 1985
- Constructive characterizations of the value-function of a mixed-integer program IDiscrete Applied Mathematics, 1984
- A theoretical and computational comparison of “equivalent” mixed‐integer formulationsNaval Research Logistics Quarterly, 1981
- Mixed integer minimization models for piecewise-linear functions of a single variableDiscrete Mathematics, 1976
- Integer programming formulation of combinatorial optimization problemsDiscrete Mathematics, 1976
- Polyhedral annexation in mixed integer and combinatorial programmingMathematical Programming, 1975
- Integer and mixed-integer programming models: General propertiesJournal of Optimization Theory and Applications, 1975
- Some polyhedra related to combinatorial problemsLinear Algebra and its Applications, 1969
- Elementare Theorie der konvexen PolyederCommentarii Mathematici Helvetici, 1934