Journal of Heuristics, Volume 5

Volume 5, Number 1, April 1999

• Vitaly A. Strusevich, A. J. A. van de Waart, R. Dekker: A 3/2 Algorithm for Two-Machine Open Shop with Route-Dependent Processing Times. 5-28 BibTeX
• Brian Aldershof, Olivia M. Carducci: Stable Marriage and Genetic Algorithms: A Fertile Union. 29-46 BibTeX
• Bruce W. Colletti, J. Wesley Barnes, Steftcho P. Dokov: A Note on Characterizing the k-OPT Neighborhood Via Group Theory. 47-51 BibTeX
• Roger Z. Ríos-Mercado, Jonathan F. Bard: An Enhanced TSP-Based Heuristic for Makespan Minimization in a Flow Shop with Setup Times. 53-70 BibTeX
• Hiroyuki Okano, Shinji Misono, Kazuo Iwano: New TSP Construction Heuristics and Their Relationships to the 2-Opt. 71-88 BibTeX
• Dimitri P. Bertsekas, David A. Castañon: Rollout Algorithms for Stochastic Scheduling Problems. 89-108 BibTeX
• Ian P. Gent: A Response to "On method overfitting". 109-111 BibTeX

Volume 5, Number 2, July 1999

• Mauro Dell'Amico, Andrea Lodi, Francesco Maffioli: Solution of the Cumulative Assignment Problem With a Well-Structured Tabu Search Method. 123-143 BibTeX
• Patrice Calégari, Giovanni Coray, Alain Hertz, Daniel Kobler, Pierre Kuonen: A Taxonomy of Evolutionary Algorithms in Combinatorial Optimization. 145-158 BibTeX
• Raymond A. Patterson, Hasan Pirkul, Erik Rolland: A Memory Adaptive Reasoning Technique for Solving the Capacitated Minimum Spanning Tree Problem. 159-180 BibTeX
• Elena Fernández, Rafael Martí: GRASP for Seam Drawing in Mosaicking of Aerial Photographic Maps. 181-197 BibTeX
• Jareck Falkowski, Miles G. Nicholls: Increasing the Efficiency of Selected Grid Search Procedures Through the Introduction of a Best Step Mechanism. 199-214 BibTeX
• Heinz Mühlenbein, Thilo Mahnig, Alberto Ochoa-Rodríguez: Schemata, Distributions and Graphical Models in Evolutionary Optimization. 215-247 BibTeX

Volume 5, Number 3, October 1999

• Gilles Pesant, Michel Gendreau: A Constraint Programming Framework for Local Search Methods. 255-279 BibTeX
• Yves Caseau, François Laburthe: Heuristics for Large Constrained Vehicle Routing Problems. 281-303 BibTeX
• Claude Le Pape, Philippe Baptiste: Heuristic Control of a Constraint-Based Algorithm for the Preemptive Job-Shop Scheduling Problem. 305-325 BibTeX
• Pascale Kuntz, Dominique Snyers, Paul J. Layzell: A Stochastic Heuristic for Visualising Graph Clusters in a Bi-Dimensional Space Prior to Partitioning. 327-351 BibTeX
• Henri Farreny: Completeness and Admissibility for General Heuristic Search Algorithms-A Theoretical Study: Basic Concepts and Proofs. 353-376 BibTeX

Volume 5, Number 4, December 1999

• Buyang Cao, Minghe Sun, Charles Macleod: Applying GIS and Combinatorial Optimization to Fiber Deployment Plans. 385-402 BibTeX
• Ian D. Wilson, Paul A. Roach: Principles of Combinatorial Optimization Applied to Container-Ship Stowage Planning. 403-418 BibTeX
• Thomas Emden-Weinert, Mark Proksch: Best Practice Simulated Annealing for the Airline Crew Scheduling Problem. 419-436 BibTeX
• David M. Miller, Hui-Chuan Chen, Jessica Matson, Qiang Liu: A Hybrid Genetic Algorithm for the Single Machine Scheduling Problem. 437-454 BibTeX