RI | Publications | Learning to Recognize (Un)Promising Simulated Annealing Runs: Efficient Search Procedures for Job Shop Scheduling and Vehicle Routing

Text only version of this site

Learning to Recognize (Un)Promising Simulated Annealing Runs: Efficient Search Procedures for Job Shop Scheduling and Vehicle Routing
N. Sadeh-Koniecpol, Y. Nakakuki, and S.R. Thangiah
Annals of Operations Research, Vol. 75, 1997, pp. 189-208.

Jump to: Download | Text Reference | BibTeX Reference

Download [Help]

Adobe portable document format (pdf) [218 KB]

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Text Reference

N. Sadeh-Koniecpol, Y. Nakakuki, and S.R. Thangiah, "Learning to Recognize (Un)Promising Simulated Annealing Runs: Efficient Search Procedures for Job Shop Scheduling and Vehicle Routing," Annals of Operations Research, Vol. 75, 1997, pp. 189-208.

BibTeX Reference

@article{Sadeh-Koniecpol_1997_2089,
   author = "Norman Sadeh-Koniecpol and Yoichiro Nakakuki and Sam R. Thangiah",
   title = "Learning to Recognize (Un)Promising Simulated Annealing Runs: Efficient Search Procedures for Job Shop Scheduling and Vehicle Routing",
   journal = "Annals of Operations Research",
   year = "1997",
   volume = "75",
   pages = "189-208"
}