{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:40:08Z","timestamp":1752378008087,"version":"3.41.2"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1999,11,1]],"date-time":"1999-11-01T00:00:00Z","timestamp":941414400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,11,1]],"date-time":"1999-11-01T00:00:00Z","timestamp":941414400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[1999,11]]},"DOI":"10.1023\/a:1026456624746","type":"journal-article","created":{"date-parts":[[2003,11,6]],"date-time":"2003-11-06T11:45:40Z","timestamp":1068119140000},"page":"367-381","source":"Crossref","is-referenced-by-count":17,"title":["An Augmentation Algorithm for the Maximum Weighted Stable Set Problem"],"prefix":"10.1007","volume":"14","author":[{"given":"Carlo","family":"Mannino","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Egidio","family":"Stefanutti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"235046_CR1","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02257777","volume":"46","author":"L. Babel","year":"1991","unstructured":"L. Babel, \u201cFinding maximum cliques in arbitrary and special graphs,\u201d Computing, vol. 46,no. 4, pp. 321-341, 1991.","journal-title":"Computing"},{"key":"235046_CR2","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF02243394","volume":"52","author":"L. Babel","year":"1994","unstructured":"L. Babel, \u201cA fast algorithm for the maximum weight clique problem,\u201d Computing, vol. 52, pp. 31-38, 1994.","journal-title":"Computing"},{"key":"235046_CR3","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF01415983","volume":"34","author":"L. Babel","year":"1990","unstructured":"L. Babel and G. Tinhofer, \u201cA branch and bound algorithm for the maximum clique problem,\u201d ZOR-Methods and Models of Operations Research, vol. 34, pp. 207-217, 1990.","journal-title":"ZOR-Methods and Models of Operations Research"},{"key":"235046_CR4","doi-asserted-by":"crossref","unstructured":"E. Balas and W. Niehaus, \u201cFinding large clique in arbitrary graphs by bipartite matching,\u201d in Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, D.S. Johnson and M.A. Trick (Eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26, pp. 29-51, American Mathematical Society, 1996.","DOI":"10.1090\/dimacs\/026\/03"},{"key":"235046_CR5","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1137\/0220012","volume":"20","author":"E. Balas","year":"1991","unstructured":"E. Balas and J. Xue, \u201cMinimum weighted coloring of triangulated graphs, with application to maximum weight vertex packing and clique finding in arbitrary graphs,\u201d SIAM Journal on Computing, vol. 20, pp. 209-221, 1991.","journal-title":"SIAM Journal on Computing"},{"key":"235046_CR6","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/BF01955041","volume":"15","author":"E. Balas","year":"1996","unstructured":"E. Balas and J. Xue, \u201cWeighted and unweighted maximum clique algorithms with upper bounds from fractional coloring.\u201d Algorithmica, vol. 15, pp. 397-412, 1996.","journal-title":"Algorithmica"},{"key":"235046_CR7","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1137\/0215075","volume":"15","author":"E. Balas","year":"1986","unstructured":"E. Balas and C.S. Yu, \u201cFinding a maximum clique in an arbitrary graph,\u201d SIAM Journal on Computing, vol. 15, pp. 1054-1068, 1986.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"235046_CR8","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1287\/ijoc.6.2.126","volume":"6","author":"R. Battiti","year":"1994","unstructured":"R. Battiti and G. Tecchiolli, \u201cThe reactive tabu search,\u201d ORSA Journal on Computing, vol. 6,no. 2, pp. 126-140, 1994.","journal-title":"ORSA Journal on Computing"},{"key":"235046_CR9","unstructured":"J. Bourjolly, G. Laporte, and H. Mercure, \u201cA combinatorial column generation algorithm for the maximum clique and stable set problem,\u201d Technical Report G-94-33, Les Cahiers du GERD, July 1994."},{"key":"235046_CR10","unstructured":"M. Brockington and J.C. Culberson, \u201cCamuflating independent sets in quasi-random graphs,\u201d in Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, D.S. Johnson and M.A. Trick (Eds.), Discrete Mathematics and Theoretical Computer Science, vol. 26, pp. 221-242, American Mathematical Society, 1996."},{"key":"235046_CR11","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0167-6377(90)90057-C","volume":"9","author":"R. Carraghan","year":"1990","unstructured":"R. Carraghan and P.M. Pardalos, \u201cAn exact algorithm for the maximum clique problem,\u201d Operations Research Letters, vol. 9, pp. 375-382, 1990.","journal-title":"Operations Research Letters"},{"key":"235046_CR12","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF02243141","volume":"42","author":"C. Friden","year":"1989","unstructured":"C. Friden, A. Hertz, and D. de Werra, \u201cStabulus: a technique for finding stable sets in large graphs with tabu search,\u201d Computing, vol. 42, pp. 35-45, 1989.","journal-title":"Computing"},{"issue":"5","key":"235046_CR13","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0305-0548(90)90048-C","volume":"17","author":"C. Friden","year":"1990","unstructured":"C. Friden, A. Hertz, and D. de Werra, \u201cAn exact algoritithm based on tabu search for finding a maximum independent set in graph,\u201d Computers Opns. Res., vol. 17,no. 5, pp. 375-382, 1990.","journal-title":"Computers Opns. Res."},{"key":"235046_CR14","volume-title":"Computer and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, Computer and Intractability: A Guide to the Theory of NP-Completeness, Freeman: New York, 1979."},{"key":"235046_CR15","doi-asserted-by":"crossref","unstructured":"M. Gendrau and P. Soriano, \u201cTabu search algorithms for the maximum clique problem,\u201d in Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, D.S. Johnson and M.A. Trick (Eds.), Discrete Mathematics and Theoretical Computer Science, vol. 26, pp. 221-242, American Mathematical Society, 1996.","DOI":"10.1090\/dimacs\/026\/12"},{"key":"235046_CR16","doi-asserted-by":"crossref","unstructured":"L.E. Gibbons, D.W. Hearn, and P.M. Pardalos, \u201cA continuous based heuristic for the maximum clique problem,\u201d in Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, D.S. Johnson and M.A. Trick (Eds.), Discrete Mathematics and Theoretical Computer Science, vol. 26, pp. 103-124, American Mathematical Society, 1996.","DOI":"10.1090\/dimacs\/026\/07"},{"key":"235046_CR17","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F. Glover","year":"1986","unstructured":"F. Glover, \u201cFuture paths for integer programming and links to artificial intelligence,\u201d Computers Opns. Res., vol. 13, pp. 533-549, 1986.","journal-title":"Computers Opns. Res."},{"key":"235046_CR18","doi-asserted-by":"crossref","unstructured":"M.K. Goldberg and R.D. Rivenburgh, \u201cConstructing cliques using restricted backtracking,\u201d in Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, D.S. Johnson and M.A. Trick (Eds.), Discrete Mathematics and Theoretical Computer Science, vol. 26, pp. 285-307, American Mathematical Society, 1996.","DOI":"10.1090\/dimacs\/026\/06"},{"key":"235046_CR19","doi-asserted-by":"crossref","unstructured":"T. Grossman, \u201cApplying the inn model to the max clique problem,\u201d in Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, D.S. Johnson and M.A. Trick (Eds.), Discrete Mathematics and Theoretical Computer Science, vol. 26, pp. 125-145, American Mathematical Society, 1996.","DOI":"10.1090\/dimacs\/026\/08"},{"key":"235046_CR20","doi-asserted-by":"crossref","unstructured":"S. Homer and M. Peinado, \u201cExperiments with polynomial-time clique approximation algorithms on very large graphs,\u201d in Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, D.S. Johnson and M.A. Trick (Eds.), Discrete Mathematics and Theoretical Computer Science, vol. 26, pp. 147-167, American Mathematical Society, 1996.","DOI":"10.1090\/dimacs\/026\/09"},{"key":"235046_CR21","doi-asserted-by":"crossref","unstructured":"A. Jagota, L. Sanchis, and R. Ganesan, \u201cApproximately solving maximum clique using neural network and related heuristic,\u201d in Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, D.S. Johnson and M.A. Trick (Eds.), Discrete Mathematics and Theoretical Computer Science, vol. 26, pp. 169-204, American Mathematical Society, 1996.","DOI":"10.1090\/dimacs\/026\/10"},{"key":"235046_CR22","volume-title":"Matching Theory","author":"L. Lov\u00e1sz","year":"1986","unstructured":"L. Lov\u00e1sz and M.D. Plummer, Matching Theory, North-Holland: Amsterdam, 1986."},{"key":"235046_CR23","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF01299447","volume":"3","author":"C. Mannino","year":"1994","unstructured":"C. Mannino and A. Sassano, \u201cAn exact algorithm for the maximum stable set problem,\u201d J. Computational Optimization and Applications, vol. 3, pp. 243-258, 1994.","journal-title":"J. Computational Optimization and Applications"},{"key":"235046_CR24","doi-asserted-by":"crossref","unstructured":"C. Mannino and A. Sassano, \u201cEdge projection and the maximum stable set problem,\u201d in Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, D.S. Johnson and M.A. Trick (Eds.), Discrete Mathematics and Theoretical Computer Science, vol. 26, pp. 205-219, American Mathematical Society, 1996.","DOI":"10.1090\/dimacs\/026\/11"},{"issue":"5","key":"235046_CR25","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1057\/jors.1992.71","volume":"43","author":"G.L. Nemhauser","year":"1992","unstructured":"G.L. Nemhauser and G. Sigismondi, \u201cA strong cutting plane\/branch-and-bound algorithm for node packing,\u201d J. Ops. Res. Soc., vol. 43,no. 5, pp. 443-457, 1992.","journal-title":"J. Ops. Res. Soc."},{"key":"235046_CR26","volume-title":"Algoritmi di ricerca tab\u00f9 per il problema del maxclique","author":"L. Orlandani","year":"1994","unstructured":"L. Orlandani, \u201cAlgoritmi di ricerca tab\u00f9 per il problema del maxclique,\u201d Master's Thesis, Dipartimento di Matematica, Facolt\u00e0 di Scienze Matematiche, Fisiche e Naturali, Via della Ricerca Scientifica, 00133 Rome, Italy, 1994."},{"issue":"3","key":"235046_CR27","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1007\/BF01098364","volume":"4","author":"P. Pardalos","year":"1994","unstructured":"P. Pardalos and J. Xue, \u201cThe maximum clique problem,\u201d J. of Global Optimization, vol. 4,no. 3, pp. 286-301, 1994.","journal-title":"J. of Global Optimization"},{"key":"235046_CR28","unstructured":"E.C. Sewell, \u201cA branch and bound algorithm for the stability number of a sparse graph,\u201d INFORMS J. on Comp., May 1995, to appear."},{"key":"235046_CR29","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0166-218X(93)90032-J","volume":"41","author":"C. De Simone","year":"1993","unstructured":"C. De Simone and A. Sassano, \u201cStability number of bull and chair-free graphs,\u201d Discrete Applied Mathematics, vol. 41, pp. 121-129, 1993.","journal-title":"Discrete Applied Mathematics"},{"key":"235046_CR30","unstructured":"Jue Xue, \u201cFast algorithms for the vertex packing problem,\u201d Ph.D. Thesis, Graduate School of Industrial Administration, Carnegie Mellon University, April 1991."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1026456624746.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1026456624746\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1026456624746.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:23:09Z","timestamp":1752376989000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1026456624746"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,11]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,11]]}},"alternative-id":["235046"],"URL":"https:\/\/doi.org\/10.1023\/a:1026456624746","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[1999,11]]}}}