• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 35 matches

• 2021
• 
  Mohamed Abouhawwash, Kalyanmoy Deb:
  Reference point based evolutionary multi-objective optimization algorithms with convergence properties using KKTPM and ASF metrics. J. Heuristics 27(4): 575-614 (2021)
• 
  Mohammad Mahdi Ahmadian, Amir Salehipour:
  The just-in-time job-shop scheduling problem with distinct due-dates for operations. J. Heuristics 27(1-2): 175-204 (2021)
• 
  Heber F. Amaral, Sebastián Urrutia, Lars Magnus Hvattum:
  Delayed improvement local search. J. Heuristics 27(5): 923-950 (2021)
• 
  Andrei M. Bandalouski, Natalja G. Egorova, Mikhail Y. Kovalyov, Erwin Pesch, S. Armagan Tarim:
  Dynamic pricing with demand disaggregation for hotel revenue management. J. Heuristics 27(5): 869-885 (2021)
• 
  Francisco Castillo-Zunino, Pinar Keskinocak:
  Bi-criteria multiple knapsack problem with grouped items. J. Heuristics 27(5): 747-789 (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. J. Heuristics 27(3): 267-301 (2021)
• 
  Reshma Chirayil Chandrasekharan, Pieter Smet, Tony Wauters:
  An automatic constructive matheuristic for the shift minimization personnel task scheduling problem. J. Heuristics 27(1-2): 205-227 (2021)
• 
  Federico Della Croce, Andrea Grosso, Fabio Salassa:
  Minimizing total completion time in the two-machine no-idle no-wait flow shop problem. J. Heuristics 27(1-2): 159-173 (2021)
• 
  Nicolas Dupin, El-Ghazali Talbi:
  Matheuristics to optimize refueling and maintenance planning of nuclear power plants. J. Heuristics 27(1-2): 63-105 (2021)
• 
  Javier Ferrer, Francisco Chicano, José Antonio Ortega-Toro:
  CMSA algorithm for solving the prioritized pairwise test data generation problem in software product lines. J. Heuristics 27(1-2): 229-249 (2021)
• 
  Michele Garraffa, Deepak Mehta, Barry O'Sullivan, Cemalettin Ozturk, Luis Quesada:
  An adaptive large neighbourhood search algorithm for diameter bounded network design problems. J. Heuristics 27(5): 887-922 (2021)
• 
  Philippe Grangier, Michel Gendreau, Fabien Lehuédé, Louis-Martin Rousseau:
  The vehicle routing problem with cross-docking and resource constraints. J. Heuristics 27(1-2): 31-61 (2021)
• 
  Monique Guignard, Aykut Ahlatçioglu:
  The convex hull heuristic for nonlinear integer programming problems with linear constraints and application to quadratic 0-1 problems. J. Heuristics 27(1-2): 251-265 (2021)
• 
  Djamal Habet, Cyril Terrioux:
  Conflict history based heuristic for constraint satisfaction problem solving. J. Heuristics 27(6): 951-990 (2021)
• 
  Song Jiu:
  A two-phase approach for integrating preventive maintenance with production and delivery in an unreliable coal mine. J. Heuristics 27(6): 991-1020 (2021)
• 
  Taichi Kaji:
  A probabilistic analysis of neighborhoods for combinatorial optimization problems and its application. J. Heuristics 27(6): 1057-1079 (2021)
• 
  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. J. Heuristics 27(6): 1111-1150 (2021)
• 
  Yannick Kergosien, Jorge E. Mendoza, Vincent T'kindt:
  Special issue on matheuristics. J. Heuristics 27(1-2): 1-3 (2021)
• 
  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. J. Heuristics 27(1-2): 107-132 (2021)
• 
  François Lamothe, Emmanuel Rachelson, Alain Haït, Cédric Baudoin, Jean-Baptiste Dupe:
  Randomized rounding algorithms for large scale unsplittable flow problems. J. Heuristics 27(6): 1081-1110 (2021)
• 
  Mark W. Lewis, Amit Verma, Todd T. Eckdahl:
  Qfold: a new modeling paradigm for the RNA folding problem. J. Heuristics 27(4): 695-717 (2021)
• 
  Stephen J. Maher:
  Enhancing large neighbourhood search heuristics for Benders' decomposition. J. Heuristics 27(4): 615-648 (2021)
• 
  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. J. Heuristics 27(4): 549-573 (2021)
• 
  Pablo Moscato, Luke Mathieson, Mohammad Nazmul Haque:
  Augmented intuition: a bridge between theory and practice. J. Heuristics 27(4): 497-547 (2021)
• 
  Fredrik Ødegaard, Sudipendra Nath Roy:
  Heuristic-based allocation of supply constrained blood platelets in emerging economies. J. Heuristics 27(5): 719-745 (2021)
• 
  Venkatesh Pandiri, Alok Singh:
  A simple hyper-heuristic approach for a variant of many-to-many hub location-routing problem. J. Heuristics 27(5): 791-868 (2021)
• 
  Wayne Pullan:
  Local search for the maximum k-plex problem. J. Heuristics 27(3): 303-324 (2021)
• 
  Eduardo Queiroga, Rian G. S. Pinheiro, Quentin Christ, Anand Subramanian, Artur Alves Pessoa:
  Iterated local search for single machine total weighted tardiness batch scheduling. J. Heuristics 27(3): 353-438 (2021)
• 
  Filipe Rodrigues, Agostinho Agra, Lars Magnus Hvattum, Cristina Requejo:
  Weighted proximity search. J. Heuristics 27(3): 459-496 (2021)
• 
  André Rossi, Alok Singh, Marc Sevaux:
  Focus distance-aware lifetime maximization of video camera-based wireless sensor networks. J. Heuristics 27(1-2): 5-30 (2021)

skipping 5 more matches