Heuristic Bounds and Test Problem Generation for the Time-Dependent Traveling Salesman Problem
暂无分享,去创建一个
[1] Lucio Bianco,et al. The traveling salesman problem with cumulative costs , 1993, Networks.
[2] Ronald L. Rardin,et al. Partial polyhedral description and generation of discrete optimization problems with known optima , 1992 .
[3] Nicos Christofides,et al. Algorithms for Large-scale Travelling Salesman Problems , 1972 .
[4] A. M. Geoffrion. Generalized Benders decomposition , 1972 .
[5] Maurice Queyranne,et al. The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling , 1978, Oper. Res..
[6] J. F. Benders. Partitioning procedures for solving mixed-variables programming problems , 1962 .
[7] Mark S. Daskin,et al. Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms , 1992, Transp. Sci..
[8] Gerhard Reinelt,et al. TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..
[9] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[10] Chryssi Malandraki,et al. A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem , 1996 .
[11] Jeffrey L. Arthur,et al. Generating Travelling-Salesman Problems with Known Optimal Tours , 1988 .
[12] King-Tim Mak,et al. A modified Lin-Kernighan traveling-salesman heuristic , 1993, Oper. Res. Lett..
[13] I. Grossmann,et al. MINLP model for cyclic multiproduct scheduling on continuous parallel lines , 1991 .
[14] E. Lawler,et al. Erratum: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1986 .
[15] H. Sherali,et al. Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem , 1980 .
[16] Matteo Fischetti,et al. The Delivery Man Problem and Cumulative Matroids , 1993, Oper. Res..
[17] Christos H. Papadimitriou,et al. Local Search for the Asymmetric Traveling Salesman Problem , 1980, Oper. Res..
[18] David Simchi-Levi,et al. Minimizing the Total Flow Time of n Jobs on a Network , 1991 .
[19] Stephen C. Graves,et al. The Travelling Salesman Problem and Related Problems , 1978 .
[20] Lawrence Bodin,et al. Approximate Traveling Salesman Algorithms , 1980, Oper. Res..
[21] David S. Johnson,et al. Local Optimization and the Traveling Salesman Problem , 1990, ICALP.
[22] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..
[23] R. A. Zemlin,et al. Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.
[24] Abilio Lucena,et al. Time-dependent traveling salesman problem-the deliveryman case , 1990, Networks.
[25] Nagraj Balakrishnan,et al. Scheduling examinations to reduce second-order conflicts , 1992, Comput. Oper. Res..
[26] A. M. Geoffrion,et al. Multicommodity Distribution System Design by Benders Decomposition , 1974 .