{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T12:20:07Z","timestamp":1791116407800,"version":"4.1.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1994,3]]},"DOI":"10.1007\/bf01582578","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:39:29Z","timestamp":1114677569000},"page":"295-323","source":"Crossref","is-referenced-by-count":30,"title":["Near-perfect matrices"],"prefix":"10.1007","volume":"64","author":[{"given":"F. B.","family":"Shepherd","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0602044","volume":"2","author":"S. Baum","year":"1981","unstructured":"S. Baum and L.E. Trotter Jr., \u201cInteger rounding for polymatroid and branching optimization problems,\u201dSIAM Journal on Algebraic and Discrete Methods 2 (1981) 416\u2013425.","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"CR2","unstructured":"C. Berge, \u201cFarbung von Graphen, deren samtliche bzw. deren ugerade Kreise starr sind,\u201dWissenschaftliche Zeitschrift, Martin Luther Universit\u00e4t Halle-Wittenberg (1961) 114."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0012-365X(79)90065-7","volume":"27","author":"R.G. Bland","year":"1979","unstructured":"R.G. Bland, H.C. Huang and L.E. Trotter Jr., Graphical properties related to minimal imperfection.Discrete Mathematics 27 (1979) 11\u201322.","journal-title":"Discrete Mathematics"},{"key":"CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory and Applications","author":"J.A. Bondy","year":"1976","unstructured":"J.A. Bondy and U.S.R. Murty,Graph Theory and Applications (McMillan, London, 1976)."},{"key":"CR5","unstructured":"K. Cameron, Polyhedral and algorithmic ramifications of antichains, Ph.D. Thesis, University of Waterloo (1982)."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0095-8956(75)90041-6","volume":"18","author":"V. Chv\u00e1tal","year":"1975","unstructured":"V. Chv\u00e1tal, On certain polytopes associated with graphs,Journal on Combinatorial Theory B 18 (1975) 138\u2013154.","journal-title":"Journal on Combinatorial Theory B"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0095-8956(76)90005-8","volume":"20","author":"V. Chv\u00e1tal","year":"1976","unstructured":"V. Chv\u00e1tal, On the strong perfect graph conjecture,Journal on Combinatorial Theory B 20 (1976) 139\u2013141.","journal-title":"Journal on Combinatorial Theory B"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0012-365X(79)90114-6","volume":"26","author":"V. Chv\u00e1tal","year":"1979","unstructured":"V. Chv\u00e1tal, R.L. Graham, A.F. Perold and S.H. Whitesides, Combinatorial designs related to the strong perfect graph conjecture,Discrete Mathematics 26 (1979) 83\u201392.","journal-title":"Discrete Mathematics"},{"key":"CR9","first-page":"193","volume":"21","author":"V. Chv\u00e1tal","year":"1984","unstructured":"V. Chv\u00e1tal, An equivalent version of the Strong Perfect Graph Conjecture,Annals of Discrete Mathematics 21 (1984) 193\u2013195.","journal-title":"Annals of Discrete Mathematics"},{"key":"CR10","unstructured":"W.J. Cook, personal communication (1987)."},{"key":"CR11","first-page":"57","volume":"16","author":"W.H. Cunningham","year":"1982","unstructured":"W.H. Cunningham, Polyhedra for composed independence systems, in: A. Bachem, M. Gr\u00f6tschel and B. Korte, eds., Bonn Workshop on Combinatorial Optimization,Annals of Discrete Mathematics 16 (1982) 57\u201367.","journal-title":"Annals of Discrete Mathematics"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/B978-0-12-358350-5.50006-3","volume-title":"Mathematical Programming","author":"D.R. Fulkerson","year":"1973","unstructured":"D.R. Fulkerson, \u201cOn the perfect graph theorem,\u201d in: T.C. Hu and S. Robinson, eds.,Mathematical Programming (Academic Press, New York, 1973) 69\u201376."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz and A. Schrijver, The ellipsoid algorithm and its consequences in combinatorial optimization,Combinatorica 1 (1981) 169\u2013197.","journal-title":"Combinatorica"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0095-8956(72)90045-7","volume":"13","author":"L. Lov\u00e1sz","year":"1972","unstructured":"L. Lov\u00e1sz, A characterization of perfect graphs,Journal on Combinatorial Theory B 13 (1972) 95\u201398.","journal-title":"Journal on Combinatorial Theory B"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","volume":"2","author":"L. Lov\u00e1sz","year":"1972","unstructured":"L. Lov\u00e1sz, Normal hypergraphs and the perfect graph conjecture,Discrete Mathematics 2 (1972) 253\u2013267.","journal-title":"Discrete Mathematics"},{"key":"CR16","first-page":"55","volume-title":"Graph Theory, 2","author":"L. Lov\u00e1sz","year":"1983","unstructured":"L. Lov\u00e1sz, \u201cPerfect Graphs,\u201d in:Graph Theory, 2 (Academic Press Inc., London, 1983) 55\u201387."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"M.W. Padberg","year":"1973","unstructured":"M.W. Padberg, On the facial structure of set packing polyhedra,Mathematical Programming 5 (1973) 199\u2013215.","journal-title":"Mathematical Programming"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/BF01580235","volume":"6","author":"M.W. Padberg","year":"1974","unstructured":"M.W. Padberg, Perfect zero-one matrices,Mathematical Programming 6 (1974) 180\u2013196.","journal-title":"Mathematical Programming"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0024-3795(76)90079-3","volume":"15","author":"M.W. Padberg","year":"1976","unstructured":"M.W. Padberg, Almost integral polyhedra related to certain combinatorial optimization problems,Linear Algebra and its Applications 15 (1976) 339\u2013342.","journal-title":"Linear Algebra and its Applications"},{"key":"CR20","volume-title":"Optimization, Handbooks in Operations Research and Management Science, Vol. 1","author":"W.R. Pulleyblank","year":"1989","unstructured":"W.R. Pulleyblank, \u201cPolyhedral combinatorics,\u201d in: G.L Nemhauser, A.H.G. Rinnoy and M.J. Todd, eds.,Optimization, Handbooks in Operations Research and Management Science, Vol. 1 (North-Holland, Amsterdam, 1989)."},{"key":"CR21","unstructured":"B. Reed, private communication (1990)."},{"key":"CR22","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"A. Schrijver,Theory of Linear and Integer Programming (Wiley, New York, 1986)."},{"key":"CR23","unstructured":"F.B. Shepherd, Near-perfection and stable set polyhedra, PhD Thesis, University of Waterloo (1990)."},{"key":"CR24","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0095-8956(77)90064-8","volume":"23","author":"A. Tucker","year":"1977","unstructured":"A. Tucker, Critical perfect graphs and perfect 3-chromatic graphs,Journal on Combinatorial Theory B 23 (1977) 143\u2013149.","journal-title":"Journal on Combinatorial Theory B"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582578.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01582578\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582578","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:15:51Z","timestamp":1556896551000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01582578"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":24,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["BF01582578"],"URL":"https:\/\/doi.org\/10.1007\/bf01582578","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}