Facet of regular O-1 polytopes.(English)Zbl 0314.90064
Cite
Full Text:DOI
References:
| [1] | E. Balas and R. Jeroslow, ”Cannonical cuts on the unit hypercube”,Management Sciences Research Report Series, No. 198(R), Carnegie-Mellon University, Pittsburgh, Pa. August–December 1969, revised February 1971). ·Zbl 0237.52004 |
| [2] | V. Chvátal, ”Edmonds polyhedra and a hierarchy of combinatorial problems”,Discrete Mathematics 4 (1973) 305–337. ·Zbl 0253.05131 ·doi:10.1016/0012-365X(73)90167-2 |
| [3] | F. Glover, ”Unit-coefficient inequalities for zero–one programming”, Management ScienceReport Series, No. 73-7University of Colorado, Boulder, Colo. (July 1973). |
| [4] | F. Glover, ”Polyhedra Annexations in mixed integer programming”,Management Science Report Series, No. 73-9University of Colorado, Boulder, Colo. (August 1973). |
| [5] | R.E. Gomory, ”Some polyhedra related to combinatorial problems”,Linear Algebra and its Applications 2 (1969) 451–558. ·Zbl 0184.23103 ·doi:10.1016/0024-3795(69)90017-2 |
| [6] | P.L. Hammer, E.L. Johnson and U.N. Peled: ”Regular 0–1 programs”, Combinatorics and Optimization Research Rept., University of Waterloo, Waterloo, Ont., CORR No. 73-18 (September 1973). ·Zbl 0304.90081 |
| [7] | S.T. Hu,Threshold logic (University of California Press, Berkely, Calif., 1965). ·Zbl 0166.27101 |
| [8] | S. Muroga,Threshold logic and its applications (Wiley–Interscience, New York, 1971). ·Zbl 0243.94014 |
| [9] | G.L. Nemhauser and L.E. Trotter, Jr., ”Properties of vertex packing and independence system polyhedra”,Mathematical Programming 6 (1974) 48–61. ·Zbl 0281.90072 ·doi:10.1007/BF01580222 |
| [10] | M.W. Padberg, ”A note on zero–one programming”, Combinatorics and Optimization Research Rept., CORR No. 73-5, University of Waterloo, Waterloo, Ont. (March 1973). |
| [11] | U.N. Peled: ”An Elementary Calculation of the Circulant Determinant”, University of Waterloo, Ont. Combinatorics and Optimization Research Rept. CORR No. 73-27 (October 1973). |
| [12] | M.A. Pollatschek, ”Algorithms on finite weighted graphs”, Ph.D. Thesis, Technion-Israel Institute of Technology, Faculty of Industrial and Management Engineering (1970) (in Hebrew, with English Synopsis). |
| [13] | K. Spielberg, ”Minimal preferred variable reduction for zero–one programming, Tech. Rept. No. 320-3013 IBM Philadelphia Scientific Center (July 1972). |
| [14] | R.O. Winder, ”Threshold logic”, Ph. D. Thesis, Princeton University, Princeton, N.J.Mathematics Department (1962). ·Zbl 0146.14505 |
| [15] | L.A. Wolsey, ”Faces for linear inequalities in 0–1 variables”, Centre for Operations Research and Econometrics, Louvain (July 1973). |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
