default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Heuristics, Volume 27
Volume 27, Number 1-2, April 2021
- Yannick Kergosien, Jorge E. Mendoza, Vincent T'kindt:
Special issue on matheuristics. 1-3 - André Rossi
, Alok Singh, Marc Sevaux:
Focus distance-aware lifetime maximization of video camera-based wireless sensor networks. 5-30 - Philippe Grangier, Michel Gendreau, Fabien Lehuédé, Louis-Martin Rousseau:
The vehicle routing problem with cross-docking and resource constraints. 31-61 - Nicolas Dupin, El-Ghazali Talbi:
Matheuristics to optimize refueling and maintenance planning of nuclear power plants. 63-105 - Youssef Lahrichi, Laurent Deroussi, Nathalie Grangeon, Sylvie Norre:
A balance-first sequence-last algorithm to design RMS: a matheuristic with performance guaranty to balance reconfigurable manufacturing systems. 107-132 - Fan Yang, Roel Leus:
Scheduling hybrid flow shops with time windows. 133-158 - Federico Della Croce, Andrea Grosso, Fabio Salassa:
Minimizing total completion time in the two-machine no-idle no-wait flow shop problem. 159-173 - Mohammad Mahdi Ahmadian, Amir Salehipour:
The just-in-time job-shop scheduling problem with distinct due-dates for operations. 175-204 - Reshma Chirayil Chandrasekharan, Pieter Smet, Tony Wauters:
An automatic constructive matheuristic for the shift minimization personnel task scheduling problem. 205-227 - Javier Ferrer, Francisco Chicano, José Antonio Ortega-Toro:
CMSA algorithm for solving the prioritized pairwise test data generation problem in software product lines. 229-249 - Monique Guignard, Aykut Ahlatçioglu:
The convex hull heuristic for nonlinear integer programming problems with linear constraints and application to quadratic 0-1 problems. 251-265
Volume 27, Number 3, June 2021
- Jonatas B. C. Chagas, Julian Blank, Markus Wagner, Marcone J. F. Souza, Kalyanmoy Deb:
A non-dominated sorting based customized random-key genetic algorithm for the bi-objective traveling thief problem. 267-301 - Wayne Pullan:
Local search for the maximum k-plex problem. 303-324 - Fatemeh Sarayloo, Teodor Gabriel Crainic, Walter Rei:
A reduced cost-based restriction and refinement matheuristic for stochastic network design problem. 325-351 - Eduardo Queiroga, Rian G. S. Pinheiro, Quentin Christ, Anand Subramanian, Artur Alves Pessoa:
Iterated local search for single machine total weighted tardiness batch scheduling. 353-438 - Hoang Huu Viet, Nguyen Thi Uyen, SeungGwan Lee, TaeChoong Chung, Le Hong Trang:
A max-conflicts based heuristic search for the stable marriage problem with ties and incomplete lists. 439-458 - Filipe Rodrigues, Agostinho Agra, Lars Magnus Hvattum, Cristina Requejo:
Weighted proximity search. 459-496
Volume 27, Number 4, August 2021
- Pablo Moscato, Luke Mathieson, Mohammad Nazmul Haque:
Augmented intuition: a bridge between theory and practice. 497-547 - Marcella S. R. Martins, Mohamed El Yafrani, Myriam Regattieri Delgado, Ricardo Lüders, Roberto Santana, Hugo Valadares Siqueira, Huseyin Gokhan Akcay, Belaïd Ahiod:
Analysis of Bayesian Network Learning Techniques for a Hybrid Multi-objective Bayesian Estimation of Distribution Algorithm: a case study on MNK Landscape. 549-573 - Mohamed Abouhawwash, Kalyanmoy Deb:
Reference point based evolutionary multi-objective optimization algorithms with convergence properties using KKTPM and ASF metrics. 575-614 - Stephen J. Maher:
Enhancing large neighbourhood search heuristics for Benders' decomposition. 615-648 - Renata Turkes, Kenneth Sörensen, Daniel Palhazi Cuervo:
A matheuristic for the stochastic facility location problem. 649-694 - Mark W. Lewis, Amit Verma, Todd T. Eckdahl:
Qfold: a new modeling paradigm for the RNA folding problem. 695-717
Volume 27, Number 5, October 2021
- Fredrik Ødegaard, Sudipendra Nath Roy:
Heuristic-based allocation of supply constrained blood platelets in emerging economies. 719-745 - Francisco Castillo-Zunino, Pinar Keskinocak:
Bi-criteria multiple knapsack problem with grouped items. 747-789 - Venkatesh Pandiri, Alok Singh:
A simple hyper-heuristic approach for a variant of many-to-many hub location-routing problem. 791-868 - Andrei M. Bandalouski, Natalja G. Egorova, Mikhail Y. Kovalyov, Erwin Pesch, S. Armagan Tarim:
Dynamic pricing with demand disaggregation for hotel revenue management. 869-885 - Michele Garraffa, Deepak Mehta, Barry O'Sullivan, Cemalettin Ozturk, Luis Quesada:
An adaptive large neighbourhood search algorithm for diameter bounded network design problems. 887-922 - Heber F. Amaral, Sebastián Urrutia, Lars Magnus Hvattum:
Delayed improvement local search. 923-950
Volume 27, Number 6, December 2021
- Djamal Habet, Cyril Terrioux:
Conflict history based heuristic for constraint satisfaction problem solving. 951-990 - Song Jiu:
A two-phase approach for integrating preventive maintenance with production and delivery in an unreliable coal mine. 991-1020 - Ofer M. Shir, Xi Xing, Herschel Rabitz:
Multi-level evolution strategies for high-resolution black-box control. 1021-1055 - Taichi Kaji:
A probabilistic analysis of neighborhoods for combinatorial optimization problems and its application. 1057-1079 - François Lamothe, Emmanuel Rachelson, Alain Haït, Cédric Baudoin, Jean-Baptiste Dupe:
Randomized rounding algorithms for large scale unsplittable flow problems. 1081-1110 - Fernanda Nakano Kazama, Aluízio Fausto Ribeiro Araújo, Paulo de Barros Correia, Elaine Guerrero-Peña:
Constraint-guided evolutionary algorithm for solving the winner determination problem. 1111-1150
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-11-21 20:33 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:
