Journal of Heuristics, Volume 9

Volume 9, Number 1, Januar 2003

• Minghe Sun, Hamid R. Nemati: Tabu Machine: A New Neural Network Solution Approach for Combinatorial Optimization Problems. 5-27
• Takayuki Osogami, Hiroyuki Okano: Local Search Algorithms for the Bin Packing Problem and Their Relationships to Various Construction Heuristics. 29-49
• Éric D. Taillard: Heuristic Methods for Large Centroid Clustering Problems. 51-73
• John M. Emmert, Sandeep Lodha, Dinesh Bhatia: On Using Tabu Search for Design Automation of VLSI Systems. 75-90

Volume 9, Number 2, March 2003

• Alberto Caprara, Hans Kellerer, Ulrich Pferschy: A 3/4-Approximation Algorithm for Multiple Subset Sum. 99-111
• Juha Kivijärvi, Pasi Fränti, Olli Nevalainen: Self-Adaptive Genetic Algorithm for Clustering. 113-129
• Jean-Marc Labat, Jean-Charles Pomerol: Are Branch and Bound and A* Algorithms Identical? 131-143
• Dale E. Blodgett, Michel Gendreau, François Guertin, Jean-Yves Potvin, René Séguin: A Tabu Search Heuristic for Resource Management in Naval Warfare. 145-169

Volume 9, Number 3, June 2003

• Fred Glover: Tutorial on Surrogate Constraint Approaches for Optimization in Graphs. 175-227
• Thomas Davoine, Peter L. Hammer, Béla Vizvári: A Heuristic for Boolean Optimization Problems. 229-247
• Jae Yun Kim, Yeo Keun Kim, Yeongho Kim: Tournament Competition and its Merits for Coevolutionary Algorithms. 249-268
• Oluf Faroe, David Pisinger, Martin Zachariasen: Guided Local Search for Final Placement in VLSI Design. 269-295

Volume 9, Number 4, September 2003

• J. Rajesh, Kapil Gupta, Hari Shankar Kusumakar, Vaidyanathan K. Jayaraman, Bhaskar D. Kulkarni: A Tabu Search Based Approach for Solving a Class of Bilevel Programming Problems in Chemical Engineering. 307-319
• Nicola Secomandi: Analysis of a Rollout Approach to Sequencing Problems with Stochastic Routing Applications. 321-352
• Joel S. Sokol: A Robust Heuristic for Batting Order Optimization Under Uncertainty. 353-370

Volume 9, Number 5, November 2003

• D. Allen, I. Ismail, Jeffery L. Kennington, Eli V. Olinick: An Incremental Procedure for Improving Path Assignment in a Telecommunications Network. 375-399
• Ivana Ljubic, Günther R. Raidl: A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs. 401-427
• Virginie Gabrel, Arnaud Knippel, Michel Minoux: A Comparison of Heuristics for the Discrete Cost Multicommodity Network Optimization Problem. 429-445

Volume 9, Number 6, December 2003

• Edmund K. Burke, Graham Kendall, Eric Soubeiga:
  A Tabu-Search Hyperheuristic for Timetabling and Rostering. 451-470
  
• Fulya Altiparmak, Berna Dengiz, Alice E. Smith:
  Optimal Design of Reliable Computer Networks: A Comparison of Metaheuristics. 471-487
  
• Andrea Di Blas, Arun Jagota, Richard Hughey:
  A Range-Compaction Heuristic for Graph Coloring. 489-506
  
• Tiew-On Ting, M. V. C. Rao, Chu Kiong Loo, S. S. Ngu:
  Solving Unit Commitment Problem Using Hybrid Particle Swarm Optimization. 507-520