{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:34:40Z","timestamp":1774370080019,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1998,7,1]],"date-time":"1998-07-01T00:00:00Z","timestamp":899251200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,7,1]],"date-time":"1998-07-01T00:00:00Z","timestamp":899251200000},"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":["Journal of Heuristics"],"published-print":{"date-parts":[[1998,7]]},"DOI":"10.1023\/a:1009646528813","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T22:47:08Z","timestamp":1040597228000},"page":"107-122","source":"Crossref","is-referenced-by-count":48,"title":["Optimized Crossover-Based Genetic Algorithms for the Maximum Cardinality and Maximum Weight Clique Problems"],"prefix":"10.1007","volume":"4","author":[{"given":"Egon","family":"Balas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William","family":"Niehaus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"167219_CR1","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1287\/opre.45.2.226","volume":"45","author":"C.C. Aggarwal","year":"1997","unstructured":"Aggarwal, C.C., J.B. Orlin, and R.P. Tai. (1997). \u201cAn Optimized Crossover for Maximum Independent Set,\u201d Operations Research 45, 226-234.","journal-title":"Operations Research"},{"key":"167219_CR2","doi-asserted-by":"crossref","unstructured":"Balas, E. and W. Niehaus. (1996). \u201cFinding Large Cliques in Arbitrary Graphs by Bipartite Matching,\u201d In D.S. Johnson and M.A. Trick (eds.), Clique, Coloring and Satisfiability: Second DIMACS Implementation Challenge. AMS, pp. 29-53.","DOI":"10.1090\/dimacs\/026\/03"},{"key":"167219_CR3","unstructured":"Balas, E. and W. Niehaus. (1995). \u201cA Max-Flow Based Procedure for Finding Heavy Cliques in Vertex-Weighted Graphs,\u201d MSRR No. 612, GSIA, Carnegie-Mellon University."},{"key":"167219_CR4","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/BF01955041","volume":"15","author":"E. Balas","year":"1996","unstructured":"Balas, E. and J. Xue. (1996). \u201cWeighted and Unweighted Maximum Clique Algorithms with Upper Bounds from Fractional Coloring,\u201d Algorithms 15, 397-412.","journal-title":"Algorithms"},{"key":"167219_CR5","first-page":"95","volume-title":"Reactive Local Search for the Maximum Clique Problem","author":"R. Battiti","year":"1995","unstructured":"Battiti, R. and M. Protasi. (1995). \u201cReactive Local Search for the Maximum Clique Problem,\u201d International Computer Science Institute, Berkeley, CA, TR-95-052."},{"key":"167219_CR6","unstructured":"Beasley, J. and P. Chu. (1995). \u201cA Genetic Algorithm for the Set Partitioning Problem,\u201d The Management School, Imperial College, Technical Report."},{"key":"167219_CR7","doi-asserted-by":"crossref","unstructured":"Brockington, M. and J.C. Culberson. (1996). \u201cCamouflaging Independent Sets in Quasi-Random Graphs,\u201d In D.S. Johnson and M.A. Trick (eds.), Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge. AMS, pp. 75-89.","DOI":"10.1090\/dimacs\/026\/05"},{"key":"167219_CR8","volume-title":"Handbook of Genetic Algorithms","author":"L. Davis","year":"1991","unstructured":"Davis, L. (1991). Handbook of Genetic Algorithms. New York: Van Nostrand Reinhold."},{"key":"167219_CR9","volume-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"D. Goldberg","year":"1989","unstructured":"Goldberg, D. (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Reading MA: Addison Wesley."},{"key":"167219_CR10","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/BF01096415","volume":"3","author":"J. Hasselberg","year":"1993","unstructured":"Hasselberg, J., P.M. Pardalos, and G. Vairaktarakis. (1993). \u201cTest Case Generators and Computational Results for the Maximum Clique Problem,\u201d Journal of Global Optimization 3, 463-482.","journal-title":"Journal of Global Optimization"},{"key":"167219_CR11","doi-asserted-by":"crossref","unstructured":"Johnson, D.S. and M.A. Trick (eds.). (1996). Clique, Coloring, and Satisfiability: Second DIMACS Implementation Challenge. AMS.","DOI":"10.1090\/dimacs\/026"},{"key":"167219_CR12","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1090\/S0273-0979-1992-00318-X","volume":"27","author":"J.C. Laarias","year":"1992","unstructured":"Laarias, J.C. and P.W. Shor. (1992). \u201cKeller's Cube-Tiling Conjecture is False in High Dimensions,\u201d Bulletin of the AMS 27, 279-283.","journal-title":"Bulletin of the AMS"},{"key":"167219_CR13","doi-asserted-by":"crossref","unstructured":"Mannino, C. and A. Sassano. (1996). \u201cEdge Projection and the Maximum Cardinality Stable Set Problem,\u201d In D.S. John and M.A. Trick (eds.), Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge. AMS, 205-221.","DOI":"10.1090\/dimacs\/026\/11"},{"key":"167219_CR14","volume-title":"Modern Heuristic Techniques for Combinatorial Problems","author":"C. Reeves","year":"1993","unstructured":"Reeves, C. (1993). Modern Heuristic Techniques for Combinatorial Problems. New York: John Wiley and Sons, Inc."},{"key":"167219_CR15","unstructured":"Sanchis, L. (1993). \u201cTest Case Construction for Vertex Cover Problem,\u201d Paper presented at the Second DIMACS Challenge, Rutgers University."},{"key":"167219_CR16","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF02023002","volume":"41","author":"P. Soriano","year":"1993","unstructured":"Soriano, P. and M. Gendreau. (1993). \u201cSolving the Maximum Clique Problem Using a Tabu Search Approach,\u201d Annals of Operations Research 41, 385-403.","journal-title":"Annals of Operations Research"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009646528813.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009646528813\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009646528813.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T11:11:55Z","timestamp":1747653115000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009646528813"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,7]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,7]]}},"alternative-id":["167219"],"URL":"https:\/\/doi.org\/10.1023\/a:1009646528813","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,7]]}}}