Journal of Heuristics, Volume 12

Volume 12, Numbers 1-2, March 2006

• Alok Singh, Ashok Kumar Gupta:
  A hybrid heuristic for the maximum clique problem. 5-22
  Electronic Edition (link) BibTeX
• Pascale Kuntz, Bruno Pinaud, Rémi Lehn:
  Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm. 23-36
  Electronic Edition (link) BibTeX
• Tobias Andersson:
  Solving the flight perturbation problem with meta heuristics. 37-53
  Electronic Edition (link) BibTeX
• Sin C. Ho, Michel Gendreau:
  Path relinking for the vehicle routing problem. 55-72
  Electronic Edition (link) BibTeX
• Oscar Cordón, Sergio Damas:
  Image registration with iterated local search. 73-94
  Electronic Edition (link) BibTeX
• Ramón Alvarez-Valdés, E. Crespo, José Manuel Tamarit, F. Villa:
  A scatter search algorithm for project scheduling under partially renewable resources. 95-113
  Electronic Edition (link) BibTeX
• Özlem Ergun, James B. Orlin, Abran Steele-Feldman:
  Creating very large scale neighborhoods out of smaller ones by compounding moves. 115-140
  Electronic Edition (link) BibTeX

Volume 12, Number 3, May 2006

• Robert J. Cimikowski:
  An analysis of some linear graph layout heuristics. 143-153
  Electronic Edition (link) BibTeX
• Christine Solnon, Serge Fenet:
  A study of ACO capabilities for solving the maximum clique problem. 155-180
  Electronic Edition (link) BibTeX
• Joaquín Lopez Fernández, Rafael Sanz, Reid G. Simmons, Amador R. Diéguez:
  Heuristic anytime approaches to stochastic decision processes. 181-209
  Electronic Edition (link) BibTeX
• Daniela Ambrosino, Anna Sciomachen, Elena Tanfani:
  A decomposition heuristics for the container ship stowage problem. 211-233
  Electronic Edition (link) BibTeX

Volume 12, Numbers 4-5, September 2006

• Stefano Bistarelli, Francesca Rossi:
  Editorial. 239-240
  Electronic Edition (link) BibTeX
• Nic Wilson:
  A logic of soft constraints based on partially ordered preferences. 241-262
  Electronic Edition (link) BibTeX
• Carmel Domshlak, Steven David Prestwich, Francesca Rossi, Kristen Brent Venable, Toby Walsh:
  Hard and soft constraints for reasoning about qualitative conditional preferences. 263-285
  Electronic Edition (link) BibTeX
• Federico Heras, Javier Larrosa:
  Intelligent variable orderings and re-orderings in DAC-based solvers for WCSP. 287-306
  Electronic Edition (link) BibTeX
• Emma Rollon, Javier Larrosa:
  Bucket elimination for multiobjective optimization problems. 307-328
  Electronic Edition (link) BibTeX
• Fabien Le Huédé, Michel Grabisch, Christophe Labreuche, Pierre Savéant:
  Integration and propagation of a multi-criteria decision making model in constraint programming. 329-346
  Electronic Edition (link) BibTeX
• Willem Jan van Hoeve, Gilles Pesant, Louis-Martin Rousseau:
  On global warming: Flow-based soft global constraints. 347-373
  Electronic Edition (link) BibTeX
• Josep Argelich, Felip Manyà:
  Exact Max-SAT solvers for over-constrained problems. 375-392
  Electronic Edition (link) BibTeX

Volume 12, Number 6, December 2006

• Andreas C. Nearchou, Sotiris L. Omirou:
  Differential evolution for sequencing and scheduling optimization. 395-411
  Electronic Edition (link) BibTeX
• Syed Asif Raza, Ali Akgunduz, M. Y. Chen:
  A tabu search algorithm for solving economic lot scheduling problem. 413-426
  Electronic Edition (link) BibTeX
• Vinícius Amaral Armentano, Olinto César Bassi de Araujo:
  Grasp with memory-based mechanisms for minimizing total tardiness in single machine scheduling with setup times. 427-446
  Electronic Edition (link) BibTeX
• Weiguo Sheng, Xiaohui Liu:
  A genetic k-medoids clustering algorithm. 447-466
  Electronic Edition (link) BibTeX