default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Heuristics, Volume 24
Volume 24, Number 1, February 2018
- Laurent Moalic
, Alexandre Gondran:
Variations on memetic algorithms for graph coloring problems. 1-24 - Marcella S. R. Martins, Myriam Regattieri Delgado, Ricardo Lüders, Roberto Santana, Richard A. Gonçalves, Carolina P. de Almeida:
Hybrid multi-objective Bayesian estimation of distribution algorithm: a comparative analysis for the multi-objective knapsack problem. 25-47 - Alexander Biele, Lars Mönch:
Hybrid approaches to optimize mixed-model assembly lines in low-volume manufacturing. 49-81 - Douglas G. Macharet, Armando Alves Neto, Vilar Fiuza da Camara Neto, Mario F. M. Campos:
Dynamic region visit routing problem for vehicles with minimum turning radius. 83-109
Volume 24, Number 2, April 2018
- Julián Molina Luque, A. D. López-Sánchez, Alfredo García Hernández-Díaz, Iris Martínez-Salazar:
A Multi-start Algorithm with Intelligent Neighborhood Selection for solving multi-objective humanitarian vehicle routing problems. 111-133 - Madalina M. Drugan:
Scaling-up many-objective combinatorial optimization with Cartesian products of scalarization functions. 135-172 - Alexander Lawrinenko, Stefan Schwerdfeger, Rico Walter:
Reduction criteria, upper bounds, and a dynamic programming based heuristic for the max-min ki -partitioning problem. 173-203 - Guillermo Cabrera-Guerrero, Andrew J. Mason, Andrea Raith, Matthias Ehrgott:
Pareto local search algorithms for the multi-objective beam angle optimisation problem. 205-238
Volume 24, Number 3, June 2018
- Bin Hu, Francisco Chicano:
Editorial for the special issue on metaheuristics for combinatorial optimization. 239-242 - Sebastian Herrmann, Gabriela Ochoa, Franz Rothlauf:
PageRank centrality for performance prediction: the impact of the local optima network model. 243-264 - Gabriela Ochoa, Nadarajen Veerapen:
Mapping the global structure of TSP fitness landscapes. 265-294 - Markus Wagner, Marius Lindauer, Mustafa Misir, Samadhi Nallaperuma, Frank Hutter:
A case study of algorithm selection for the traveling thief problem. 295-320 - Bradley Hardy, Rhyd Lewis, Jonathan M. Thompson:
Tackling the edge dynamic graph colouring problem with and without future adjacency information. 321-343 - Roberto Aringhieri, Davide Duma, Andrea Grosso, Pierre Hosteins:
Simple but effective heuristics for the 2-constraint bin packing problem. 345-357 - Alejandro Arbelaez, Deepak Mehta, Barry O'Sullivan, Luis Quesada:
A constraint-based parallel local search for the edge-disjoint rooted distance-constrained minimum spanning tree problem. 359-394 - Pavel Troubil, Hana Rudová, Petr Holub:
Dynamic reconfiguration in multigroup multicast routing under uncertainty. 395-423 - Alexandre Sawczuk da Silva, Yi Mei, Hui Ma, Mengjie Zhang:
Evolutionary computation for automatic Web service composition: an indirect representation approach. 425-456 - Stjepan Picek, Carlos A. Coello Coello, Domagoj Jakobovic, Nele Mentens:
Finding short and implementation-friendly addition chains with evolutionary algorithms. 457-481 - Carlos Cotta, José E. Gallardo:
Metaheuristic approaches to the placement of suicide bomber detectors. 483-513 - Sandra Zajac:
On a two-phase solution approach for the bi-objective k-dissimilar vehicle routing problem. 515-550 - Christian Blum, Maria J. Blesa:
A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem. 551-579
Volume 24, Number 4, August 2018
- Olacir R. Castro Jr., Gian Mauricio Fritsche, Aurora T. R. Pozo:
Evaluating selection methods on hyper-heuristic multi-objective particle swarm optimization. 581-616 - Mehmet Berkehan Akçay, Hüseyin Akcan, Cem Evrendilek:
All Colors Shortest Path problem on trees. 617-644 - Michael Lindahl, Matias Sørensen, Thomas R. Stidsen:
A fix-and-optimize matheuristic for university timetabling. 645-665 - Renatha Capua, Yuri Frota, Luiz Satoru Ochi, Thibaut Vidal:
A study on exponential-size neighborhoods for the bin packing problem with conflicts. 667-695
Volume 24, Number 5, October 2018
- Benjamin Byholm, Ivan Porres:
Fast algorithms for fragmentable items bin packing. 697-723 - Piotr Faliszewski, Arkadii Slinko, Kolja Stahl, Nimrod Talmon:
Achieving fully proportional representation by clustering voters. 725-756 - Frederico R. B. Cruz, Anderson Ribeiro Duarte, Guido Lemos de Souza Filho:
Multi-objective performance improvements of general finite single-server queueing networks. 757-781 - Alberto Santini, Stefan Ropke, Lars Magnus Hvattum:
A comparison of acceptance criteria for the adaptive large neighbourhood search metaheuristic. 783-815
Volume 24, Number 6, December 2018
- Andreas C. Nearchou:
Multicriteria scheduling optimization using an elitist multiobjective population heuristic: the h-NSDE algorithm. 817-851 - Aymeric Blot, Marie-Eléonore Marmion, Laetitia Jourdan:
Survey and unification of local search techniques in metaheuristics for multi-objective combinatorial optimisation. 853-877 - Zongxu Mu, Jérémie Dubois-Lacoste, Holger H. Hoos, Thomas Stützle:
On the empirical scaling of running time for finding optimal solutions to the TSP. 879-898 - Anne Ehleiter, Florian Jaehn:
Scheduling crossover cranes at container terminals during seaside peak times. 899-932
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-09-21 23:28 CEST 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:
