1. Path assignment for call routing: An application of tabu search

   • Charles A. Anderson
   • Kathryn Fraughnaugh
   • Jennifer Ryan

   Various Applications Pages: 299 - 312

2. Using a tabu search approach for solving the two-dimensional irregular cutting problem

   • J. Błażewicz
   • P. Hawryluk
   • R. Walkowiak

   Various Applications Pages: 313 - 325

3. Massively parallel tabu search for the quadratic assignment problem

   • Jaishankar Chakrapani
   • Jadranka Skorin-Kapov

   Various Applications Pages: 327 - 341

4. On the use of some known methods forT-colorings of graphs

   • Daniel Costa

   Various Applications Pages: 343 - 358

5. A tabu search procedure for multicommodity location/allocation with balancing requirements

   • Teodor G. Crainic
   • Michel Gendreau
   • Michel Toulouse

   Various Applications Pages: 359 - 383

6. Solving the maximum clique problem using a tabu search approach

   • Michel Gendreau
   • Patrick Soriano
   • Louis Salvail

   Various Applications Pages: 385 - 403

7. Tabu search applied to the general fixed charge problem

   • Minghe Sun
   • Patrick G. McKeown

   Various Applications Pages: 405 - 420

8. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem

   • Ibrahim Hassan Osman

   Various Applications Pages: 421 - 451

9. Statistical search methods for lotsizing problems

   • Marc Salomon
   • Roelof Kuik
   • Luk N. Van Wassenhove

   Various Applications Pages: 453 - 468

10. Solving real-life vehicle routing problems efficiently using tabu search

    • Frédéric Semet
    • Eric Taillard

    Various Applications Pages: 469 - 488