default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Heuristics, Volume 23
Volume 23, Number 1, February 2017
- Min Shi, Shang Gao
:
Reference sharing: a new collaboration model for cooperative coevolution. 1-30 - Laura Anton-Sanchez, Concha Bielza, Pedro Larrañaga:
Network design through forests with degree- and role-constrained minimum spanning trees. 31-51 - Leticia Vargas, Nicolas Jozefowiez, Sandra Ulrich Ngueveu:
A dynamic programming operator for tour location problems applied to the covering tour problem. 53-80
Volume 23, Numbers 2-3, June 2017
- Miguel A. González, Juan José Palacios, Camino R. Vela, Alejandro Hernández-Arauzo:
Scatter search for minimizing weighted tardiness in a single machine scheduling with setups. 81-110 - Raka Jovanovic, Tatsushi Nishi, Stefan Voß:
A heuristic approach for dividing graphs into bi-connected components with a size constraint. 111-136 - Yiyong Xiao, Abdullah Konak:
A variable neighborhood search for the network design problem with relays. 137-164
Volume 23, Number 4, August 2017
- Saïd Hanafi, Raca Todosijevic:
Mathematical programming based heuristics for the 0-1 MIP: a survey. 165-206 - Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck:
Finding near-optimal independent sets at scale. 207-229 - Folarin B. Oyebolu, Jeroen van Lidth de Jeude, Cyrus Siganporia, Suzanne S. Farid, Richard Allmendinger, Jürgen Branke:
A new lot sizing and scheduling heuristic for multi-site biopharmaceutical production. 231-256 - Mangesh S. Gharote, Rahul Patil, Sachin Lodha:
Scatter search for trainees to software project requirements stable allocation. 257-283
Volume 23, Number 5, October 2017
- Audrey Cerqueus, Xavier Gandibleux, Anthony Przybylski, Frédéric Saubion:
On branching heuristics for the bi-objective 0/1 unidimensional knapsack problem. 285-319 - Lin Xie, Marius Merschformann, Natalia Kliewer, Leena Suhl:
Metaheuristics approach for solving personalized crew rostering problem in public bus transit. 321-347 - Jesus Garcia-Diaz, Jairo Javier Sanchez-Hernandez, Ricardo Menchaca-Méndez, Rolando Menchaca-Méndez:
When a worse approximation factor gives better performance: a 3-approximation algorithm for the vertex k-center problem. 349-366 - Haochen Zhang, Shaowei Cai, Chuan Luo, Minghao Yin:
An efficient local search algorithm for the winner determination problem. 367-396 - Luis Montiel, Roussos G. Dimitrakopoulos:
A heuristic approach for the stochastic optimization of mine production schedules. 397-415
Volume 23, Number 6, December 2017
- Nicholas T. Boardman, Brian J. Lunday, Matthew J. Robbins:
Heterogeneous surface-to-air missile defense battery location: a game theoretic approach. 417-447 - Emile Glorieux, Bo Svensson, Fredrik Danielsson, Bengt Lennartson:
Constructive cooperative coevolution for large-scale global optimisation. 449-469 - Fulin Xie, Chris N. Potts, Tolga Bektas:
Iterated local search for workforce scheduling and routing problems. 471-500 - Md. Masbaul Alam, M. A. Hakim Newton, Abdul Sattar:
Constraint-based search for optimal Golomb rulers. 501-532 - Haroldo de Faria Jr., Mauricio G. C. Resende, Damien Ernst:
A biased random key genetic algorithm applied to the electric distribution network reconfiguration problem. 533-550
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-08-11 00:22 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.
