{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T20:59:22Z","timestamp":1771966762765,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014,4]]},"DOI":"10.1007\/s10732-013-9235-9","type":"journal-article","created":{"date-parts":[[2013,12,31]],"date-time":"2013-12-31T04:46:55Z","timestamp":1388465215000},"page":"143-164","source":"Crossref","is-referenced-by-count":22,"title":["An iterated-tabu-search heuristic for a variant of the partial set covering problem"],"prefix":"10.1007","volume":"20","author":[{"given":"Nehme","family":"Bilal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Galinier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francois","family":"Guibault","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,1,1]]},"reference":[{"issue":"3","key":"9235_CR1","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/s00224-008-9112-3","volume":"45","author":"S Athanassopoulos","year":"2009","unstructured":"Athanassopoulos, S., Caragiannis, I., Kaklamanis, C.: Analysis of approximation algorithms for k-set cover using factor-revealing linear programs. Theory Comput. Syst. 45(3), 555\u2013576 (2009)","journal-title":"Theory Comput. Syst."},{"issue":"1\u20132","key":"9235_CR2","first-page":"1","volume":"5","author":"GA Azim","year":"2010","unstructured":"Azim, G.A., Ben Othman, M.: Hybrid iterated local search algorithm for solving multiple sequences alignment problem. Far East J. Exp. Theor. Intell. 5(1\u20132), 1\u201317 (2010)","journal-title":"Far East J. Exp. Theor. Intell."},{"key":"9235_CR3","first-page":"323","volume-title":"Proceedings of the Chinese-US Symposium on Systems Analysis","author":"E Balas","year":"1983","unstructured":"Balas, E.: A class of location, distribution and scheduling problems: modeling and solution methods. Proceedings of the Chinese-US Symposium on Systems Analysis, pp. 323\u2013346. Wiley, New York (1983)"},{"issue":"2","key":"9235_CR4","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1287\/mnsc.44.2.262","volume":"44","author":"E Balas","year":"1998","unstructured":"Balas, E., Vazacopoulos, A.: Guided local search with shifting bottleneck for job shop scheduling. Manag. Sci. 44(2), 262\u2013275 (1998)","journal-title":"Manag. Sci."},{"issue":"2","key":"9235_CR5","first-page":"1","volume":"2","author":"R Battiti","year":"1997","unstructured":"Battiti, R., Protasi, M.: Reactive search, a history-sensitive heuristic for max-sat. J. Exp. Algorithmics (JEA) 2(2), 1\u201331 (1997)","journal-title":"J. Exp. Algorithmics (JEA)"},{"issue":"2","key":"9235_CR6","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1016\/0377-2217(95)00159-X","volume":"94","author":"J Beasley","year":"1996","unstructured":"Beasley, J., Chu, P.: A genetic algorithm for the set covering problem. Eur. J. Oper. Res. 94(2), 392\u2013404 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"9235_CR7","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1287\/opre.47.5.730","volume":"47","author":"A Caprara","year":"1999","unstructured":"Caprara, A., Fischetti, M., Toth, P.: A heuristic method for the set covering problem. Oper. Res. 47(5), 730\u2013743 (1999)","journal-title":"Oper. Res."},{"key":"9235_CR8","doi-asserted-by":"crossref","unstructured":"Chen, P., Qu, Y., Huang, H., Dong, X.: A new hybrid iterated local search for the open vehicle routing problem. In: Computational Intelligence and Industrial Application, 2008. PACIIA\u201908. Pacific-Asia Workshop on, IEEE vol. 1, pp. 891\u2013895 (2008)","DOI":"10.1109\/PACIIA.2008.40"},{"issue":"1","key":"9235_CR9","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1287\/ijoc.14.1.52.7712","volume":"14","author":"R Congram","year":"2002","unstructured":"Congram, R., Potts, C., Van De Velde, S.: An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. Inf. J. Comput. 14(1), 52\u201367 (2002)","journal-title":"Inf. J. Comput."},{"key":"9235_CR10","doi-asserted-by":"crossref","unstructured":"Farahani, R.Z., Hekmatfar, M.: Facility location. Springer, Dordrecht, Heidelberg, London, New York, Chap 7: 3 (2009)","DOI":"10.1007\/978-3-7908-2151-2"},{"key":"9235_CR11","volume-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman, Oxford (1979)"},{"issue":"1","key":"9235_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02078647","volume":"41","author":"F Glover","year":"1993","unstructured":"Glover, F., Taillard, E.: A user\u2019s guide to tabu search. Annals Oper. Res. 41(1), 1\u201328 (1993)","journal-title":"Annals Oper. Res."},{"issue":"3","key":"9235_CR13","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover, F., et al.: Tabu search-part I. ORSA J. Comput. 1(3), 190\u2013206 (1989)","journal-title":"ORSA J. Comput."},{"key":"9235_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1007\/BFb0032050","volume-title":"Automata, Languages and Programming","author":"D Johnson","year":"1990","unstructured":"Johnson, D.: Local optimization and the traveling salesman problem. In: Paterson, M. (ed.) Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 443, pp. 446\u2013461. Springer, Berlin (1990)"},{"key":"9235_CR15","first-page":"215","volume-title":"Local Search in Combinatorial Optimization, vol. 1","author":"D Johnson","year":"1997","unstructured":"Johnson, D., McGeoch, L.: The traveling salesman problem: a case study in local optimization. In: Aarts, E.H.L., Lenstra, J.K. (eds.) Local Search in Combinatorial Optimization, vol. 1, pp. 215\u2013310. Wiley, Chichester (1997)"},{"key":"9235_CR16","unstructured":"Katayama K, Narihisa H, et al. Iterated local search approach using genetic transformation to the traveling salesman problem. In: Proceedings of GECCO 99, vol. 1, pp. 321\u2013328 (1999)"},{"issue":"1","key":"9235_CR17","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0020-0190(99)00031-9","volume":"70","author":"S Khuller","year":"1999","unstructured":"Khuller, S., Moss, A., Naor, J.S.: The budgeted maximum coverage problem. Inf. Process. Lett. 70(1), 39\u201345 (1999)","journal-title":"Inf. Process. Lett."},{"key":"9235_CR18","doi-asserted-by":"crossref","unstructured":"K\u00f6nemann, J., Parekh, O., Segev, D.: A unified approach to approximating partial covering problems. In: Algorithms-ESA 2006, pp. 468\u2013479. Springer, Berlin (2006)","DOI":"10.1007\/11841036_43"},{"issue":"3","key":"9235_CR19","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/(SICI)1099-1425(200005\/06)3:3<125::AID-JOS40>3.0.CO;2-C","volume":"3","author":"S Kreipl","year":"2000","unstructured":"Kreipl, S.: A large step random walk for minimizing total weighted tardiness in a job shop. J. Sched. 3(3), 125\u2013138 (2000)","journal-title":"J. Sched."},{"issue":"3","key":"9235_CR20","doi-asserted-by":"crossref","first-page":"1387","DOI":"10.1016\/j.ejor.2005.09.028","volume":"176","author":"G Lan","year":"2007","unstructured":"Lan, G., DePuy, G., Whitehouse, G.: An effective and simple heuristic for the set covering problem. Eur. J. Oper. Res. 176(3), 1387\u20131403 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"9235_CR21","unstructured":"Louren\u00e7o HR, Zwijnenburg M (1996) Combining the large-step optimization with tabu-search: Application to the job-shop scheduling problem. In: Meta-Heuristics, pp 219\u2013236. Springer, Berlin (1996)."},{"key":"9235_CR22","unstructured":"Louren\u00e7o, H.R., Martin, O.C., St\u00fctzle, T.: Iterated local search. In: Handbook of Metaheuristics, vol. 57 of International Series in Operations Research and Management Science, pp. 321\u2013353. Kluwer Academic Publishers, Norwell (2002)."},{"issue":"4","key":"9235_CR23","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1002\/cpe.4330070404","volume":"7","author":"O Martin","year":"1995","unstructured":"Martin, O., Otto, S.: Partitioning of unstructured meshes for load balancing. Concurr. Pract. Experience 7(4), 303\u2013314 (1995)","journal-title":"Concurr. Pract. Experience"},{"issue":"1","key":"9235_CR24","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF02601639","volume":"63","author":"O Martin","year":"1996","unstructured":"Martin, O., Otto, S.: Combining simulated annealing with local search heuristics. Annals Oper. Res. 63(1), 57\u201375 (1996)","journal-title":"Annals Oper. Res."},{"key":"9235_CR25","unstructured":"Martin, O., Otto, S., Felten, E.: Large-step Markov chains for the traveling salesman problem. Technical report, Oregon Graduate Institute of Science and Technology. Department of Computer Science and Engineering, (1991)"},{"issue":"3","key":"9235_CR26","first-page":"29","volume":"32","author":"A Misevi\u010dius","year":"2004","unstructured":"Misevi\u010dius, A.: Using iterated tabu search for the travelling salesman problem. Inf. Technol. Control 32(3), 29\u201340 (2004)","journal-title":"Inf. Technol. Control"},{"issue":"3","key":"9235_CR27","first-page":"187","volume":"35","author":"A Misevi\u010dius","year":"2006","unstructured":"Misevi\u010dius, A., Lenkevicius, A., Rubliauskas, D.: Iterated tabu search: an improvement to standard tabu search. Inf. Technol. Control 35(3), 187\u2013197 (2006)","journal-title":"Inf. Technol. Control"},{"issue":"1","key":"9235_CR28","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/j.amc.2006.11.090","volume":"189","author":"G Palubeckis","year":"2007","unstructured":"Palubeckis, G.: Iterated tabu search for the maximum diversity problem. Appl. Math. Comput. 189(1), 371\u2013383 (2007)","journal-title":"Appl. Math. Comput."},{"key":"9235_CR29","unstructured":"Pan, G.: Geostatistical design of infill drilling programs. Society of Mining Engineers of AIME 142 (1995)"},{"key":"9235_CR30","doi-asserted-by":"crossref","unstructured":"Radcliffe, N.J., Surry, P.D.: Formal memetic algorithms. In: Evolutionary Computing, pp. 1\u201316. Springer, Berlin (1994)","DOI":"10.1007\/3-540-58483-8_1"},{"key":"9235_CR31","doi-asserted-by":"crossref","unstructured":"Smyth, K., Hoos, H.H., St\u00fctzle, T.: Iterated robust tabu search for max-sat. In: Advances in Artificial Intelligence, Lecture Notes in Computer Science vol. 2671, pp. 129\u2013144. Springer, Berlin (2003)","DOI":"10.1007\/3-540-44886-1_12"},{"key":"9235_CR32","unstructured":"St\u00fctzle, T.: Applying iterated local search to the permutation flow shop problem. Technical Report, FG Intellektik, TU Darmstadt (1998)"},{"issue":"2","key":"9235_CR33","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1504\/IJLSM.2011.042625","volume":"10","author":"M Subramanian","year":"2011","unstructured":"Subramanian, M.: A hybrid heuristic, based on iterated local search and genius, for the vehicle routing problem with simultaneous pickup and delivery. Int. J. Logist. Syst. Manag. 10(2), 142\u2013157 (2011)","journal-title":"Int. J. Logist. Syst. Manag."},{"key":"9235_CR34","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-11343-7","volume-title":"Metaheuristic Search Concepts: A Tutorial with Applications to Production and Logistics","author":"G Z\u00e4pfel","year":"2010","unstructured":"Z\u00e4pfel, G., Braune, R., B\u00f6gl, M.: Metaheuristic Search Concepts: A Tutorial with Applications to Production and Logistics. Springer, Berlin (2010)"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-013-9235-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-013-9235-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-013-9235-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,5]],"date-time":"2019-08-05T13:15:57Z","timestamp":1565010957000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-013-9235-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,1]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["9235"],"URL":"https:\/\/doi.org\/10.1007\/s10732-013-9235-9","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,1]]}}}