default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Heuristics, Volume 20
Volume 20, Number 1, February 2014
- Claudio Contardo
, Jean-François Cordeau, Bernard Gendron:
A GRASP + ILP-based metaheuristic for the capacitated location-routing problem. 1-38 - Alexandre Plastino, Hugo Barbalho, Luis Filipe M. Santos, Richard Fuchshuber, Simone L. Martins:
Adaptive and multi-mining versions of the DM-GRASP hybrid metaheuristic. 39-74 - Ulrich Derigs, Ulrich Vogel:
Experience with a framework for developing heuristics for solving rich vehicle routing problems. 75-106 - Gerold Jäger, Changxing Dong, Boris Goldengorin, Paul Molitor, Dirk Richter:
A backbone based TSP heuristic for large instances. 107-124
Volume 20, Number 2, April 2014
- Ravi Kothari, Diptesh Ghosh:
A scatter search algorithm for the single row facility layout problem. 125-142 - Nehme Bilal, Philippe Galinier, François Guibault:
An iterated-tabu-search heuristic for a variant of the partial set covering problem. 143-164 - Thibaut Lust, Daniel Tuyttens:
Variable and large neighborhood search to solve the multiobjective set covering problem. 165-188 - Maria Gisela Dorzán, Mario Guillermo Leguizamón, Efrén Mezura-Montes, Gregorio Hernández-Peñalver:
Approximated algorithms for the minimum dilation triangulation problem. 189-209 - David Bergman, André A. Ciré, Willem Jan van Hoeve, Tallys H. Yunes:
BDD-based heuristics for binary optimization. 211-234
Volume 20, Number 3, June 2014
- Slim Daoud, Hicham Chehade, Farouk Yalaoui, Lionel Amodeo:
Solving a robotic assembly line balancing problem using efficient hybrid methods. 235-259 - Oana Stan, Renaud Sirdey, Jacques Carlier, Dritan Nace:
The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks. 261-290 - Damianos Gavalas, Charalampos Konstantopoulos, Konstantinos Mastakas, Grammati E. Pantziou:
A survey on algorithmic approaches for solving tourist trip design problems. 291-328 - Angela P. Giddings, Ronald L. Rardin, Reha Uzsoy:
Statistical optimum estimation techniques for combinatorial optimization problems: a review and critique. 329-358
Volume 20, Number 4, August 2014
- David L. Woodruff:
Arne Løkketangen: February 2, 1954-June 10, 2013. 359-360 - Jorge Oyola, Arne Løkketangen:
GRASP-ASP: An algorithm for the CVRP with route balancing. 361-382 - Phuong Khanh Nguyen, Teodor Gabriel Crainic, Michel Toulouse:
A hybrid generational genetic algorithm for the periodic vehicle routing problem with time windows. 383-416 - Mohammad Reza Bonyadi, Zbigniew Michalewicz, Xiaodong Li:
An analysis of the velocity updating rule of the particle swarm optimization algorithm. 417-452 - Minyi Li, Quoc Bao Vo, Ryszard Kowalczyk:
A distributed social choice protocol for combinatorial domains. 453-481
Volume 20, Number 5, October 2014
- John Willmer Escobar, Rodrigo Linfati, Paolo Toth, María G. Baldoquín:
A hybrid Granular Tabu Search algorithm for the Multi-Depot Vehicle Routing Problem. 483-509 - Eray Cakici, Scott J. Mason, H. Neil Geismar, John W. Fowler:
Scheduling parallel machines with single vehicle delivery. 511-537 - Jørgen Thorlund Haahr, Thomas R. Stidsen, Martin Zachariasen:
Heuristic methods for single link shared backup path protection. 539-560 - Maciej Drozdowski, Dawid Kowalski, Jan Mizgajski, Dariusz Mokwa, Grzegorz Pawlak:
Mind the gap: a heuristic study of subway tours. 561-587 - Zhilei Ren, He Jiang, Shuwei Zhang, Jingxuan Zhang, Zhongxuan Luo:
Boosting local search with Lagrangian relaxation. 589-615
Volume 20, Number 6, December 2014
- María Arsuaga-Ríos, Miguel A. Vega-Rodríguez:
Swarm approach based on gravity for optimizing energy savings in grid systems. 617-641 - Dhananjay R. Thiruvady, Mark Wallace, Hanyu Gu, Andreas Schutt:
A Lagrangian relaxation and ACO hybrid for resource constrained project scheduling with discounted cash flows. 643-676 - Glaydston Mattos Ribeiro, Guy Desaulniers, Jacques Desrosiers, Thibaut Vidal, Bruno Salezze Vieira:
Efficient heuristics for the workover rig routing problem with a heterogeneous fleet and a finite horizon. 677-708 - Matteo Fischetti, Michele Monaci:
Proximity search for 0-1 mixed-integer convex programming. 709-731
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 2026-09-01 03:25 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
