{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:59:38Z","timestamp":1725487178081},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441809"},{"type":"electronic","value":"9783540457497"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45749-6_47","type":"book-chapter","created":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T11:42:44Z","timestamp":1183549364000},"page":"525-537","source":"Crossref","is-referenced-by-count":1,"title":["A Primal Approach to the Stable Set Problem"],"prefix":"10.1007","author":[{"given":"Claudio","family":"Gentile","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haus","family":"Utz-Uwe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"K\u00f6ppe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanni","family":"Rinaldi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Weismantel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,29]]},"reference":[{"key":"47_CR1","doi-asserted-by":"crossref","unstructured":"Egon Balas, Sebasti\u00e1n Ceria, G\u00e9rard Cornu\u00e9jols, and Gabor Pataki, Polyhedral methods for the maximum clique problem, In Johnson and Trick [12], pp. 11\u201328.","DOI":"10.1090\/dimacs\/026\/02"},{"key":"47_CR2","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1287\/opre.23.1.74","volume":"23","author":"E. Balas","year":"1975","unstructured":"Egon Balas and Manfred W. Padberg, On the set-covering problem: II. An algorithm for set partitioning, Operations Research 23 (1975), 74\u201390.","journal-title":"Operations Research"},{"key":"47_CR3","unstructured":"Claude Berge, F\u00e4rbung von Graphen, deren s\u00e4mtliche bzw. deren ungerade Kreise starr sind, Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg, Math.-Natur. Reihe (1961), 114\u2013115."},{"key":"47_CR4","volume-title":"Handbook of Combinatorial Optimization","author":"I. M. Bomze","year":"1999","unstructured":"Immanuel M. Bomze, Marco Budinich, Panos M. Pardalos, and Marcello Pelillo, The maximum clique problem, Handbook of Combinatorial Optimization (Supplement Volume A) (D.-Z. Du and P.M. Pardalos, eds.), vol. 4, Kluwer Academic Publishers, Boston, MA, 1999."},{"key":"47_CR5","volume-title":"Aspects of set packing, partitioning, and covering","author":"R. Bornd\u00f6rfer","year":"1998","unstructured":"Ralf Bornd\u00f6rfer, Aspects of set packing, partitioning, and covering, Dissertation, Technische Universit\u00e4t Berlin, 1998, published by Shaker-Verlag, Aachen."},{"key":"47_CR6","unstructured":"Maria Chudnovski, Neil Robertson, Paul Seymour, and Robin Thomas, Talk given at the Oberwolfach meeting on Geometric Convex Combinatorics, June 2002."},{"key":"47_CR7","doi-asserted-by":"crossref","unstructured":"G\u00e9rard Cornu\u00e9jols, Combinatorial optimization: Packing and covering, CBMSNSF Regional Conference Series in Applied Mathematics, no. 74, SIAM, Philadelphia, 2001.","DOI":"10.1137\/1.9780898717105"},{"issue":"4","key":"47_CR8","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02579262","volume":"6","author":"A.M.H. Gerards","year":"1986","unstructured":"A.M.H. Gerards and A. Schrijver, Matrices with the Edmonds-Johnson Property, Combinatorica 6 (1986), no. 4, 365\u2013379.","journal-title":"Combinatorica"},{"key":"47_CR9","volume-title":"Algorithms and Combinatorics","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"Martin Gr\u00f6tschel, L\u00e1szl\u00f3 Lov\u00e1sz, and Alexander Schrijver, Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2, Springer, Berlin, 1988."},{"issue":"3","key":"47_CR10","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s001860100124","volume":"53","author":"H. Utz-Uwe","year":"2001","unstructured":"Utz-Uwe Haus, Matthias K\u00f6ppe, and Robert Weismantel, The Integral Basis Method for integer programming, Mathematical Methods of Operations Research 53 (2001), no. 3, 353\u2013361.","journal-title":"Mathematical Methods of Operations Research"},{"key":"47_CR11","unstructured":"\u2014, A primal all-integer algorithm based on irreducible solutions, To appear in Mathematical Programming Series B, preprint available from URL http:\/\/www.math.uni-magdeburg.de\/~mkoeppe\/art\/haus-koeppe-weismantel-ibm-theory-rr.ps , 2001."},{"key":"47_CR12","doi-asserted-by":"crossref","unstructured":"D. S. Johnson and M.A. Trick (eds.), Clique, coloring, and satisfiability: Second DIMACS implementation challenge, DIMACS, vol. 26, American Mathematical Society, 1996.","DOI":"10.1090\/dimacs\/026"},{"key":"47_CR13","doi-asserted-by":"crossref","unstructured":"L. Lov\u00e1sz, Normal hypergraphs and the weak perfect graph conjecture, Topics on perfect graphs, North-Holland, Amsterdam, 1984, pp. 29\u201342.","DOI":"10.1016\/S0304-0208(08)72920-7"},{"key":"47_CR14","doi-asserted-by":"crossref","unstructured":"G. L. Nemhauser and G. L. Sigismondi, A strong cutting plane \/ branch and bound algorithm for node packing, Journal of the Operational Research Society (1992), 443\u2013457.","DOI":"10.1057\/jors.1992.71"},{"key":"47_CR15","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/BF01580222","volume":"6","author":"G. L. Nemhauser","year":"1973","unstructured":"G. L. Nemhauser and L. E. Trotter, Properties of vertex packing and independent system polyhedra, Mathematical Programming 6 (1973), 48\u201361.","journal-title":"Mathematical Programming"},{"key":"47_CR16","doi-asserted-by":"publisher","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":"47_CR17","unstructured":"Manfred W. Padberg and Saman Hong, On the symmetric travelling salesman problem: a computational study, Math. Programming Stud. (1980), no. 12, 78\u2013107."},{"issue":"4","key":"47_CR18","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1287\/opre.16.4.750","volume":"16","author":"R. D. Young","year":"1968","unstructured":"Richard D. Young, A simplified primal (all-integer) integer programming algorithm, Operations Research 16 (1968), no. 4, 750\u2013782.","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45749-6_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T23:06:27Z","timestamp":1556579187000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45749-6_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441809","9783540457497"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45749-6_47","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}