{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T01:13:36Z","timestamp":1780449216264,"version":"3.54.1"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,6,2]],"date-time":"2011-06-02T00:00:00Z","timestamp":1306972800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s10732-011-9174-2","type":"journal-article","created":{"date-parts":[[2011,6,1]],"date-time":"2011-06-01T14:48:58Z","timestamp":1306939738000},"page":"697-709","source":"Crossref","is-referenced-by-count":13,"title":["Variable objective search"],"prefix":"10.1007","volume":"19","author":[{"given":"Sergiy","family":"Butenko","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Oleksandra","family":"Yezerska","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Balabhaskar","family":"Balasundaram","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2011,6,2]]},"reference":[{"key":"9174_CR1","volume-title":"Local Search in Combinatorial Optimization","year":"2003","unstructured":"Aarts, E., Lenstra, J.K. (eds.): Local Search in Combinatorial Optimization. Wiley, Chichester (2003)"},{"key":"9174_CR2","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1023\/A:1011968411281","volume":"21","author":"J. Abello","year":"2001","unstructured":"Abello, J., Butenko, S., Pardalos, P., Resende, M.: Finding independent sets in a graph using continuous multivariable polynomial formulations. J. Glob. Optim. 21, 111\u2013137 (2001)","journal-title":"J. Glob. Optim."},{"key":"9174_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4757-3023-4_1","volume-title":"Handbook of Combinatorial Optimization","author":"I.M. Bomze","year":"1999","unstructured":"Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The maximum clique problem. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, pp. 1\u201374. Kluwer Academic, Dordrecht (1999)"},{"key":"9174_CR4","unstructured":"DIMACS Cliques, Coloring, and satisfiability: second DIMACS implementation challenge. http:\/\/dimacs.rutgers.edu\/Challenges\/ (1995). Accessed April 2010"},{"key":"9174_CR5","volume-title":"Handbook Of Metaheuristics","year":"2002","unstructured":"Glover, F., Kochenberger, G. (eds.): Handbook Of Metaheuristics. Springer, London (2002)"},{"key":"9174_CR6","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P. Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130, 449\u2013467 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"9174_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0015-5","volume-title":"Introduction to Global Optimization","author":"R. Horst","year":"2000","unstructured":"Horst, R., Pardalos, P.M., Thoai, N.V.: Introduction to Global Optimization, 2 edn. Kluwer Academic, Dordrecht (2000)","edition":"2"},{"key":"9174_CR8","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24, 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"9174_CR9","doi-asserted-by":"crossref","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","volume":"17","author":"T.S. Motzkin","year":"1965","unstructured":"Motzkin, T.S., Straus, E.G.: Maxima for graphs and a new proof of a theorem of Tur\u00e1n. Can. J. Math. 17, 533\u2013540 (1965)","journal-title":"Can. J. Math."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-011-9174-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-011-9174-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-011-9174-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:54:32Z","timestamp":1559256872000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-011-9174-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,2]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["9174"],"URL":"https:\/\/doi.org\/10.1007\/s10732-011-9174-2","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,2]]}}}