论文信息 - The Machine Learning and Traveling Repairman Problem

The Machine Learning and Traveling Repairman Problem

The goal of the Machine Learning and Traveling Repairman Problem (MLT from the set of acceptable models, we choose the model that has the lowest cost of applying it to the subsequent routing task. In a sense, this procedure agrees with a managerial goal, which is to show that the data can support choosing a low-cost solution.

[1] Haimonti Dutta,et al. A process for predicting manhole events in Manhattan , 2009, Machine Learning.

[2] Alexander Zien,et al. Semi-Supervised Learning , 2006 .

[3] Miriam Lechmann. The traveling repairman problem , 2009 .

[4] Shivani Agarwal,et al. Ranking on graph data , 2006, ICML.

[5] J. Schneider. The time-dependent traveling salesman problem , 2002 .

[6] Marc Toussaint,et al. Probabilistic inference for solving discrete and continuous state Markov Decision Processes , 2006, ICML.

[7] van Ca Cleola Eijl. A polyhedral approach to the delivery man problem , 1995 .

[8] Matteo Fischetti,et al. The Delivery Man Problem and Cumulative Matroids , 1993, Oper. Res..

[9] Mikhail Belkin,et al. Manifold Regularization: A Geometric Framework for Learning from Labeled and Unlabeled Examples , 2006, J. Mach. Learn. Res..

[10] Madhu Sudan,et al. The minimum latency problem , 1994, STOC '94.

[11] Bernhard Schölkopf,et al. Ranking on Data Manifolds , 2003, NIPS.