{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:43:54Z","timestamp":1767339834554,"version":"3.38.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,9,27]],"date-time":"2011-09-27T00:00:00Z","timestamp":1317081600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s10898-011-9783-1","type":"journal-article","created":{"date-parts":[[2011,9,26]],"date-time":"2011-09-26T11:07:14Z","timestamp":1317035234000},"page":"649-667","source":"Crossref","is-referenced-by-count":6,"title":["Tabu search for the BWC problem"],"prefix":"10.1007","volume":"54","author":[{"given":"Daniel","family":"Berend","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ephraim","family":"Korach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shira","family":"Zucker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,9,27]]},"reference":[{"key":"9783_CR1","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1023\/B:HEUR.0000026267.44673.ed","volume":"10","author":"A.C.F. Alvim","year":"2004","unstructured":"Alvim A.C.F., Ribeiro C.C., Glover F., Aloise D.J.: A hybrid improvement heuristic for the one-dimensional bin packing problem. J. Heuristics 10, 205\u2013229 (2004)","journal-title":"J. Heuristics"},{"key":"9783_CR2","doi-asserted-by":"crossref","unstructured":"Alabas, C., Altiparmak, F., Dengiz, B.: The optimization of number of kanbans with genetic algorithms, simulated annealing and tabu search. In: Proceedings of the 2000 Congress on Evolutionary Computation CEC00, pp. 580\u2013585. IEEE Press (2000)","DOI":"10.1109\/CEC.2000.870349"},{"key":"9783_CR3","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF02430363","volume":"1","author":"B.L. Barr","year":"1995","unstructured":"Barr B.L., Golden J.P., Kelly J.P., Resende M.G.C., Stewart W.R.: Designing and reporting on computational experiments with heuristic methods. J. Heuristics 1, 9\u201332 (1995)","journal-title":"J. Heuristics"},{"key":"9783_CR4","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1016\/j.disopt.2008.02.001","volume":"5\/3","author":"D. Berend","year":"2008","unstructured":"Berend D., Korach E., Zucker S.: Anticoloring of a family of grid graphs. Discret. Optim. 5\/3, 647\u2013662 (2008)","journal-title":"Discret. Optim."},{"key":"9783_CR5","doi-asserted-by":"crossref","unstructured":"Berend, D., Korach, E., Zucker, S.: Two-anticoloring of planar and related graphs. In: DMTCS Proceedings, AD:335\u2013342. URL: http:\/\/www.dmtcs.org\/pdfpapers\/dmAD0130.pdf (2005)","DOI":"10.46298\/dmtcs.3388"},{"key":"9783_CR6","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/j.endm.2007.01.062","volume":"28","author":"D. Berend","year":"2006","unstructured":"Berend D., Korach E., Zucker S.: A reduction of the anticoloring problem to connected graphs. Electron. Notes Discret. Math. 28, 445\u2013451 (2006)","journal-title":"Electron. Notes Discret. Math."},{"key":"9783_CR7","unstructured":"Berend, D., Korach, E., Zucker, S.: Anticoloring and separation of graphs. Discret. Math. (accepted for publication)"},{"key":"9783_CR8","unstructured":"Berend, D., Zucker, S.: The black-and-white coloring problem on trees. J. Graph Algorithm. Appl. (accepted for publication)"},{"key":"9783_CR9","unstructured":"Bodirsky, M., Gropl, C., Kang, M.: Generating labeled planar graphs uniformly at random (2007). URL: http:\/\/www.informatik.hu-berlin.de\/~bodirsky\/publications\/planar.ps"},{"key":"9783_CR10","unstructured":"Bray, N.: From mathworld\u2014a wolfram web resource, created by Weisstein, E.W. URL: http:\/\/www.mathworld.wolfram.com\/GraphStrongProduct.html"},{"key":"9783_CR11","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00940812","volume":"45","author":"V. \u010cern\u00fd","year":"1985","unstructured":"\u010cern\u00fd V.: A thermodynamical approach to the travelling salesman problem: an efficient simulation algorithm. J. Optim. Theory Appl. 45, 41\u201351 (1985)","journal-title":"J. Optim. Theory Appl."},{"key":"9783_CR12","first-page":"193","volume-title":"Bonferroni inequalities. Advanced Combinatorics: The Art of Finite and Infinite Expansions","author":"L. Comtet","year":"1974","unstructured":"Comtet L.: Bonferroni inequalities. Advanced Combinatorics: The Art of Finite and Infinite Expansions, pp. 193\u2013194. Springer, Berlin (1974)"},{"key":"9783_CR13","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s002360050082","volume":"34\/3","author":"H. Djidjev","year":"1997","unstructured":"Djidjev H., Venkatesan S.: Reduced constants for simple cycle graph separation. Acta Inform. 34\/3, 231\u2013243 (1997)","journal-title":"Acta Inform."},{"key":"9783_CR14","unstructured":"Denise, A., Vasconcellos, M., Welsh, D.J.A.: The random planar graph. Congr. Numerantium 113, 61\u201379 (1996) URL: http:\/\/www.citeseer.ist.psu.edu\/denise96random.html"},{"key":"9783_CR15","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., Resende M.G.C.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8, 67\u201371 (1989)","journal-title":"Oper. Res. Lett."},{"key":"9783_CR16","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F. Glover","year":"1986","unstructured":"Glover F.: Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13, 533\u2013549 (1986)","journal-title":"Comput. Oper. Res."},{"key":"9783_CR17","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1007\/BF02023611","volume":"5","author":"F. Glover","year":"1985","unstructured":"Glover F., McMillan C., Novick B.: Interactive decision software and computer graphics for architectural and space planning. Ann. Oper. Res. 5, 557\u2013573 (1985)","journal-title":"Ann. Oper. Res."},{"key":"9783_CR18","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover F.: Tabu search: part one. ORSA J. Comput. 1, 190\u2013206 (1989)","journal-title":"ORSA J. Comput."},{"key":"9783_CR19","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"Glover F.: Tabu search: part two. ORSA J. Comput. 2, 4\u201332 (1990)","journal-title":"ORSA J. Comput."},{"key":"9783_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F. Glover","year":"1997","unstructured":"Glover F., Laguna M.: Tabu search. Kluwer, Boston, Mass (1997)"},{"key":"9783_CR21","unstructured":"Gerke, S., Schlatter, D., Steger, A., Taraz, A.: The Random Planar Graph Process, preprint. URL: http:\/\/www-m9.ma.tum.de\/~taraz\/paper\/rpgp.pdf"},{"key":"9783_CR22","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/S0012-365X(96)00187-2","volume":"165\/6","author":"P. Hansen","year":"1997","unstructured":"Hansen P., Hertz A., Quinodoz N.: Splitting trees. Discret. Math. 165\/6, 403\u2013419 (1997)","journal-title":"Discret. Math."},{"key":"9783_CR23","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0167-6377(87)90021-6","volume":"6","author":"J.P. Hart","year":"1987","unstructured":"Hart J.P., Shogan A.W.: Semi-greedy heuristics: an empirical study. Oper. Res. Lett. 6, 107\u2013114 (1987)","journal-title":"Oper. Res. Lett."},{"key":"9783_CR24","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0377-2217(91)90321-L","volume":"54","author":"A. Hertz","year":"1991","unstructured":"Hertz A.: Tabu search for large scale timetabling problems. Eur. J. Oper. Res. 54, 39\u201347 (1991)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9783_CR25","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1287\/opre.48.1.129.12455","volume":"48","author":"A. Hertz","year":"2000","unstructured":"Hertz A., Laporte G., Mittaz M.: A tabu search heuristic for the capacitated arc routing problem. Oper. Res. 48(1), 129\u2013135 (2000)","journal-title":"Oper. Res."},{"key":"9783_CR26","unstructured":"Hertz, A., Taillard, E., de Werra, D.: A tutorial on tabu search. In: Proceedings of Giornate di Lavoro AIRO\u201995 (Entreprise Systems: Management of Technological and Organizational Changes) pp. 13\u201324 (1995)"},{"key":"9783_CR27","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF02239976","volume":"39","author":"A. Hertz","year":"1987","unstructured":"Hertz A., de Werra D.: Using tabu search techniques for graph coloring. Computing 39, 345\u2013351 (1987)","journal-title":"Computing"},{"key":"9783_CR28","doi-asserted-by":"crossref","unstructured":"Johnson, D.S.: A theoretician\u2019s guide to the experimental analysis of algorithms. In: Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges, pp. 215\u2013250. American Mathematical Society (2002)","DOI":"10.1090\/dimacs\/059\/11"},{"key":"9783_CR29","doi-asserted-by":"crossref","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220\/4598:671\u2013680 (1983) URL: http:\/\/www.citeseer.ist.psu.edu\/kirkpatrick83optimization.html","DOI":"10.1126\/science.220.4598.671"},{"key":"9783_CR30","unstructured":"Kobler, D., Korach, E., Hertz, A.: On black-and-white colorings, anticolorings and extensions, preprint"},{"key":"9783_CR31","first-page":"177","volume":"36\/2","author":"R.J. Lipton","year":"1979","unstructured":"Lipton R.J., Tarjan R.E.: A separator theorem for planar graphs. Appl. Math. 36\/2, 177\u2013189 (1979)","journal-title":"Appl. Math."},{"key":"9783_CR32","unstructured":"Berkelaar, M.: LPSOLVE package. URL: http:\/\/www.lpsolve.sourceforge.net"},{"key":"9783_CR33","unstructured":"McKay, B., Brinkmann, G.: A useful planar graph generator (2001). URL: http:\/\/cs.anu.edu.au\/~bdm\/plantri\/"},{"key":"9783_CR34","unstructured":"Mooney, E.L., Rardin, R.L.: Tabu search for a class of scheduling problems. Ann. Oper. Res. (issue of Tabu Search) (1995)"},{"key":"9783_CR35","first-page":"178","volume-title":"Greedy randomized adaptive search procedure","author":"L.S. Pitsoulis","year":"2002","unstructured":"Pitsoulis L.S., Resende M.G.C.: Greedy randomized adaptive search procedure, pp. 178\u2013183. Oxford University Press, Oxford (2002)"},{"key":"9783_CR36","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1287\/ijoc.2.1.33","volume":"2","author":"J. Skorin-Kapov","year":"1990","unstructured":"Skorin-Kapov J.: Tabu search applied to the quadratic assignment problem. ORSA J. Comput. 1 2, 33\u201345 (1990)","journal-title":"ORSA J. Comput. 1"},{"key":"9783_CR37","unstructured":"Tomlab, Matlab: The tomlab optimization environment. URL: http:\/\/www.tomopt.com\/tomlab"},{"key":"9783_CR38","unstructured":"Weisstein, E.W.: From mathworld\u2014a wolfram web resource. http:\/\/www.mathworld.wolfram.com\/CartesianProduct.html"},{"key":"9783_CR39","unstructured":"Yahalom, O.: Anticoloring problems on graphs. M.Sc. Thesis, Ben-Gurion University (2001)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-011-9783-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-011-9783-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-011-9783-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T01:52:54Z","timestamp":1741744374000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-011-9783-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9,27]]},"references-count":39,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["9783"],"URL":"https:\/\/doi.org\/10.1007\/s10898-011-9783-1","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2011,9,27]]}}}