The traveling salesman problem with cumulative costs
暂无分享,去创建一个
Lucio Bianco | Aristide Mingozzi | Salvatore Ricciardelli | L. Bianco | S. Ricciardelli | A. Mingozzi
[1] A. Kan. Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .
[2] Abilio Lucena,et al. Time-dependent traveling salesman problem-the deliveryman case , 1990, Networks.
[3] G. Rinaldi,et al. Scheduling tasks with sequence-dependent processing times , 1988 .
[4] Stephen C. Graves,et al. Technical Note - An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem , 1980, Oper. Res..
[5] Paolo Toth,et al. State-space relaxation procedures for the computation of bounds to routing problems , 1981, Networks.
[6] M. Held,et al. A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.
[7] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[8] Maurice Queyranne,et al. The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling , 1978, Oper. Res..