default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Heuristics, Volume 19
Volume 19, Number 1, February 2013
- Marta S. R. Monteiro, Dalila B. M. M. Fontes
, Fernando A. C. C. Fontes:
Concave minimum cost network flow problems solved with a colony of ants. 1-33 - Julien Lepagnot, Amir Nakib, Hamouche Oulhadj, Patrick Siarry:
A multiple local search algorithm for continuous dynamic optimization. 35-76 - Juan A. Díaz, Dolores E. Luna, Carlos Armando Zetina:
A hybrid algorithm for the manufacturing cell formation problem. 77-96
Volume 19, Number 2, April 2013
- Belén Melián-Batista, José A. Moreno-Pérez:
Introduction to the special issue on intelligent metaheuristics for logistic planning. 97-101 - Julio Mar-Ortiz, José Luis González Velarde, Belarmino Adenso-Díaz:
Designing routes for WEEE collection: the vehicle routing problem with split loads and date windows. 103-127 - Vera C. Hemmelmayr, Karl F. Doerner, Richard F. Hartl, Stefan Rath:
A heuristic solution method for node routing based solid waste collection problems. 129-156 - Irma García, Joaquín A. Pacheco, Ada M. Alvarez:
Optimizing routes and stock. 157-177 - M. Angélica Salazar-Aguilar, Roger Z. Ríos-Mercado, José Luis González Velarde:
GRASP strategies for a bi-objective commercial territory design problem. 179-200 - Puca Huachi Vaz Penna, Anand Subramanian, Luiz Satoru Ochi:
An Iterated Local Search heuristic for the Heterogeneous Fleet Vehicle Routing Problem. 201-232 - Jair J. De la Cruz, Carlos D. Paternina-Arboleda, Víctor Cantillo, Jairo R. Montoya-Torres:
A two-pheromone trail ant colony system - tabu search approach for the heterogeneous vehicle routing problem with time windows and multiple products. 233-252 - Carlos Gracia, Carlos Andrés, Luis Gracia:
A hybrid approach based on genetic algorithms to solve the problem of cutting structural beams in a metalwork company. 253-273 - Sara Ceschia, Andrea Schaerf:
Local search for a multi-drop multi-container loading problem. 275-294 - Marco Caserta, Stefan Voß:
A MIP-based framework and its application on a lot sizing problem with setup carryover. 295-316 - Rong Qu, Ying Xu, Juan P. Castro, Dario Landa-Silva:
Particle swarm optimization for the Steiner tree in graph and delay-constrained multicast routing problems. 317-342 - Julián Aráoz, Elena Fernández, Carles Franquesa:
GRASP and Path Relinking for the Clustered Prize-collecting Arc Routing Problem. 343-371 - Deniz Aksen, Necati Aras, Nuray Piyade:
A Bilevel p-median model for the planning and protection of critical facilities. 373-398 - Bosco García-Archilla, Antonio J. Lozano, Juan A. Mesa, Federico Perea:
GRASP algorithms for the robust railway network design problem. 399-422
Volume 19, Number 3, June 2013
- Maria Elena Bruni, Patrizia Beraldi, Demetrio Laganà:
The Express heuristic for probabilistically constrained integer problems. 423-441 - Marta Szachniuk, Mikolaj Malaczynski, Erwin Pesch, Edmund K. Burke, Jacek Blazewicz:
MLP accompanied beam search for the resonance assignment problem. 443-464 - Simon Kristiansen, Matias Sørensen, Michael B. Herold, Thomas R. Stidsen:
The consultation timetabling problem at Danish high schools. 465-495 - Alireza Rahimi-Vahed, Teodor Gabriel Crainic, Michel Gendreau, Walter Rei:
A path relinking algorithm for a multi-depot periodic vehicle routing problem. 497-524
Volume 19, Number 4, August 2013
- Gary A. Kochenberger, Fred W. Glover:
Introduction to special xQx issue. 525-528 - Fan Wang, Zhou Xu:
Metaheuristics for robust graph coloring. 529-548 - Jelle Duives, Andrea Lodi, Enrico Malaguti:
Test-assignment: a quadratic coloring problem. 549-564 - Gary A. Kochenberger, Jin-Kao Hao, Zhipeng Lü, Haibo Wang, Fred W. Glover:
Solving large scale Max Cut problems via tabu search. 565-571 - Ruonan Zhang, Abraham P. Punnen:
Quadratic bottleneck knapsack problems. 573-589 - Rafael Martí, Micael Gallego, Abraham Duarte, Eduardo G. Pardo:
Heuristics and metaheuristics for the maximum diversity problem. 591-615 - Ilias S. Kotsireas, Panos M. Pardalos:
D-optimal matrices via quadratic integer optimization. 617-627 - Foad Mahdavi Pajouh, Balabhaskar Balasundaram, Oleg A. Prokopyev:
On characterization of maximal independent sets via quadratic optimization. 629-644 - Saïd Hanafi, Ahmed Riadh Rebai, Michel Vasquez:
Several versions of the devour digest tidy-up heuristic for unconstrained binary quadratic problems. 645-677 - Yang Wang, Zhipeng Lü, Fred W. Glover, Jin-Kao Hao:
Backbone guided tabu search for solving the UBQP problem. 679-695 - Sergiy Butenko, Oleksandra Yezerska, Balabhaskar Balasundaram:
Variable objective search. 697-709 - Francisco Chicano, Enrique Alba:
Elementary landscape decomposition of the 0-1 unconstrained quadratic optimization. 711-728
Volume 19, Number 5, October 2013
- Jun He, Pierre Flener, Justin Pearson:
Underestimating the cost of a soft constraint is dangerous: revisiting the edit-distance based soft regular constraint. 729-756 - Duc Minh Vu, Teodor Gabriel Crainic, Michel Toulouse:
A three-phase matheuristic for capacitated multi-commodity fixed-cost network design with design-balance constraints. 757-795 - Philippe Galinier, Eunice Adjarath Lemamou, Mohamed Wassim Bouzidi:
Applying local search to the feedback vertex set problem. 797-818 - Roland Olsson, Arne Løkketangen:
Using automatic programming to generate state-of-the-art algorithms for random 3-SAT. 819-844
Volume 19, Number 6, December 2013
- Luis F. Morán-Mirabal, José Luis González Velarde, Mauricio G. C. Resende, Ricardo M. A. Silva:
Randomized heuristics for handover minimization in mobility networks. 845-880 - Jérémie Humeau, Arnaud Liefooghe, El-Ghazali Talbi, Sébastien Vérel:
ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms. 881-915 - Selvaprabu Nadarajah, James H. Bookbinder:
Less-Than-Truckload carrier collaboration problem: modeling framework and solution approach. 917-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 2025-11-28 23:56 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:
