{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T21:00:01Z","timestamp":1769202001584,"version":"3.49.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1994,7,1]],"date-time":"1994-07-01T00:00:00Z","timestamp":773020800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Applic"],"published-print":{"date-parts":[[1994,7]]},"DOI":"10.1007\/bf01299447","type":"journal-article","created":{"date-parts":[[2005,3,25]],"date-time":"2005-03-25T09:57:02Z","timestamp":1111744622000},"page":"243-258","source":"Crossref","is-referenced-by-count":30,"title":["An exact algorithm for the maximum stable set problem"],"prefix":"10.1007","volume":"3","author":[{"given":"Carlo","family":"Mannino","sequence":"first","affiliation":[]},{"given":"Antonio","family":"Sassano","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/BF01588309","volume":"8","author":"D. Avis","year":"1980","unstructured":"Avis, D., A note on some computationally difficult set covering problems.Mathematical Programming, 8:138?145, 1980.","journal-title":"Mathematical Programming"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02257777","volume":"46\/4","author":"L. Babel","year":"1991","unstructured":"Babel, L., Finding maximum cliques in arbitrary and special graphs.Computing, 46\/4:321?341, 1991.","journal-title":"Computing"},{"key":"CR3","unstructured":"Babel, L. and Tinhofer, G., A branch and bound algorithm for the maximum clique problem.J. of Global Optimization, 4, 1994."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1137\/0215075","volume":"15","author":"E. Balas","year":"1986","unstructured":"Balas, E. and Yu., C.S., Finding a maximum clique in an arbitrary graph.SIAM Journal on Computing, 15:1054?1068, 1986.","journal-title":"SIAM Journal on Computing"},{"key":"CR5","unstructured":"Bela Bollobas,Random Graphs. Academic Press, 1985."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D. Brelaz","year":"1979","unstructured":"Brelaz, D., New methods to color the vertices of a graph.Comm. of the ACM, 22:251?256, 1979.","journal-title":"Comm. of the ACM"},{"key":"CR7","unstructured":"Brglez, F. and Fujiwara, H., A neutral netlist of 10 combinatorial bench-mark circuits and a target translator in fortran.Iscas'85: IEEE Int. Symp.on Circuits and Systems (Kyoto-Japan),June 1985."},{"key":"CR8","series-title":"Technical report","volume-title":"Test generation in a distributed environment","author":"E. Calia","year":"1991","unstructured":"Calia, E. and Lioy, A., Test generation in a distributed environment. Technical report, Politecnico di Torino, C.so Duca degli Abbruzzi 24, 10129 Torino-Italy, August 1991."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0167-6377(90)90057-C","volume":"9","author":"R. Carraghan","year":"1990","unstructured":"Carraghan, R. and Pardalos, P.M., An exact algorithm for the maximum clique problem.Operational Research Letters 9:375?382, 1990.","journal-title":"Operational Research Letters"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"T.A. Feo","year":"1989","unstructured":"Feo, T.A. and Resende, G.C., A probabilistic heuristic for a computationally difficult set covering problem.Operational Research Letters, 8:67?71, 1989.","journal-title":"Operational Research Letters"},{"issue":"5","key":"CR11","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0305-0548(90)90048-C","volume":"17","author":"C. Friden","year":"1990","unstructured":"Friden, C., Hertz, A. and de Werra, D., An exact algorithm based on tabu search for finding a maximum independent set in graph.Computers Opns. Res. 17(5):375?382, 1990.","journal-title":"Computers Opns. Res."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/BFb0120689","volume":"2","author":"D.R. Fulkerson","year":"1974","unstructured":"Fulkerson, D.R., Nemhauser, G.L., and Trotter, L.E., Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of steiner triple systems.Mathematical Programming Study, 2:72?81, 1974.","journal-title":"Mathematical Programming Study"},{"key":"CR13","volume-title":"Computer and Intractability: a Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R. and Johnson, D.S.,Computer and Intractability: a Guide to the Theory of NP-Completeness. Freeman, New York, 1979."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1002\/net.3230030305","volume":"3","author":"F. Gavril","year":"1973","unstructured":"Gavril, F., Algorithms for a maximum clique and a maximum independent set of a circle graph.Networks, 3:261?273, 1973.","journal-title":"Networks"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1002\/net.3230040407","volume":"4","author":"F. Gavril","year":"1974","unstructured":"Gavril, F., Algorithms on circular arc graphs.Networks, 4:357?369, 1974.","journal-title":"Networks"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1016\/0095-8956(86)90087-0","volume":"40","author":"M. Gr\u00f6tschel","year":"1986","unstructured":"Gr\u00f6tschel, M., Lovasz, L., and Schrijver, A., Relaxation of vertex packing.J. of Comb. Theory B 40:330?343, 1986.","journal-title":"J. of Comb. Theory B"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1002\/net.3230120410","volume":"12","author":"U. Gupta","year":"1982","unstructured":"Gupta, U., Lee, D., and Leung, J., Efficient algorithms for interval graphs and circular arc graphs.Networks, 12:459?467, 1982.","journal-title":"Networks"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/BF01096415","volume":"3","author":"J. Hasselberg","year":"1993","unstructured":"Hasselberg, J., Pardalos, P., and Vairaktarakis, G., Test case generators and computational results for the maximum clique problem,J. of Global Optimization, 3:463?482, 1993.","journal-title":"J. of Global Optimization"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF01589347","volume":"20","author":"W.L. Hsu","year":"1981","unstructured":"Hsu, W.L., Ikura, Y., and Nemhauser, G.L., A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles.Mathematical Programming, 20:225?232, 1981.","journal-title":"Mathematical Programming"},{"issue":"3","key":"CR20","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/BF01582907","volume":"52","author":"N. Karmarkar","year":"1991","unstructured":"Karmarkar, N., Resende, M., and Ramakrishnan, K., An interior point algorithm to solve computationally difficult set covering problems.Math. Prog. Series B, 52(3):597?618, 1991.","journal-title":"Math. Prog. Series B"},{"key":"CR21","unstructured":"Mannino, C. and Sassano, A., An exact algorithm for the maximum stable set problem. Technical Report R.334, IASI-CNR, April 1992."},{"key":"CR22","doi-asserted-by":"crossref","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.J. of Comb. Theory B, 28:284?304, 1980.","journal-title":"J. of Comb. Theory B"},{"issue":"5","key":"CR23","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1057\/jors.1992.71","volume":"43","author":"G.L. Nemhauser","year":"1992","unstructured":"Nemhauser, G.L. and Sigismondi, G., A strong cutting plane\/branch-and-bound algorithm for node packing.J. Ops. Res. Soc., 43(5):443?457, 1992.","journal-title":"J. Ops. Res. Soc."},{"key":"CR24","doi-asserted-by":"crossref","unstructured":"Nemhauser, G.L. and Wolsey, L.A.,Integer and Combinatorial Optimization. John Wiley and Sons, Inc., 1988.","DOI":"10.1002\/9781118627372"},{"key":"CR25","unstructured":"Pardalos, P. and Xue, J., The maximum clique problem. Manuscript, August 1992."},{"key":"CR26","unstructured":"Jue Xue,Fast Algorithms for the Vertex Packing Problem. PhD thesis, Graduate School of Industrial Administration, Carnagie Mellom University, April 1991."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01299447.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01299447\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01299447","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T18:08:07Z","timestamp":1556647687000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01299447"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,7]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,7]]}},"alternative-id":["BF01299447"],"URL":"https:\/\/doi.org\/10.1007\/bf01299447","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,7]]}}}