• 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 23 matches

• 2006
• 
  Ramón Alvarez-Valdés, Enric Crespo, José Manuel Tamarit, Fulgencia Villa:
  A scatter search algorithm for project scheduling under partially renewable resources. J. Heuristics 12(1-2): 95-113 (2006)
• 
  Daniela Ambrosino, Anna Sciomachen, Elena Tanfani:
  A decomposition heuristics for the container ship stowage problem. J. Heuristics 12(3): 211-233 (2006)
• 
  Tobias Andersson Granberg:
  Solving the flight perturbation problem with meta heuristics. J. Heuristics 12(1-2): 37-53 (2006)
• 
  Josep Argelich, Felip Manyà:
  Exact Max-SAT solvers for over-constrained problems. J. Heuristics 12(4-5): 375-392 (2006)
• 
  Vinícius Amaral Armentano, Olinto César Bassi de Araújo:
  Grasp with memory-based mechanisms for minimizing total tardiness in single machine scheduling with setup times. J. Heuristics 12(6): 427-446 (2006)
• 
  Stefano Bistarelli, Francesca Rossi:
  Editorial. J. Heuristics 12(4-5): 239-240 (2006)
• 
  Robert J. Cimikowski:
  An analysis of some linear graph layout heuristics. J. Heuristics 12(3): 143-153 (2006)
• 
  Oscar Cordón, Sergio Damas:
  Image registration with iterated local search. J. Heuristics 12(1-2): 73-94 (2006)
• 
  Carmel Domshlak, Steven D. Prestwich, Francesca Rossi, Kristen Brent Venable, Toby Walsh:
  Hard and soft constraints for reasoning about qualitative conditional preferences. J. Heuristics 12(4-5): 263-285 (2006)
• 
  Özlem Ergun, James B. Orlin, Abran Steele-Feldman:
  Creating very large scale neighborhoods out of smaller ones by compounding moves. J. Heuristics 12(1-2): 115-140 (2006)
• 
  Joaquín Lopez Fernández, Rafael Sanz, Reid G. Simmons, Amador R. Diéguez:
  Heuristic anytime approaches to stochastic decision processes. J. Heuristics 12(3): 181-209 (2006)
• 
  Federico Heras, Javier Larrosa:
  Intelligent variable orderings and re-orderings in DAC-based solvers for WCSP. J. Heuristics 12(4-5): 287-306 (2006)
• 
  Sin C. Ho, Michel Gendreau:
  Path relinking for the vehicle routing problem. J. Heuristics 12(1-2): 55-72 (2006)
• 
  Willem Jan van Hoeve, Gilles Pesant, Louis-Martin Rousseau:
  On global warming: Flow-based soft global constraints. J. Heuristics 12(4-5): 347-373 (2006)
• 
  Fabien Le Huédé, Michel Grabisch, Christophe Labreuche, Pierre Savéant:
  Integration and propagation of a multi-criteria decision making model in constraint programming. J. Heuristics 12(4-5): 329-346 (2006)
• 
  Pascale Kuntz, Bruno Pinaud, Rémi Lehn:
  Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm. J. Heuristics 12(1-2): 23-36 (2006)
• 
  Andreas C. Nearchou, Sotiris L. Omirou:
  Differential evolution for sequencing and scheduling optimization. J. Heuristics 12(6): 395-411 (2006)
• 
  Syed Asif Raza, Ali Akgunduz, M. Y. Chen:
  A tabu search algorithm for solving economic lot scheduling problem. J. Heuristics 12(6): 413-426 (2006)
• 
  Emma Rollon, Javier Larrosa:
  Bucket elimination for multiobjective optimization problems. J. Heuristics 12(4-5): 307-328 (2006)
• 
  Weiguo Sheng, Xiaohui Liu:
  A genetic k-medoids clustering algorithm. J. Heuristics 12(6): 447-466 (2006)
• 
  Alok Singh, Ashok Kumar Gupta:
  A hybrid heuristic for the maximum clique problem. J. Heuristics 12(1-2): 5-22 (2006)
• 
  Christine Solnon, Serge Fenet:
  A study of ACO capabilities for solving the maximum clique problem. J. Heuristics 12(3): 155-180 (2006)
• 
  Nic Wilson:
  A logic of soft constraints based on partially ordered preferences. J. Heuristics 12(4-5): 241-262 (2006)