default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Heuristics, Volume 26
Volume 26, Number 1, February 2020
- Weili Zhang, Charles D. Nicholson
:
Objective scaling ensemble approach for integer linear programming. 1-19 - Adam N. Letchford, Qiang Ni, Zhaoyu Zhong:
A heuristic for fair dynamic resource allocation in overloaded OFDMA systems. 21-32 - Ling Liu, Wenli Li, Kunpeng Li, Xuxia Zou:
A coordinated production and transportation scheduling problem with minimum sum of order delivery times. 33-58 - Karla B. Freitas, Márcio da Silva Arantes, Claudio Fabiano Motta Toledo, Alexandre C. B. Delbem:
MIQP model and improvement heuristic for power loss minimization in distribution system with network reconfiguration. 59-81 - Mohamed Amine Masmoudi, Manar Hosny, Emrah Demir, Erwin Pesch:
Hybrid adaptive large neighborhood search algorithm for the mixed fleet heterogeneous dial-a-ride problem. 83-118 - Takfarinas Saber, Xavier Gandibleux, Michael O'Neill, Liam Murphy, Anthony Ventresque:
A comparative study of multi-objective machine reassignment algorithms for data centres. 119-150
Volume 26, Number 2, April 2020
- Ankur Sinha, Zhichao Lu, Kalyanmoy Deb, Pekka Malo:
Bilevel optimization based on iterative approximation of multiple mappings. 151-185 - Luis Ernesto Flores Luyo, Agostinho Agra, Rosa Figueiredo, Eladio Ocaña Anaya:
Heuristics for a vehicle routing problem with information collection in wireless networks. 187-217 - Quang Minh Ha, Yves Deville, Pham Quang Dung, Minh Hoàng Hà:
A hybrid genetic algorithm for the traveling salesman problem with drone. 219-247 - Eduardo G. Pardo, Antonio García-Sánchez, Marc Sevaux, Abraham Duarte:
Basic variable neighborhood search for the minimum sitting arrangement problem. 249-268 - Gleb Belov, Natashia L. Boland, Martin W. P. Savelsbergh, Peter J. Stuckey:
Logistics optimization for a coal supply chain. 269-300 - Hyun Jun Yang, Suk Jae Jeong, Sung Wook Yoon:
Enhancement for human resource management in the ULD build-up process of air-cargo terminal: a strategic linkage approach. 301-333
Volume 26, Number 3, June 2020
- Abraham Duarte, Eduardo G. Pardo:
Special issue on recent innovations in variable neighborhood search. 335-338 - Shahin Gelareh, Bernard Gendron, Saïd Hanafi, Rahimeh Neamatian Monemi, Raca Todosijevic:
The selective traveling salesman problem with draft limits. 339-352 - Javier Panadero, Jana Doering, Renatas Kizys, Angel A. Juan, Angels Fito:
A variable neighborhood search simheuristic for project portfolio selection under uncertainty. 353-375 - Marko Mladenovic, Thierry Delot, Gilbert Laporte, Christophe Wilbaut:
The parking allocation problem for connected vehicles. 377-399 - Lorena S. Reyes-Rubiano, Laura Calvet, Angel A. Juan, Javier Faulin, Lluc Bové:
A biased-randomized variable neighborhood search for sustainable multi-depot vehicle routing problems. 401-422 - Jesús Sánchez-Oro, Ana Dolores López-Sánchez, J. Manuel Colmenar:
A general variable neighborhood search for solving the multi-objective open vehicle routing problem. 423-452
Volume 26, Number 4, August 2020
- Hongbo Li, Guozhong Feng, Minghao Yin:
On combining variable ordering heuristics for constraint satisfaction problems. 453-474 - Naoto Katayama:
MIP neighborhood search heuristics for a service network design problem with design-balanced requirements. 475-502 - Luitpold Babel:
New heuristic algorithms for the Dubins traveling salesman problem. 503-530 - Marko Spoljarec, Robert Manger:
Heuristic solutions to robust variants of the minimum-cost integer flow problem. 531-559 - Rodica Ioana Lung, Noémi Gaskó, Mihai Alexandru Suciu:
Pareto-based evolutionary multiobjective approaches and the generalized Nash equilibrium problem. 561-584 - Santiago Valdés Ravelo, Cláudio N. Meneses, Maristela Oliveira Santos:
Meta-heuristics for the one-dimensional cutting stock problem with usable leftover. 585-618
Volume 26, Number 5, October 2020
- Joaquín A. Pacheco, Manuel Laguna:
Vehicle routing for the urgent delivery of face shields during the COVID-19 pandemic. 619-635 - Yu Fu, Amarnath Banerjee:
Heuristic/meta-heuristic methods for restricted bin packing problem. 637-662 - Sami Mnasri, Nejah Nasri, Malek Q. Alrashidi, Adrien van den Bossche, Thierry Val:
IoT networks 3D deployment using hybrid many-objective optimization algorithms. 663-709 - Daniel Porumbel, Jin-Kao Hao:
Distance-guided local search. 711-741 - Jorik Jooken, Pieter Leyman, Patrick De Causmaecker:
A multi-start local search algorithm for the Hamiltonian completion problem on undirected graphs. 743-769 - Orlando Moreira, Merten Popp, Christian Schulz:
Evolutionary multi-level acyclic graph partitioning. 771-799
Volume 26, Number 6, December 2020
- Stefan Kuhlemann, Kevin Tierney:
A genetic algorithm for finding realistic sea routes considering the weather. 801-825 - Stefan Kuhlemann, Kevin Tierney:
Correction to: A genetic algorithm for finding realistic sea routes considering the weather. 827 - Alain Hertz, Thomas Ridremont:
A tabu search for the design of capacitated rooted survivable planar networks. 829-850 - Felipe Campelo, Elizabeth F. Wanner:
Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances. 851-883 - Jone R. Hansen, Kjetil Fagerholt, Magnus Stålhane, Jørgen Glomvik Rakke:
An adaptive large neighborhood search heuristic for the planar storage location assignment problem: application to stowage planning for Roll-on Roll-off ships. 885-912 - Fabio C. S. Dias, Wladimir Araujo Tavares, José Robertty de Freitas Costa:
Reactive VNS algorithm for the maximum k-subset intersection problem. 913-941
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-12-01 23:12 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:
