{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:40:38Z","timestamp":1725586838141},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642208065"},{"type":"electronic","value":"9783642208072"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20807-2_18","type":"book-chapter","created":{"date-parts":[[2011,6,18]],"date-time":"2011-06-18T13:58:49Z","timestamp":1308405529000},"page":"223-234","source":"Crossref","is-referenced-by-count":5,"title":["A New Approach to the Stable Set Problem Based on Ellipsoids"],"prefix":"10.1007","author":[{"given":"Monia","family":"Giandomenico","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam N.","family":"Letchford","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabrizio","family":"Rossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Smriglio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","unstructured":"Alpen-Adria-Universit\u00e4t Klagenfurt website, http:\/\/www.math.uni-klu.ac.at\/or\/Software"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s10107-008-0243-8","volume":"122","author":"K. Andersen","year":"2009","unstructured":"Andersen, K., Pochet, Y.: Coefficient strengthening: a tool for reformulating mixed-integer programs. Math. Program.\u00a0122, 121\u2013154 (2009)","journal-title":"Math. Program."},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G., Pataki, G.: Polyhedral methods for the maximum clique problem. In: Johnson, D.S., Trick, M.A. (eds.) Cliques, Coloring and Satisfiability, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a026, pp. 11\u201328 (1996)","DOI":"10.1090\/dimacs\/026\/02"},{"key":"18_CR4","unstructured":"R.: Bornd\u00f6rfer, Aspects of Set Packing, Partitioning and Covering. Doctoral Thesis, Technical University of Berlin (1998)"},{"key":"18_CR5","unstructured":"DIMACS Repository, ftp:\/\/dimacs.rutgers.edu\/pub\/challenge\/graph\/benchmarks\/clique"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s10107-006-0026-z","volume":"109","author":"I. Dukanovic","year":"2007","unstructured":"Dukanovic, I., Rendl, F.: Semidefinite programming relaxations for graph coloring and maximal clique problems. Math. Program\u00a0109, 345\u2013365 (2007)","journal-title":"Math. Program"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","first-page":"47","volume-title":"Algorithms - ESA 2002","author":"T. Fahle","year":"2002","unstructured":"Fahle, T.: Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 47\u201386. Springer, Heidelberg (2002)"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1023\/A:1008282830093","volume":"10","author":"T. Fujie","year":"1997","unstructured":"Fujie, T., Kojima, M.: Semidefinite programming relaxation for nonconvex quadratic programs. J. Glob. Opt.\u00a010, 367\u2013380 (1997)","journal-title":"J. Glob. Opt."},{"key":"18_CR9","first-page":"285","volume":"45","author":"T. Fujie","year":"2002","unstructured":"Fujie, T., Tamura, A.: On Gr\u00f6tschel-Lov\u00e1sz-Schrijver\u2019s relaxation of stable set polytopes. J. Oper. Res. Soc. Japan\u00a045, 285\u2013292 (2002)","journal-title":"J. Oper. Res. Soc. Japan"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s10107-005-0604-5","volume":"106","author":"M. Giandomenico","year":"2006","unstructured":"Giandomenico, M., Letchford, A.N.: Exploring the relationship between max-cut and stable set relaxations. Math. Program\u00a0106, 159\u2013175 (2006)","journal-title":"Math. Program"},{"key":"18_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms in Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.J.: Geometric Algorithms in Combinatorial Optimization. Wiley, New York (1988)"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"1014","DOI":"10.1137\/S1052623401394092","volume":"13","author":"G. Gruber","year":"2003","unstructured":"Gruber, G., Rendl, F.: Computational experience with stable set relaxations. SIAM J. Opt.\u00a013, 1014\u20131028 (2003)","journal-title":"SIAM J. Opt."},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Johnson, D.S., Trick, M.A. (eds.): Cliques, Coloring and Satisfiability: the 2nd DIMACS Implementation Challenge. American Mathematical Society, Providence","DOI":"10.1090\/dimacs\/026"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J.: Clique is hard to approximate within n 1\u2009\u2212\u2009\u03b5 . Acta Math.\u00a0182, 105\u2013142 (1999)","journal-title":"Acta Math."},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum, New York (1972)"},{"key":"18_CR16","volume-title":"Advances in Convex Analysis and Global Optimization","author":"C. Lemar\u00e9chal","year":"2001","unstructured":"Lemar\u00e9chal, C., Oustry, F.: SDP relaxations in combinatorial optimization from a Lagrangian viewpoint. In: Hadjisawas, N., Pardalos, P.M. (eds.) Advances in Convex Analysis and Global Optimization. Kluwer, Dortrecht (2001)"},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"IT-25","author":"L. Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz, L.: On the Shannon capacity of a graph. IEEE Trans. Inform. Th.\u00a0IT-25, 1\u20137 (1979)","journal-title":"IEEE Trans. Inform. Th."},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L. Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz, L., Schrijver, A.J.: Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optimization\u00a01, 166\u2013190 (1991)","journal-title":"SIAM J. Optimization"},{"key":"18_CR19","unstructured":"Malick, J., Povh, J., Rendl, F., Wiegele, A. (2007) Boundary Point Method for solving SDPs: mprw.m, Inst. f. Mathematik, Alpen-Adria-Universit\u00e4t Klagenfurt (2007)"},{"key":"18_CR20","doi-asserted-by":"publisher","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. Wiley, New York (1988)"},{"key":"18_CR21","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"M.W. Padberg","year":"1973","unstructured":"Padberg, M.W.: On the facial structure of set packing polyhedra. Math. Program.\u00a05, 199\u2013215 (1973)","journal-title":"Math. Program."},{"key":"18_CR22","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/BF01100205","volume":"7","author":"S. Poljak","year":"1995","unstructured":"Poljak, S., Rendl, F., Wolkowicz, H.: A recipe for semidefinite relaxation for (0,1)-quadratic programming. J. Global Opt.\u00a07, 51\u201373 (1995)","journal-title":"J. Global Opt."},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"Rebennack, S., Oswald, M., Theis, D.O., Seitz, H., Reinelt, G., Pardalos, P.M.: A branch and cut solver for the maximum stable set problem. J. Comb. Opt. (2010) (to appear)","DOI":"10.1007\/s10878-009-9264-3"},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"R\u00e9gin, J.-C.: Solving the maximum clique problem with constraint programming. In: Proceedings of CPAIOR 2003. LNCS, vol.\u00a02883, pp. 634\u2013648. Springer, Heidelberg (2003)","DOI":"10.1007\/978-3-540-45193-8_43"},{"key":"18_CR25","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0167-6377(00)00060-2","volume":"28","author":"F. Rossi","year":"2001","unstructured":"Rossi, F., Smriglio, S.: A branch-and-cut algorithm for the maximum cardinality stable set problem. Oper. Res. Lett.\u00a028, 63\u201374 (2001)","journal-title":"Oper. Res. Lett."},{"key":"18_CR26","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1109\/TIT.1979.1056072","volume":"IT-25","author":"A.J. Schrijver","year":"1979","unstructured":"Schrijver, A.J.: A comparison of the Delsarte and Lov\u00e1sz bounds. IEEE Trans. Inf. Th.\u00a0IT-25, 425\u2013429 (1979)","journal-title":"IEEE Trans. Inf. Th."},{"key":"18_CR27","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0167-6377(01)00093-1","volume":"29","author":"L. Tun\u00e7el","year":"2001","unstructured":"Tun\u00e7el, L.: On the Slater condition for SDP relaxations of nonconvex sets. Oper. Res. Lett.\u00a029, 181\u2013186 (2001)","journal-title":"Oper. Res. Lett."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatoral Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20807-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T00:16:08Z","timestamp":1560298568000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20807-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208065","9783642208072"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20807-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}