Journal of Heuristics, Volume 3

Volume 3, Number 1, Fall 1997

Celso C. Ribeiro, Cláudio D. Ribeiro, Rosana S. G. Lanzelotte: Query Optimization in Distributed Relational Databases. 5-23 BibTeX
David R. Kraay, Patrick T. Harker: Case-Based Reasoning for Repetitive Combinatorial Optimization Problems, Part II: Numerical Results. 25-42 BibTeX
Andrew J. Higgins, Erhan Kozan, Luis Ferreira: Heuristic Techniques for Single Line Train Scheduling. 43-62 BibTeX
Inki Hong, Andrew B. Kahng, Byung Ro Moon: Improved Large-Step Markov Chain Variants for the Symmetric TSP. 63-81 BibTeX

Daniele Vigo, Vittorio Maniezzo: A Genetic/Tabu Thresholding Hybrid Algorithm for the Process Allocation Problem. 91-110 BibTeX
Ebru Demirkol, Sanjay Mehta, Reha Uzsoy: A Computational Study of Shifting Bottleneck Procedures for Shop Scheduling Problems. 111-137 BibTeX
Sheldon H. Jacobson, Alan W. Johnson, Kelly A. Sullivan, Mark A. Fleischer, Ashok Kumar: Metaheuristics for a Flexible Assembly System Design Problem. 139-159 BibTeX
Fred Glover, Manuel Laguna: General Purpose Heuristics for Integer Programming-Part II. 161-179 BibTeX

Lawrence Davis, Louis Anthony Cox Jr., Warren Kuehner, Leonard L. Lu, David Orvosh: Dynamic Hierarchical Packing of Wireless Switches Using a Seed, Repair and Replace Genetic Algorithm. 187-205 BibTeX
Youssef Saab: Combinatorial Optimization by Dynamic Contraction. 207-224 BibTeX
C.-J. Richard Shi, Anthony Vannelli, Jiri Vlach: Performance-Driven Layer Assignment by Integer Linear Programming and Path-Constrained Hypergraph Partitioning. 225-243 BibTeX
Dimitri P. Bertsekas, John N. Tsitsiklis, Cynara Wu: Rollout Algorithms for Combinatorial Optimization. 245-262 BibTeX

Wim Nuijten, Claude Le Pape: Constraint-Based Job Shop Scheduling with \sc Ilog Scheduler. 271-286 BibTeX
Mikhail Y. Kovalyov, Wieslaw Kubiak: A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs. 287-297 BibTeX
Ian P. Gent: Heuristic Solution of Open Bin Packing Problems. 299-304 BibTeX
Minghe Sun: A Tabu Search Heuristic Procedure for Solving the Transportation Problem with Exclusionary Side Constraints. 305-326 BibTeX