{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T08:44:35Z","timestamp":1751877875283},"reference-count":41,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2001,9]]},"DOI":"10.1016\/s0377-2217(00)00056-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:40:30Z","timestamp":1027618830000},"page":"455-461","source":"Crossref","is-referenced-by-count":7,"title":["Perfect, ideal and balanced matrices"],"prefix":"10.1016","volume":"133","author":[{"given":"Michele","family":"Conforti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e9rard","family":"Cornu\u00e9jols","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ajai","family":"Kapoor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kristina","family":"Vu\u0161kovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(00)00056-4_BIB1","unstructured":"C. Berge, F\u00e4rbung von Graphen deren s\u00e4mtliche bzw. deren ungerade Kreise starr sind (Zusammenfassung), Wissenschaftliche Zeitschrift, Martin Luther Universit\u00e4t Halle-Wittenberg, Mathematisch-Naturwissenschaftliche Reihe, 1961, 114\u2013115"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB2","unstructured":"C. Berge, Sur certains hypergraphes g\u00e9n\u00e9ralisant les graphes bipartis, in: P. Erd\u00f6s, A. R\u00e9nyi, V. S\u00f3s (Eds.), Combinatorial Theory and its Applications I, Colloq. Math. Soc. J\u00e1nos Bolyai, vol. 4, North-Holland, Amsterdam, 1970, pp. 119\u2013133"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB3","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF01584535","article-title":"Balanced matrices","volume":"2","author":"Berge","year":"1972","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB4","doi-asserted-by":"crossref","unstructured":"C. Berge, V. Chv\u00e1tal, Topics on perfect graphs, Annals of Discrete Mathematics, vol. 21, North-Holland, Amsterdam, 1984, pp. 225\u2013252","DOI":"10.1016\/S0304-0208(08)72921-9"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB5","first-page":"32","article-title":"Sur un Th\u00e9or\u00e8me du Type K\u00f6nig pour les Hypergraphes","volume":"175","author":"Berge","year":"1970","journal-title":"Annals of the New York Academy of Sciences"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB6","doi-asserted-by":"crossref","unstructured":"A. Caprara, M. Fischetti, P. Toth, A heuristic algorithm for the set covering problem, in: W.H. Cunningham, S.T. McCormick, M. Queyranne (Eds.), Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, vol. 1084, Springer, Berlin, 1996, pp. 72\u201381","DOI":"10.1007\/3-540-61310-2_6"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB7","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0095-8956(75)90041-6","article-title":"On certain polytopes associated with graphs","volume":"13","author":"Chv\u00e1tal","year":"1975","journal-title":"Journal of Combinatorial Theory B"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB8","doi-asserted-by":"crossref","unstructured":"M. Conforti, G. Cornu\u00e9jols, Clutters that pack and the max flow min cut property: A conjecture, in: W.R. Pulleyblank, F.B. Shepherd (Eds.), The Fourth Bellairs Workshop on Combinatorial Optimization, 1993","DOI":"10.21236\/ADA277340"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB9","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF01590956","article-title":"Balanced 0,\u00b11 matrices, bicoloring and total dual integrality","volume":"71","author":"Conforti","year":"1995","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB10","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1145\/210118.210137","article-title":"A class of logic problems solvable by linear programming","volume":"42","author":"Conforti","year":"1995","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB11","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0024-3795(96)00773-2","article-title":"Perfect 0,\u00b11 matrices","volume":"43","author":"Conforti","year":"1997","journal-title":"Linear Algebra and its Applications"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB12","unstructured":"M. Conforti, G. Cornu\u00e9jols, A. Kapoor, K. Vu\u0161kovi\u0107, Balanced 0,\u00b11 Matrices, Parts I and II, preprints, Carnegie Mellon University, 1993"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB13","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF01261318","article-title":"Perfect matchings in balanced hypergraphs","volume":"16","author":"Conforti","year":"1996","journal-title":"Combinatorica"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB14","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1006\/jctb.1999.1932","article-title":"Decomposition of balanced matrices","volume":"77","author":"Conforti","year":"1999","journal-title":"Journal of Combinatorial Theory B"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB15","unstructured":"G. Cornu\u00e9jols, B. Guenin, Ideal Binary Clutters, Connectivity and a Conjecture of Seymour, preprint, Carnegie Mellon University, 1999"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB16","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1006\/jctb.1994.1009","volume":"60","author":"Cornu\u00e9jols","year":"1994","journal-title":"Journal of Combinatorial Theory B"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB17","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/S0022-247X(62)80004-3","article-title":"The extremal length of a network","volume":"5","author":"Duffin","year":"1962","journal-title":"Journal of Mathematical Analysis and Applications"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB18","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0167-5060(08)70734-9","article-title":"A min\u2013max relation for submodular functions on graphs","volume":"1","author":"Edmonds","year":"1977","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB19","series-title":"Flows in Networks","author":"Ford","year":"1962"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB20","unstructured":"D.R. Fulkerson, The perfect graph conjecture and pluperfect graph theorem, in: R.C. Bose et al. (Eds.), Proceedings of the Second Chapel Hill Conference on Combinatorial Mathematics and its Applications, University of North Carolina, Chapel Hill, NC, 1970, pp. 171\u2013175"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB21","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1287\/moor.23.2.322","article-title":"Perfect and ideal 0,\u00b11 matrices","volume":"23","author":"Guenin","year":"1998","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB22","doi-asserted-by":"crossref","unstructured":"B. Guenin, A Characterization of Weakly Bipartite Graphs, in: R.E. Bixby, E.A. Boyd, R.Z. Rios-Mercado (Eds.), Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, vol. 1412, 1998, pp. 9\u201322","DOI":"10.1007\/3-540-69346-7_2"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB23","series-title":"Linear Inequalities and Related Systems","first-page":"223","article-title":"Integral boundary points of convex polyhedra","author":"Hoffman","year":"1956"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02592142","article-title":"Resolution and the integrality of satisfiability polytopes","volume":"74","author":"Hooker","year":"1996","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB25","first-page":"169","article-title":"Degree-two inequalities, clique facets and biperfect graphs","volume":"16","author":"Johnson","year":"1985","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB26","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1016\/0031-3203(89)90004-6","article-title":"Similarity retrieval of iconic image database","volume":"22","author":"Lee","year":"1989","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB27","doi-asserted-by":"crossref","unstructured":"A. Lehman, On the width\u2013length inequality, mimeographic notes (1965), published: Mathematical Programming 17 (1979) 403\u2013417","DOI":"10.1007\/BF01588263"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB28","unstructured":"A. Lehman, On the width-length inequality and degenerate projective planes, unpublished manuscript (1981), published: Polyhedral Combinatorics, in: W. Cook, P.D. Seymour (Eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 1, American Mathematical Society, Providence, RI, 1990, pp. 101\u2013105"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB29","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","article-title":"Normal hypergraphs and the perfect graph conjecture","volume":"2","author":"Lov\u00e1sz","year":"1972","journal-title":"Discrete Mathematics"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB30","doi-asserted-by":"crossref","DOI":"10.1007\/BF01194398","article-title":"A catalog of minimally nonideal matrices","volume":"47","author":"L\u00fctolf","year":"1998","journal-title":"Mathematical Methods of Operations Research"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB31","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/0016-0032(56)90044-8","article-title":"Reliable circuits using less reliable relays","volume":"262","author":"Moore","year":"1956","journal-title":"Journal of the Franklin Institute"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB32","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01581169","article-title":"(0,\u00b11) Ideal matrices","volume":"80","author":"Nobili","year":"1998","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB33","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/BF01580235","article-title":"Perfect zero\u2013one matrices","volume":"6","author":"Padberg","year":"1974","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB34","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB35","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/BF02592194","article-title":"Binary integer programs with two variables per inequality","volume":"75","author":"Sewell","year":"1996","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB36","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0095-8956(77)90031-4","article-title":"The matroids with the max-flow min-cut property","volume":"28","author":"Seymour","year":"1977","journal-title":"Journal of Combinatorial Theory B"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB37","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0195-6698(81)80033-9","article-title":"Matroids and multicommodity flows","volume":"2","author":"Seymour","year":"1981","journal-title":"European Journal of Combinatorics"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB38","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0041-1647(68)90016-6","article-title":"Scheduling of traffic lights \u2013 a new approach","volume":"2","author":"Stoffers","year":"1968","journal-title":"Transportation Research"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB39","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1137\/0604036","article-title":"A class of balanced matrices arising from location problems","volume":"4","author":"Tamir","year":"1983","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB40","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0166-218X(87)90062-X","article-title":"Totally balanced and totally unimodular matrices defined by center location poblems","volume":"16","author":"Tamir","year":"1987","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(00)00056-4_BIB41","series-title":"Introduction to Graph Theory","author":"West","year":"1996"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221700000564?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221700000564?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,14]],"date-time":"2020-01-14T17:17:30Z","timestamp":1579022250000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221700000564"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["S0377221700000564"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(00)00056-4","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}