Author:
Bérubé Jean-François,Gendreau Michel,Potvin Jean-Yves
Subject
Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering
Reference31 articles.
1. New approximation guarantees for minimum-weight k-trees and prize-collecting salesman;Awerbuch;SIAM Journal on Computing,1998
2. Facets of the knapsack polytope;Balas;Mathematical Programming,1975
3. The prize collecting traveling salesman problem;Balas;Networks,1989
4. The prize collecting traveling salesman problem: II. Polyhedral results;Balas;Networks,1995
5. J.-F. Bérubé, M. Gendreau, J.-Y. Potvin, A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem, Technical Report CRT-2006-30, Centre for Research on Transportation, Université de Montréal, 2006.
Cited by
274 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献