{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:59:11Z","timestamp":1725559151600},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540261995"},{"type":"electronic","value":"9783540321026"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496915_22","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T16:40:39Z","timestamp":1279125639000},"page":"291-305","source":"Crossref","is-referenced-by-count":6,"title":["Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs"],"prefix":"10.1007","author":[{"given":"Friedrich","family":"Eisenbrand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianpaolo","family":"Oriolo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gautier","family":"Stauffer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Ventura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","volume-title":"Network flows","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows. Prentice Hall Inc., Englewood Cliffs (1993)"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/3-540-47867-1_10","volume-title":"Integer Programming and Combinatorial Optimization","author":"K. Andersen","year":"2002","unstructured":"Andersen, K., Cornu\u00e9jols, G., Li, Y.: Split closure and intersection cuts. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol.\u00a02337, pp. 127\u2013144. Springer, Heidelberg (2002)"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"1074","DOI":"10.1287\/opre.28.5.1074","volume":"28","author":"J.J. Bartholdi","year":"1980","unstructured":"Bartholdi, J.J., Orlin, J.B., Ratliff, H.: Cyclic scheduling via integer programs with circular ones. Operations Research\u00a028, 1074\u20131085 (1980)","journal-title":"Operations Research"},{"key":"#cr-split#-22_CR4.1","doi-asserted-by":"crossref","unstructured":"Caprara, A., Letchford, A.N.: On the separation of split cuts and related inequalities. In: Mathematical Programming. A Publication of the Mathematical Programming Society 94(2-3, Ser. B), 279???294 (2003);","DOI":"10.1007\/s10107-002-0320-3"},{"key":"#cr-split#-22_CR4.2","unstructured":"The Aussois 2000 Workshop in Combinatorial Optimization"},{"key":"22_CR5","unstructured":"Chudnovsky, M.: Personal communication (2004)"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Chudnovsky, M., Seymour, P.: The structure of claw-free graphs. In: Proceedings of the Bristish Combinatorial Conference, Durham (2005) (to appear)","DOI":"10.1017\/CBO9780511734885.008"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0012-365X(73)90167-2","volume":"4","author":"V. Chv\u00e1tal","year":"1973","unstructured":"Chv\u00e1tal, V.: Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Mathematics\u00a04, 305\u2013337 (1973)","journal-title":"Discrete Mathematics"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF01580858","volume":"47","author":"W. Cook","year":"1990","unstructured":"Cook, W., Kannan, R., Schrijver, A.: Chv\u00e1tal closures for mixed integer programming problems. Mathematical Programming\u00a047, 155\u2013174 (1990)","journal-title":"Mathematical Programming"},{"key":"22_CR9","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Maximum matching and a polyhedron with 0,1-vertices. Journal of Research of the National Bureau of Standards\u00a069, 125\u2013130 (1965)","journal-title":"Journal of Research of the National Bureau of Standards"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees and flowers. Canadian Journal of Mathematics\u00a017, 449\u2013467 (1965)","journal-title":"Canadian Journal of Mathematics"},{"issue":"2","key":"22_CR11","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s004930050057","volume":"19","author":"F. Eisenbrand","year":"1999","unstructured":"Eisenbrand, F.: On the membership problem for the elementary closure of a polyhedron. Combinatorica\u00a019(2), 297\u2013300 (1999)","journal-title":"Combinatorica"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jctb.1996.1715","volume":"69","author":"A. Galluccio","year":"1997","unstructured":"Galluccio, A., Sassano, A.: The rank facets of the stable set polytope for claw-free graphs. Journal on Combinatorial Theory\u00a069, 1\u201338 (1997)","journal-title":"Journal on Combinatorial Theory"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Gijswijt, D.: On a packet scheduling problem for smart antennas and polyhedra defined by circular ones matrices. Submitted to Siam Journal of Discrete Mathematics (2003)","DOI":"10.1016\/j.endm.2004.03.035"},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0095-8956(81)90033-2","volume":"31","author":"R. Giles","year":"1981","unstructured":"Giles, R., jun, L.E.T.: On stable set polyhedra for k (1,3)-free graphs. Journal on Combinatorial Theory\u00a031, 313\u2013326 (1981)","journal-title":"Journal on Combinatorial Theory"},{"key":"22_CR15","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","volume":"64","author":"R.E. Gomory","year":"1958","unstructured":"Gomory, R.E.: Outline of an algorithm for integer solutions to linear programs. Bulletin of the American Mathematical Society\u00a064, 275\u2013278 (1958)","journal-title":"Bulletin of the American Mathematical Society"},{"issue":"2","key":"22_CR16","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica\u00a01(2), 169\u2013197 (1981)","journal-title":"Combinatorica"},{"key":"22_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Berlin (1988)"},{"issue":"4","key":"22_CR18","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1137\/0211053","volume":"11","author":"R.M. Karp","year":"1982","unstructured":"Karp, R.M., Papadimitriou, C.H.: On linear characterizations of combinatorial optimization problems. SIAM Journal on Computing\u00a011(4), 620\u2013632 (1982)","journal-title":"SIAM Journal on Computing"},{"key":"22_CR19","first-page":"1093","volume":"244","author":"L. Khachiyan","year":"1979","unstructured":"Khachiyan, L.: A polynomial algorithm in linear programming. Doklady Akademii Nauk SSSR\u00a0244, 1093\u20131097 (1979)","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"22_CR20","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s001860300317","volume":"59","author":"T.M. Liebling","year":"2004","unstructured":"Liebling, T.M., Oriolo, G., Spille, B., Stauffer, G.: On the non-rank facets of the stable set polytope of claw-free graphs and circulant graphs. Mathematical Methods of Operations Research\u00a059, 25\u201335 (2004)","journal-title":"Mathematical Methods of Operations Research"},{"key":"22_CR21","volume-title":"Matching Theory","author":"L. Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz, L., Plummer, M.: Matching Theory. North-Holland, Amsterdam (1986)"},{"key":"22_CR22","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/0095-8956(80)90074-X","volume":"28","author":"G.J. Minty","year":"1980","unstructured":"Minty, G.J.: On maximal independent sets of vertices in claw-free graphs. Journal on Combinatorial Theory\u00a028, 284\u2013304 (1980)","journal-title":"Journal on Combinatorial Theory"},{"issue":"2","key":"22_CR23","doi-asserted-by":"crossref","first-page":"194","DOI":"10.15807\/jorsj.44.194","volume":"44","author":"D. Nakamura","year":"2001","unstructured":"Nakamura, D., Tamura, A.: A revision of Minty\u2019s algorithm for finding a maximum weighted stable set of a claw-free graph. Journal of the Operations Research Society of Japan\u00a044(2), 194\u20132004 (2001)","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"22_CR24","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. John Wiley, Chichester (1988)"},{"issue":"3","key":"22_CR25","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0166-218X(03)00400-1","volume":"132","author":"G. Oriolo","year":"2003","unstructured":"Oriolo, G.: Clique family inequalities for the stable set polytope for quasi-line graphs. Discrete Applied Mathematics\u00a0132(3), 185\u2013201 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"22_CR26","unstructured":"Padberg, M.W., Rao, M.R.: The Russian method for linear programming III: Bounded integer programming. Technical Report 81-39, New York University, Graduate School of Business and Administration (1981)"},{"key":"22_CR27","unstructured":"Pulleyblank, W.R., Shepherd, F.B.: Formulations for the stable set polytope of a claw-free graph. In: Rinaldi, G., Wolsey, L. (eds.) Proceedings Third IPCO Conference, pp. 267\u2013279 (1993)"},{"key":"22_CR28","unstructured":"Rebea, A.B.: \u00c9tude des stables dans les graphes quasi-adjoints. PhD thesis, Universit\u00e9 de Grenoble (1981)"},{"key":"22_CR29","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0012-365X(90)90287-R","volume":"29","author":"N. Sbihi","year":"1980","unstructured":"Sbihi, N.: Algorithme de recherche d\u2019un stable de cardinalit\u00e9 maximum dans un graphe sans \u00e9toile. Discrete Mathematics\u00a029, 53\u201376 (1980)","journal-title":"Discrete Mathematics"},{"key":"22_CR30","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0167-5060(08)70085-2","volume":"9","author":"A. Schrijver","year":"1980","unstructured":"Schrijver, A.: On cutting planes. Annals of Discrete Mathematics\u00a09, 291\u2013296 (1980)","journal-title":"Annals of Discrete Mathematics"},{"key":"22_CR31","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley, Chichester (1986)"},{"key":"22_CR32","volume-title":"Algorithms and Combinatorics 24","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial optimization. Polyhedra and efficiency. In: Algorithms and Combinatorics 24, vol.\u00a03, Springer, Berlin (2003)"},{"key":"22_CR33","first-page":"353","volume":"71","author":"F.B. Shepherd","year":"1995","unstructured":"Shepherd, F.B.: Applying Lehman\u2019s theorems to packing problems. Mathematical Programming\u00a071, 353\u2013367 (1995)","journal-title":"Mathematical Programming"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496915_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T09:29:14Z","timestamp":1711618154000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496915_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540261995","9783540321026"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/11496915_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}