callback( { "result":{ "query":":facetid:toc:\"db/journals/heuristics/heuristics8.bht\"", "status":{ "@code":"200", "text":"OK" }, "time":{ "@unit":"msecs", "text":"184.83" }, "completions":{ "@total":"1", "@computed":"1", "@sent":"1", "c":{ "@sc":"32", "@dc":"32", "@oc":"32", "@id":"43452989", "text":":facetid:toc:db/journals/heuristics/heuristics8.bht" } }, "hits":{ "@total":"32", "@computed":"32", "@sent":"32", "@first":"0", "hit":[{ "@score":"1", "@id":"6230285", "info":{"authors":{"author":[{"@pid":"35/2751","text":"Uwe Aickelin"},{"@pid":"84/3710","text":"Kathryn A. Dowsland"}]},"title":"Enhanced Direct and Indirect Genetic Algorithm Approaches for a Mall Layout and Tenant Selection Problem.","venue":"J. Heuristics","volume":"8","number":"5","pages":"503-514","year":"2002","type":"Journal Articles","access":"closed","key":"journals/heuristics/AickelinD02","doi":"10.1023/A:1016536623961","ee":"https://doi.org/10.1023/A:1016536623961","url":"https://dblp.org/rec/journals/heuristics/AickelinD02"}, "url":"URL#6230285" }, { "@score":"1", "@id":"6230286", "info":{"authors":{"author":[{"@pid":"39/2253","text":"Renata M. Aiex"},{"@pid":"r/MauricioGCResende","text":"Mauricio G. C. Resende"},{"@pid":"26/4167","text":"Celso C. Ribeiro"}]},"title":"Probability Distribution of Solution Time in GRASP: An Experimental Investigation.","venue":"J. Heuristics","volume":"8","number":"3","pages":"343-373","year":"2002","type":"Journal Articles","access":"closed","key":"journals/heuristics/AiexRR02","doi":"10.1023/A:1015061802659","ee":"https://doi.org/10.1023/A:1015061802659","url":"https://dblp.org/rec/journals/heuristics/AiexRR02"}, "url":"URL#6230286" }, { "@score":"1", "@id":"6230287", "info":{"authors":{"author":[{"@pid":"45/3706","text":"Ahmad A. Al-Yamani"},{"@pid":"43/233","text":"Sadiq M. Sait"},{"@pid":"32/6182","text":"Habib Youssef"},{"@pid":"07/4969","text":"Hassan R. Barada"}]},"title":"Parallelizing Tabu Search on a Cluster of Heterogeneous Workstations.","venue":"J. Heuristics","volume":"8","number":"3","pages":"277-304","year":"2002","type":"Journal Articles","access":"closed","key":"journals/heuristics/Al-YamaniSYB02","doi":"10.1023/A:1015005717680","ee":"https://doi.org/10.1023/A:1015005717680","url":"https://dblp.org/rec/journals/heuristics/Al-YamaniSYB02"}, "url":"URL#6230287" }, { "@score":"1", "@id":"6230288", "info":{"authors":{"author":[{"@pid":"44/1982","text":"Alexandre A. Andreatta"},{"@pid":"26/4167","text":"Celso C. Ribeiro"}]},"title":"Heuristics for the Phylogeny Problem.","venue":"J. Heuristics","volume":"8","number":"4","pages":"429-447","year":"2002","type":"Journal Articles","access":"closed","key":"journals/heuristics/AndreattaR02","doi":"10.1023/A:1015439913121","ee":"https://doi.org/10.1023/A:1015439913121","url":"https://dblp.org/rec/journals/heuristics/AndreattaR02"}, "url":"URL#6230288" }, { "@score":"1", "@id":"6230289", "info":{"authors":{"author":[{"@pid":"29/359","text":"Eric Angel"},{"@pid":"z/VassilisZissimopoulos","text":"Vassilis Zissimopoulos"}]},"title":"On the Hardness of the Quadratic Assignment Problem with Metaheuristics.","venue":"J. Heuristics","volume":"8","number":"4","pages":"399-414","year":"2002","type":"Journal Articles","access":"closed","key":"journals/heuristics/AngelZ02","doi":"10.1023/A:1015454612213","ee":"https://doi.org/10.1023/A:1015454612213","url":"https://dblp.org/rec/journals/heuristics/AngelZ02"}, "url":"URL#6230289" }, { "@score":"1", "@id":"6230290", "info":{"authors":{"author":[{"@pid":"53/6380","text":"Stefano Bistarelli"},{"@pid":"m/UgoMontanari","text":"Ugo Montanari"},{"@pid":"r/FrancescaRossi","text":"Francesca Rossi 0001"}]},"title":"Soft Constraint Logic Programming and Generalized Shortest Path Problems.","venue":"J. Heuristics","volume":"8","number":"1","pages":"25-41","year":"2002","type":"Journal Articles","access":"closed","key":"journals/heuristics/BistarelliMR02","doi":"10.1023/A:1013609600697","ee":"https://doi.org/10.1023/A:1013609600697","url":"https://dblp.org/rec/journals/heuristics/BistarelliMR02"}, "url":"URL#6230290" }, { "@score":"1", "@id":"6230291", "info":{"authors":{"author":[{"@pid":"00/6083","text":"Jacek Blazewicz"},{"@pid":"40/2967","text":"Marta Kasprzak"},{"@pid":"81/6120","text":"Wojciech Kuroczycki"}]},"title":"Hybrid Genetic Algorithm for DNA Sequencing with Errors.","venue":"J. Heuristics","volume":"8","number":"5","pages":"495-502","year":"2002","type":"Journal Articles","access":"closed","key":"journals/heuristics/BlazewiczKK02","doi":"10.1023/A:1016589707123","ee":"https://doi.org/10.1023/A:1016589707123","url":"https://dblp.org/rec/journals/heuristics/BlazewiczKK02"}, "url":"URL#6230291" }, { "@score":"1", "@id":"6230292", "info":{"authors":{"author":[{"@pid":"83/1522","text":"Massimiliano Caramia"},{"@pid":"75/5423","text":"Paolo Dell'Olmo"}]},"title":"Constraint Propagation in Graph Coloring.","venue":"J. Heuristics","volume":"8","number":"1","pages":"83-107","year":"2002","type":"Journal Articles","access":"closed","key":"journals/heuristics/CaramiaD02","doi":"10.1023/A:1013665718444","ee":"https://doi.org/10.1023/A:1013665718444","url":"https://dblp.org/rec/journals/heuristics/CaramiaD02"}, "url":"URL#6230292" }, { "@score":"1", "@id":"6230293", "info":{"authors":{"author":[{"@pid":"c/AmedeoCesta","text":"Amedeo Cesta"},{"@pid":"82/2253","text":"Angelo Oddi"},{"@pid":"s/StephenFSmith","text":"Stephen F. Smith"}]},"title":"A Constraint-Based Method for Project Scheduling with Time Windows.","venue":"J. Heuristics","volume":"8","number":"1","pages":"109-136","year":"2002","type":"Journal Articles","access":"closed","key":"journals/heuristics/CestaOS02","doi":"10.1023/A:1013617802515","ee":"https://doi.org/10.1023/A:1013617802515","url":"https://dblp.org/rec/journals/heuristics/CestaOS02"}, "url":"URL#6230293" }, { "@score":"1", "@id":"6230294", "info":{"authors":{"author":[{"@pid":"83/2295","text":"Marie-Christine Costa"},{"@pid":"h/AlainHertz","text":"Alain Hertz"},{"@pid":"52/4287","text":"Michel Mittaz"}]},"title":"Bounds and Heuristics for the Shortest Capacitated Paths Problem.","venue":"J. Heuristics","volume":"8","number":"4","pages":"449-465","year":"2002","type":"Journal Articles","access":"closed","key":"journals/heuristics/CostaHM02","doi":"10.1023/A:1015492014030","ee":"https://doi.org/10.1023/A:1015492014030","url":"https://dblp.org/rec/journals/heuristics/CostaHM02"}, "url":"URL#6230294" }, { "@score":"1", "@id":"6230295", "info":{"authors":{"author":[{"@pid":"83/6773","text":"Teodor Gabriel Crainic"},{"@pid":"08/5862","text":"Michel Gendreau"}]},"title":"Cooperative Parallel Tabu Search for Capacitated Network Design.","venue":"J. Heuristics","volume":"8","number":"6","pages":"601-627","year":"2002","type":"Journal Articles","access":"closed","key":"journals/heuristics/CrainicG02","doi":"10.1023/A:1020325926188","ee":"https://doi.org/10.1023/A:1020325926188","url":"https://dblp.org/rec/journals/heuristics/CrainicG02"}, "url":"URL#6230295" }, { "@score":"1", "@id":"6230296", "info":{"authors":{"author":[{"@pid":"83/6773","text":"Teodor Gabriel Crainic"},{"@pid":"87/3990","text":"Michel Toulouse"}]},"title":"Introduction to the Special Issue on Parallel Meta-Heuristics.","venue":"J. Heuristics","volume":"8","number":"3","pages":"247-249","year":"2002","type":"Journal Articles","access":"closed","key":"journals/heuristics/CrainicT02","doi":"10.1023/A:1015084116772","ee":"https://doi.org/10.1023/A:1015084116772","url":"https://dblp.org/rec/journals/heuristics/CrainicT02"}, "url":"URL#6230296" }, { "@score":"1", "@id":"6230297", "info":{"authors":{"author":[{"@pid":"09/3938","text":"Opher Dubrovsky"},{"@pid":"22/3589","text":"Gregory Levitin"},{"@pid":"86/3334","text":"Michal Penn"}]},"title":"A Genetic Algorithm with a Compact Solution Encoding for the Container Ship Stowage Problem.","venue":"J. Heuristics","volume":"8","number":"6","pages":"585-599","year":"2002","type":"Journal Articles","access":"closed","key":"journals/heuristics/DubrovskyLP02","doi":"10.1023/A:1020373709350","ee":"https://doi.org/10.1023/A:1020373709350","url":"https://dblp.org/rec/journals/heuristics/DubrovskyLP02"}, "url":"URL#6230297" }, { "@score":"1", "@id":"6230298", "info":{"authors":{"author":[{"@pid":"15/5253","text":"Torsten Fahle"},{"@pid":"07/1887","text":"Ulrich Junker"},{"@pid":"18/6812","text":"Stefan E. Karisch"},{"@pid":"98/4635","text":"Niklas Kohl"},{"@pid":"s/MeinolfSellmann","text":"Meinolf Sellmann"},{"@pid":"65/651","text":"Bo Vaaben"}]},"title":"Constraint Programming Based Column Generation for Crew Assignment.","venue":"J. Heuristics","volume":"8","number":"1","pages":"59-81","year":"2002","type":"Journal Articles","access":"closed","key":"journals/heuristics/FahleJKKSV02","doi":"10.1023/A:1013613701606","ee":"https://doi.org/10.1023/A:1013613701606","url":"https://dblp.org/rec/journals/heuristics/FahleJKKSV02"}, "url":"URL#6230298" }, { "@score":"1", "@id":"6230299", "info":{"authors":{"author":[{"@pid":"25/7016","text":"Filippo Focacci"},{"@pid":"196/3740","text":"Andrea Lodi 0001"},{"@pid":"m/MichelaMilano","text":"Michela Milano"}]},"title":"Mathematical Programming Techniques in Constraint Programming: A Short Overview.","venue":"J. Heuristics","volume":"8","number":"1","pages":"7-17","year":"2002","type":"Journal Articles","access":"closed","key":"journals/heuristics/FocacciLM02","doi":"10.1023/A:1013653332557","ee":"https://doi.org/10.1023/A:1013653332557","url":"https://dblp.org/rec/journals/heuristics/FocacciLM02"}, "url":"URL#6230299" }, { "@score":"1", "@id":"6230300", "info":{"authors":{"author":[{"@pid":"49/5691","text":"Alan P. French"},{"@pid":"05/4137-1","text":"John M. Wilson 0001"}]},"title":"Heuristic Solution Methods for the Multilevel Generalized Assignment Problem.","venue":"J. Heuristics","volume":"8","number":"2","pages":"143-153","year":"2002","type":"Journal Articles","access":"closed","key":"journals/heuristics/FrenchW02","doi":"10.1023/A:1017900606269","ee":"https://doi.org/10.1023/A:1017900606269","url":"https://dblp.org/rec/journals/heuristics/FrenchW02"}, "url":"URL#6230300" }, { "@score":"1", "@id":"6230301", "info":{"authors":{"author":[{"@pid":"33/6709","text":"Félix García-López"},{"@pid":"95/2945","text":"Belén Melián-Batista"},{"@pid":"30/2188","text":"José A. Moreno-Pérez"},{"@pid":"10/4215","text":"J. Marcos Moreno-Vega"}]},"title":"The Parallel Variable Neighborhood Search for the p-Median Problem.","venue":"J. Heuristics","volume":"8","number":"3","pages":"375-388","year":"2002","type":"Journal Articles","access":"closed","key":"journals/heuristics/Garcia-LopezMMM02","doi":"10.1023/A:1015013919497","ee":"https://doi.org/10.1023/A:1015013919497","url":"https://dblp.org/rec/journals/heuristics/Garcia-LopezMMM02"}, "url":"URL#6230301" }, { "@score":"1", "@id":"6230302", "info":{"authors":{"author":[{"@pid":"95/5522","text":"Hermann Gehring"},{"@pid":"42/6928","text":"Jörg Homberger"}]},"title":"Parallelization of a Two-Phase Metaheuristic for Routing Problems with Time Windows.","venue":"J. Heuristics","volume":"8","number":"3","pages":"251-276","year":"2002","type":"Journal Articles","access":"closed","key":"journals/heuristics/GehringH02","doi":"10.1023/A:1015053600842","ee":"https://doi.org/10.1023/A:1015053600842","url":"https://dblp.org/rec/journals/heuristics/GehringH02"}, "url":"URL#6230302" }, { "@score":"1", "@id":"6230303", "info":{"authors":{"author":{"@pid":"08/5862","text":"Michel Gendreau"}},"title":"Constraint Programming and Operations Research: Comments from an Operations Researcher.","venue":"J. Heuristics","volume":"8","number":"1","pages":"19-24","year":"2002","type":"Journal Articles","access":"closed","key":"journals/heuristics/Gendreau02","doi":"10.1023/A:1013657516627","ee":"https://doi.org/10.1023/A:1013657516627","url":"https://dblp.org/rec/journals/heuristics/Gendreau02"}, "url":"URL#6230303" }, { "@score":"1", "@id":"6230304", "info":{"authors":{"author":[{"@pid":"05/5850","text":"Diptesh Ghosh"},{"@pid":"04/5377","text":"Gerard Sierksma"}]},"title":"Complete Local Search with Memory.","venue":"J. Heuristics","volume":"8","number":"6","pages":"571-584","year":"2002","type":"Journal Articles","access":"closed","key":"journals/heuristics/GhoshS02","doi":"10.1023/A:1020307925279","ee":"https://doi.org/10.1023/A:1020307925279","url":"https://dblp.org/rec/journals/heuristics/GhoshS02"}, "url":"URL#6230304" }, { "@score":"1", "@id":"6230305", "info":{"authors":{"author":[{"@pid":"22/1564","text":"José Fernando Gonçalves"},{"@pid":"59/3029","text":"Jorge Raimundo de Almeida"}]},"title":"A Hybrid Genetic Algorithm for Assembly Line Balancing.","venue":"J. Heuristics","volume":"8","number":"6","pages":"629-642","year":"2002","type":"Journal Articles","access":"closed","key":"journals/heuristics/GoncalvesA02","doi":"10.1023/A:1020377910258","ee":"https://doi.org/10.1023/A:1020377910258","url":"https://dblp.org/rec/journals/heuristics/GoncalvesA02"}, "url":"URL#6230305" }, { "@score":"1", "@id":"6230306", "info":{"authors":{"author":{"@pid":"97/6771","text":"Michael Kirley"}},"title":"A Cellular Genetic Algorithm with Disturbances: Optimisation Using Dynamic Spatial Interactions.","venue":"J. Heuristics","volume":"8","number":"3","pages":"321-342","year":"2002","type":"Journal Articles","access":"closed","key":"journals/heuristics/Kirley02","doi":"10.1023/A:1015009818589","ee":"https://doi.org/10.1023/A:1015009818589","url":"https://dblp.org/rec/journals/heuristics/Kirley02"}, "url":"URL#6230306" }, { "@score":"1", "@id":"6230307", "info":{"authors":{"author":[{"@pid":"16/2654","text":"Mikhail Y. Kovalyov"},{"@pid":"52/2807","text":"Frank Werner 0001"}]},"title":"Approximation Schemes for Scheduling Jobs with Common Due Date on Parallel Machines to Minimize Total Tardiness.","venue":"J. Heuristics","volume":"8","number":"4","pages":"415-428","year":"2002","type":"Journal Articles","access":"closed","key":"journals/heuristics/KovalyovW02","doi":"10.1023/A:1015487829051","ee":"https://doi.org/10.1023/A:1015487829051","url":"https://dblp.org/rec/journals/heuristics/KovalyovW02"}, "url":"URL#6230307" }, { "@score":"1", "@id":"6230308", "info":{"authors":{"author":[{"@pid":"91/2006","text":"Fen-Hui Lin"},{"@pid":"49/3931","text":"Way Kuo"}]},"title":"Reliability Importance and Invariant Optimal Allocation.","venue":"J. Heuristics","volume":"8","number":"2","pages":"155-171","year":"2002","type":"Journal Articles","access":"closed","key":"journals/heuristics/LinK02","doi":"10.1023/A:1017908523107","ee":"https://doi.org/10.1023/A:1017908523107","url":"https://dblp.org/rec/journals/heuristics/LinK02"}, "url":"URL#6230308" }, { "@score":"1", "@id":"6230309", "info":{"authors":{"author":[{"@pid":"22/3257","text":"C. K. Y. Lin"},{"@pid":"54/4769","text":"C. L. Wong"},{"@pid":"07/195","text":"Y. C. Yeung"}]},"title":"Heuristic Approaches for a Scheduling Problem in the Plastic Molding Department of an Audio Company.","venue":"J. Heuristics","volume":"8","number":"5","pages":"515-540","year":"2002","type":"Journal Articles","access":"closed","key":"journals/heuristics/LinWY02","doi":"10.1023/A:1016588608032","ee":"https://doi.org/10.1023/A:1016588608032","url":"https://dblp.org/rec/journals/heuristics/LinWY02"}, "url":"URL#6230309" }, { "@score":"1", "@id":"6230310", "info":{"authors":{"author":[{"@pid":"23/5023","text":"Peter Merz"},{"@pid":"f/BerndFreisleben","text":"Bernd Freisleben"}]},"title":"Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming.","venue":"J. Heuristics","volume":"8","number":"2","pages":"197-213","year":"2002","type":"Journal Articles","access":"closed","key":"journals/heuristics/MerzF02","doi":"10.1023/A:1017912624016","ee":"https://doi.org/10.1023/A:1017912624016","url":"https://dblp.org/rec/journals/heuristics/MerzF02"}, "url":"URL#6230310" }, { "@score":"1", "@id":"6230311", "info":{"authors":{"author":[{"@pid":"m/MartinMiddendorf","text":"Martin Middendorf"},{"@pid":"59/694","text":"Frank Reischle"},{"@pid":"s/HartmutSchmeck","text":"Hartmut Schmeck"}]},"title":"Multi Colony Ant Algorithms.","venue":"J. Heuristics","volume":"8","number":"3","pages":"305-320","year":"2002","type":"Journal Articles","access":"closed","key":"journals/heuristics/MiddendorfRS02","doi":"10.1023/A:1015057701750","ee":"https://doi.org/10.1023/A:1015057701750","url":"https://dblp.org/rec/journals/heuristics/MiddendorfRS02"}, "url":"URL#6230311" }, { "@score":"1", "@id":"6230312", "info":{"authors":{"author":[{"@pid":"34/688","text":"Louis-Martin Rousseau"},{"@pid":"08/5862","text":"Michel Gendreau"},{"@pid":"02/6567","text":"Gilles Pesant"}]},"title":"Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows.","venue":"J. Heuristics","volume":"8","number":"1","pages":"43-58","year":"2002","type":"Journal Articles","access":"closed","key":"journals/heuristics/RousseauGP02","doi":"10.1023/A:1013661617536","ee":"https://doi.org/10.1023/A:1013661617536","url":"https://dblp.org/rec/journals/heuristics/RousseauGP02"}, "url":"URL#6230312" }, { "@score":"1", "@id":"6230313", "info":{"authors":{"author":[{"@pid":"80/898","text":"F. Sibel Salman"},{"@pid":"05/4351","text":"Jayant Kalagnanam"},{"@pid":"64/2147","text":"Sesh Murthy"},{"@pid":"68/5444","text":"Andrew J. Davenport"}]},"title":"Cooperative Strategies for Solving the Bicriteria Sparse Multiple Knapsack Problem.","venue":"J. Heuristics","volume":"8","number":"2","pages":"215-239","year":"2002","type":"Journal Articles","access":"closed","key":"journals/heuristics/SalmanKMD02","doi":"10.1023/A:1017964608086","ee":"https://doi.org/10.1023/A:1017964608086","url":"https://dblp.org/rec/journals/heuristics/SalmanKMD02"}, "url":"URL#6230313" }, { "@score":"1", "@id":"6230314", "info":{"authors":{"author":{"@pid":"11/2305","text":"Prabha Sharma"}},"title":"Permutation Polyhedra and Minimisation of the Variance of Completion Times on a Single Machine.","venue":"J. Heuristics","volume":"8","number":"4","pages":"467-485","year":"2002","type":"Journal Articles","access":"closed","key":"journals/heuristics/Sharma02","doi":"10.1023/A:1015496114938","ee":"https://doi.org/10.1023/A:1015496114938","url":"https://dblp.org/rec/journals/heuristics/Sharma02"}, "url":"URL#6230314" }, { "@score":"1", "@id":"6230315", "info":{"authors":{"author":{"@pid":"74/3045","text":"El-Ghazali Talbi"}},"title":"A Taxonomy of Hybrid Metaheuristics.","venue":"J. Heuristics","volume":"8","number":"5","pages":"541-564","year":"2002","type":"Journal Articles","access":"closed","key":"journals/heuristics/Talbi02","doi":"10.1023/A:1016540724870","ee":"https://doi.org/10.1023/A:1016540724870","url":"https://dblp.org/rec/journals/heuristics/Talbi02"}, "url":"URL#6230315" }, { "@score":"1", "@id":"6230316", "info":{"authors":{"author":[{"@pid":"71/6869","text":"Jorge Valenzuela"},{"@pid":"95/6081","text":"Alice E. Smith"}]},"title":"A Seeded Memetic Algorithm for Large Unit Commitment Problems.","venue":"J. Heuristics","volume":"8","number":"2","pages":"173-195","year":"2002","type":"Journal Articles","access":"closed","key":"journals/heuristics/ValenzuelaS02","doi":"10.1023/A:1017960507177","ee":"https://doi.org/10.1023/A:1017960507177","url":"https://dblp.org/rec/journals/heuristics/ValenzuelaS02"}, "url":"URL#6230316" } ] } } } )