default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Heuristics, Volume 18
Volume 18, Number 1, February 2012
- Salwani Abdullah, Hamza Turabieh
, Barry McCollum, Paul McMullan:
A hybrid metaheuristic approach to the university course timetabling problem. 1-23 - Jens Czogalla, Andreas Fink:
Fitness landscape analysis for the no-wait flow-shop scheduling problem. 25-51 - Pedro M. Mateo, Isolina Alberto:
A mutation operator based on a Pareto ranking for multi-objective evolutionary algorithms. 53-89 - Minghe Sun:
A tabu search heuristic procedure for the capacitated facility location problem. 91-118 - Marco Chiarandini, Luca Di Gaspero, Stefano Gualandi, Andrea Schaerf:
The balanced academic curriculum problem revisited. 119-148 - María Soto, André Rossi, Marc Sevaux:
A mathematical model and a metaheuristic approach for a memory allocation problem. 149-167 - José Santamaría, Oscar Cordón, Sergio Damas, Rafael Martí, Ricardo J. Palma:
GRASP and path relinking hybridizations for the point matching-based image registration problem. 169-192
Volume 18, Number 2, April 2012
- Celso C. Ribeiro, Mauricio G. C. Resende:
Path-relinking intensification methods for stochastic local search algorithms. 193-214 - Boaz Ben-Moshe:
Geometric heuristics for rural radio maps approximation. 215-237 - Sayyed Rasoul Mousavi, Maryam Babaie, Manizheh Montazerian:
An improved heuristic for the far from most strings problem. 239-262 - Matthieu Basseur, Arnaud Liefooghe, Khoi N. Le, Edmund K. Burke:
The efficiency of indicator-based local search for multi-objective combinatorial optimisation problems. 263-296 - Chase Rainwater, Joseph Geunes, H. Edwin Romeijn:
A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand. 297-315 - Arnaud Liefooghe, Jérémie Humeau, Salma Mesmoudi, Laetitia Jourdan, El-Ghazali Talbi:
On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems. 317-352
Volume 18, Number 3, June 2012
- Zeynep Kiziltan, Andrea Lodi, Michela Milano, Fabio Parisini:
Bounding, filtering and diversification in CP-based local branching. 353-374 - Ioannis Minis, Kostas Mamassis, Vasileios Zeimpekis:
Real-time management of vehicle breakdowns in urban freight distribution. 375-400 - Burak Bilgin, Peter Demeester, Mustafa Misir, Wim Vancroonenburg, Greet Vanden Berghe:
One hyper-heuristic approach to two timetabling problems in health care. 401-434 - Alf Kimms, Klaus-Christian Maassen:
Cell-transmission-based evacuation planning with rescue teams. 435-471 - John Larusic, Abraham P. Punnen, Eric Aubanel:
Experimental analysis of heuristics for the bottleneck traveling salesman problem. 473-503 - Mayron César O. Moreira, Marcus Ritt, Alysson M. Costa, Antonio Augusto Chaves:
Simple heuristics for the assembly line worker assignment and balancing problem. 505-524
Volume 18, Number 4, August 2012
- Diogo Vieira Andrade, Mauricio G. C. Resende, Renato Fonseca F. Werneck:
Fast local search for the maximum independent set problem. 525-547 - Tatjana Davidovic, Milica Selmic, Dusan Teodorovic, Dusan Ramljak:
Bee colony optimization for scheduling independent tasks to identical processors. 549-569 - Yun-Chia Liang, Zu-Hsu Lee, Yu-Shen Chen:
A novel ant colony optimization approach for on-line scheduling and due date determination. 571-591 - Adam Kasperski, Mariusz Makuchowski, Pawel Zielinski:
A tabu search algorithm for the minmax regret minimum spanning tree problem with interval data. 593-625 - Luis Pedro Mendes, Pedro Godinho, Joana Dias:
A Forex trading system based on a genetic algorithm. 627-656 - Andréa Cynthia Santos, Christophe Duhamel, Lorena Silva Belisário, Lucas Moreira Guedes:
Strategies for designing energy-efficient clusters-based WSN topologies. 657-675 - Jianli Chen, Wenxing Zhu, Zheng Peng:
A heuristic algorithm for the strip packing problem. 677-697
Volume 18, Number 5, October 2012
- José Antonio Vázquez Rodríguez, Sanja Petrovic:
Calibrating continuous multi-objective heuristics using mixture experiments. 699-726 - Madalina M. Drugan, Dirk Thierens:
Stochastic Pareto local search: Pareto neighbourhood exploration and perturbation strategies. 727-766 - Duc-Cuong Dang, Aziz Moukrim:
Subgraph extraction and metaheuristics for the maximum clique problem. 767-794 - Pedro Larrañaga, Hossein Karshenas, Concha Bielza, Roberto Santana:
A review on probabilistic graphical models in evolutionary computation. 795-819
Volume 18, Number 6, December 2012
- Vikas Goel, Kevin C. Furman, Jin-Hwa Song, Amr S. El-Bakry:
Large neighborhood search for LNG inventory routing. 821-848 - Inmaculada Rodríguez Martín, Juan José Salazar González:
A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem. 849-867 - Stefan Voß, Andreas Fink:
A hybridized tabu search approach for the minimum weight vertex cover problem. 869-876 - Gianfranco Guastaroba, Maria Grazia Speranza:
Kernel search for the capacitated facility location problem. 877-917 - Manuel Lozano, Abraham Duarte, Francisco Gortázar, Rafael Martí:
Variable neighborhood search with ejection chains for the antibandwidth problem. 919-938 - Mauro Dell'Amico, Manuel Iori, Silvano Martello, Michele Monaci:
A note on exact and heuristic algorithms for the identical parallel machine scheduling problem. 939-942
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-21 20:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
