Thomas G. Dietterich Department of Computer Science Oregon State University Corvallis, Oregon 97331 tgd Ensembles for Cost-Sensitive.
Initialization methods for the tsp with time windows using variable neighborhood search
1 MERLIN A polynomial solution for the Traveling Salesman Problem Dr. Joachim Mertz, 2005.
Novel Reordering Approaches in Phrase-Based Statistical Machine Translation S. Kanthak, D. Vilar, E. Matusov, R. Zens & H. Ney ACL Workshop on Building.
1 Ch 13 – Backtracking + Branch-and-Bound There are two principal approaches to tackling NP-hard problems or other “intractable” problems: Use a strategy.
Investigation of Data Locality in MapReduce Zhenhua Guo, Geoffrey Fox, Mo Zhou.
travelling salesman problem
