{"entities":{"Q4704239":{"pageid":6733816,"ns":120,"title":"Item:Q4704239","lastrevid":108532130,"modified":"2026-11-06T21:03:54Z","type":"item","id":"Q4704239","labels":{},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1374046"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4704239$C2B7A180-69A8-4974-9CA5-EFC834B430D7","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"6eca6209d6460d5aa434eb756fc119eef0146130","datavalue":{"value":"0930.00082","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4704239$322279A2-2379-4E81-8DFF-415025D9D6F8","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"8e7b4afc73733724b1d62a948563b59de6d3ef40","datavalue":{"value":{"time":"+1999-12-06T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q4704239$C1AAD63C-1987-4229-BE4C-520B45BAD288","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f2c17db95e93f9a5a19ff6c68b3a1df8b0c021e","datavalue":{"value":"00B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4704239$46262576-5688-4AB0-9AAC-2B9D91E81F8E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ecbbf3779c517fef97ab936b0a129d7ef035b583","datavalue":{"value":"90-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4704239$53B13332-EE4E-4E14-B464-94C76FB5DBD4","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"41537a43371d481ff3269763e207a2a93056a9e5","datavalue":{"value":"1374046","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4704239$A2E94AE9-771C-4FB2-8BDE-E7580C75F40E","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"13a021debe7337d8d54eb701b0a60d60d5d2c8cf","datavalue":{"value":"Sophia-Antipolis (France)","type":"string"},"datatype":"string"},"type":"statement","id":"Q4704239$075ED323-446B-4B5F-B0FD-1705EE98E7E4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5d83ae477e518ffecea78688f13a2aaaeca13299","datavalue":{"value":"Conference","type":"string"},"datatype":"string"},"type":"statement","id":"Q4704239$2960241D-A6CF-4879-8F92-911CFAC72062","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c72d6968a6a416884b3f0cfc0858ee54740abcda","datavalue":{"value":"Meta-Heuristics","type":"string"},"datatype":"string"},"type":"statement","id":"Q4704239$C60DB170-A5B2-4DF3-859E-901B7820671E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5c4c4bb5a86a0fdf66f908b603f2f6975f5ef6fc","datavalue":{"value":"Proceedings","type":"string"},"datatype":"string"},"type":"statement","id":"Q4704239$C5CC1D6E-3E95-4189-BB1B-D142FD2F7B38","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4704239$9940F595-A43D-4E9E-BCCD-B7E043CA1D12","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"8b1926464240a8dfa0a208d3785d7b9842dab672","datavalue":{"value":"The articles of this volume will be reviewed individually. The preceding conference (1st, 1995) has been reviewed (see Zbl 0869.00056). Indexed articles: \\textit{Baar, Tonius; Brucker, Peter; Knust, Sigrid}, Tabu search algorithms and lower bounds for the resource-constrained project scheduling problem, 1-18 [Zbl 1074.90563] \\textit{Brand\u00e3o, Jos\u00e9}, Metaheuristic for the vehicle routing problem with time windows, 19-36 [Zbl 0968.90039] \\textit{Cavique, Luis; Rego, C\u00e9sar; Themido, Isabel}, New heuristic algorithms for the crew scheduling problem, 37-47 [Zbl 0972.90027] \\textit{Chelouah, Rachid; Siarry, Patrick}, Enhanced continuous tabu search: an algorithm for optimizing multiminima functions, 49-61 [Zbl 1073.90578] \\textit{De Backer, Bruno; Furnon, Vincent}, Local search in constraint programming: Experiments with tabu search on the vehicle routing problem, 63-76 [Zbl 0972.90014] \\textit{Dorne, Rapha\u00ebl; Hao, Jin-Kao}, Tabu search for graph coloring, \\(T\\)-colorings and set \\(T\\)-colorings, 77-92 [Zbl 0972.90061] \\textit{Glover, Fred; Kochenberger, Gary; Alidaee, Bahram; Amini, Mohammed M.}, Tabu search with critical event memory: An enhanced application for binary quadratic programs, 93-109 [Zbl 0972.90053] \\textit{Kincaid, Rex K.; Padula, Sharon L.}, Actuator selection for the control of multi-frequency noise in aircraft interiors, 111-124 [Zbl 0970.90043] \\textit{Lodi, Andrea; Martello, Silvano; Vigo, Daniele}, Neighborhood search algorithm for the guillotine non-oriented two-dimensional bin packing problem, 125-139 [Zbl 0970.90079] \\textit{L\u00f8kketangen, Arne; Glover, Fred}, Candidate list and exploration strategies for solving 0/1 MIP problems using a pivot neighborhood, 141-154 [Zbl 0970.90078] \\textit{Mechti, Redouane; Poujade, Stephane; Roucairol, Catherine; Lemari\u00e9, Bernard}, Global and local moves in tabu search: A real-life mail collecting application, 155-174 [Zbl 0968.90040] \\textit{Nowicki, Eugeniusz; Smutnicki, Czes\u0142aw}, Flow line scheduling by tabu search, 175-189 [Zbl 0970.90033] \\textit{Allen, Stuart M.; Hurley, Steve; Smith, Derek H.; Thiel, Stefan U.}, Using lower bounds in minimum span frequency assignment, 191-204 [Zbl 0970.90041] \\textit{Ben Abdelaziz, Foued; Krichen, Saoussen; Chaouachi, Jouhaina}, A hybrid heuristic for multiobjective knapsack problems, 205-212 [Zbl 0970.90068] \\textit{Greistorfer, Peter}, Hybrid genetic tabu search for a cyclic scheduling problem, 213-229 [Zbl 0970.90032] \\textit{Derigs, Ulrich; Kabath, Martin; Zils, Markus}, Adaptive genetic algorithms: A methodology for dynamic autoconfiguration of genetic search algorithms, 231-248 [Zbl 0972.90060] \\textit{Falkenauer, Emanuel}, The lavish ordering genetic algorithm, 249-256 [Zbl 0970.90072] \\textit{Fonlupt, Cyril; Robilliard, Denis; Preux, Philippe; Talbi, El-Ghazali}, Fitness landscapes and performance of meta-heuristics, 257-268 [Zbl 0970.90074] \\textit{Riff, Mar\u00eda-Cristina}, A network-based adaptive evolutionary algorithm for constraint satisfaction problems, 269-283 [Zbl 0970.90080] \\textit{Bullnheimer, Bernd; Hartl, Richard F.; Strauss, Christine}, Applying the ant system to the vehicle routing problem, 285-296 [Zbl 0970.90019] \\textit{Sondergeld, Lutz; Vo\u00df, Stefan}, Cooperative intelligent search using adaptive memory techniques, 297-312 [Zbl 0985.90078] \\textit{St\u00fctzle, Thomas; Hoos, Holger}, The max-min ant system and local search for combinatorial optimization problems, 313-329 [Zbl 0970.90083] \\textit{Crainic, Teodor Gabriel; Gendreau, Michel}, Towards an evolutionary method -- cooperating multi-thread parallel tabu search hybrid, 331-344 [Zbl 0970.90121] \\textit{Talbi, El-Ghazali; Hafidi, Zouhir; Geib, Jean-Marc}, Parallel tabu search for large optimization problems, 345-358 [Zbl 0970.90124] \\textit{ten Eikelder, Huub M. M.; Aarts, Bas J. M.; Verhoeven, Marco G. A.; Aarts, Emile H. L.}, Sequential and parallel local search algorithms for job shop scheduling, 359-371 [Zbl 0970.90066] \\textit{Toulouse, Michel; Crainic, Teodor Gabriel; Sans\u00f3, Brunilde}, An experimental study of systemic behavior of cooperative search algorithms, 373-392 [Zbl 0970.90084] \\textit{Andresol, Ricardo; Gendreau, Michel; Potvin, Jean-Yves}, A Hopfield-tank neural network model for the generalized traveling salesman problem, 393-402 [Zbl 0972.90057] \\textit{Fleischer, Mark A.}, Generalized cybernetic optimization: Solving continuous variable problems, 403-418 [Zbl 0972.90062] \\textit{Galinier, Philippe; Hao, Jin-Kao}, Solving the progressive party problem by local search, 419-432 [Zbl 0985.90077] \\textit{Hansen, Pierre; Mladenovi\u0107, Nenad}, An introduction to variable neighborhood search, 433-458 [Zbl 0985.90095] \\textit{Yagiura, Mutsunori; Yamaguchi, Takashi; Ibaraki, Toshihide}, A variable depth search algorithm for the generalized assignment problem, 459-471 [Zbl 0985.90079] \\textit{Kilby, Philip; Prosser, Patrick; Shaw, Paul}, Guided local search for the vehicle routing problem with time windows, 473-486 [Zbl 0985.90019] \\textit{Rolland, Erik; Patterson, Raymond A.; Pirkul, Hasan}, Memory adaptive reasoning \\& greedy assignment techniques for the capacitated minimum spanning tree problem, 487-498 [Zbl 0970.90081] \\textit{Woodruff, David L.}, A chunking based selection strategy for integrating meta-heuristics with branch and bound, 499-511 [Zbl 0970.90125]","type":"string"},"datatype":"string"},"type":"statement","id":"Q4704239$A6559BBD-724A-4CCC-AE27-1F233B870960","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:4704239","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:4704239"}}}}}