Abstract
We consider combinatorial programming problems of the form (LP): max {cx|Ax ≤e, xj=0 or 1, vj}, where A is a mxn matrix of zeroes and ones, e is a column vector of m ones and c is an arbitrary (non-negative) vector of reals. Applications of this general problem include crew scheduling, political districting and others. In this paper we first summarize (without proofs) the results of a companion paper that completely characterize matrices A for Which.(IP) can be solved as an ordinary linear programming problem, i.e. where the relaxed linear program (LP): max{cx|Ax ≤e, xj≥0,vj} produces an integral solution no matter what linear form cx is maximized. (Zero-one matrices with this property are termed “perfect”). Some additional concepts and results are stated. It is shown that every totally unimodular zero-one matrix as well as every “balanced” zero-one matrix is perfect. Finally, in the concluding remarks, a reformulation of the strong perfect graph due to C. BERGE is given and some recent trends in zezo-one programming are delineated.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Reference
Arabeyre, J.P.,J. Feamley, F. Steiger and W. Teather: “The Airline Crew Scheduling Problem: A Survey”, Transportation Science, 3(1969), pp. 140–163.
Balas, E.: “Facets of the Kiapsack Polytope”, Carnegie-Mellon University, Management Sciences Research Report No. 323, September 1973.
Balas, E., and M.W. Padberg: “On the Set Covering Problem”, Operations Research, 20(1972), pp. 1152–1161.
Balas, E., and M.W. Padberg: “On the Set Covering Prcfolem II: An Algorithm”, Management Sciences Research Report No. 278, GSIA, Carnegie-Mellon University, Pittsburgh, Pa. (presented at the Joint National Meeting of ORSA, TIMS, AIEE, at Atlantic City, November 8–10, 1972).
Berge, C.: Graphes et Hypergraphes, Diaiod, Paris 1970.
Berge, C.: Introduction à la Theorie des Hypergraphes, Lectures notes, Université de Montreal, Summer 1971.
Berge, C.: “Balanced Matrices”, Mathematical Programming, 2(1972), pp. 19–31.
Chvátal, V.: “Edmonds Polyhedra and a Hierarchy of Combinatorial Problems” Discrete Mathematics, 4(1973), pp. 305–337.
Edmonds, J.: “Maximum Matching and a Polyhedron with 0,1 Vertices”, Journal of Research of the National Bureau of Standards, 69B(1965), pp. 125–130.
Fulkerson, D.R.: “Blocking and Anti-blocking Pairs of Polyhedra”, Mathematical Programming, 1(1971), pp. 168–194.
Garfinkel, R. and G. Nemhauser: Integer Programing, John Wiley & Sons, 1972.
Glover, F.: “Uhi t-Cœf f icient Inequalities for Zero-One Prograitming”, University of Colorado, Management Sciences Report Series, No. 73–7, July 1973.
Hammer, P.L., E.L. Johnson and U.N. Peled: “Regular 0–1 Programs”, University of Waterloo, Ccmbinatorics and Optimization Research Report, CORR No. 73–18, Septenfoer 1973.
Hammer, P.L., E.L. Johnson and U.N. Peled: “Facets of Regular 0–1 Polytopes”, University of Waterloo, Combinatorics and Optimization Research Report, CORR No. 73–19, October 1973.
Höffmann, A. J.: “On Goirbinatorical Problems and Linear Inequalities”, IBM Watson Research Center, Yorktown Heights, N.Y., paper presented at the 8th International Syirposium on Mathematical Programming, Stanford, August 1973.
Lovász, L.: “Normal Hypergraphs and the Perfect Graph Conjecture”, Discrete Mathematics, 2(1972), pp. 253–268.
Padberg, M.W.: Essays in Integer Programming, Ph.D. Thesis, Carnegie-Mellon University, Pittsburg, Pa. (April 1971), unpublished.
Padberg, M.W.: “On the Facial Structure of Set Packing Polyhedra”, IIM-Report No. I/72–13, International Institute of Management, Berlin, forthcoming in Mathematical Programming.
Padberg, M.W.: “Perfect Zero-One Matrices”, IM-Report No. I/73–8, International Institute of Management, Berlin, forthcoming in Mathematical Programming.
Padberg, M.W. “A Note on Zero-One Prograitming”, University of Waterloo, Combinatorics and Optimization Research Report, CORR No. 73–5, March 1973.
Trotter, L.: Solution Characteristics and Algorithms for the Vertex Packing Problem, Technical Report No. 168, Ph.D. Thesis, Cornell University, January 1973.
Wolsey, L.A.: “Faces for Linear Inequalities in 0–1 Variables”, Université Catholique de Louvain, CORE Discussion paper No. 7338, November 1973.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1974 Physica-Verlag, Rudolf Liebing KG, Würzburg
About this paper
Cite this paper
Padberg, M. (1974). Perfect Zero-One Matrices — II. In: Gessner, P., Henn, R., Steinecke, V., Todt, H. (eds) DGOR Papers of the Annual Meeting 1973 / Vorträge der Jahrestagung 1973. Proceedings in Operations Research, vol 1973. Physica-Verlag HD. https://doi.org/10.1007/978-3-642-99747-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-99747-1_7
Publisher Name: Physica-Verlag HD
Print ISBN: 978-3-7908-0138-5
Online ISBN: 978-3-642-99747-1
eBook Packages: Springer Book Archive