Zdeněk Fencl
- 1 Karg, R.L., and Thompson, G.L. A heuristic approach to solving traveling salesman problem. Mgmt. Sci. 10, 2 (1964), 225-248.Google Scholar
Digital Library
- 2 Raymond, T.C. Heuristic algorithm for the traveling-salesman problem. IBM J. Res. Develop. 13, 4 (1969), 400-407.Google ScholarDigital Library
- 3 Lin, S. Computer solutions of the traveling salesman problem. Bell Syst. Tech. J. 44 (Dec. 1965), 2245-2269.Google ScholarCross Ref
- 4 Barachet, L.L. Graphic solution of the traveling salesman problem. Oper. Res. 5 (1957), 841-845.Google ScholarDigital Library
- 5 Held, M., and Karp, R.M. A dynamic programming approach to sequencing problems. J. Soc. Incrust. Appl. Math. 10, 1 (1962), 196-210.Google Scholar
- 6 Saksena, J.P., and Kumar S. The routing problem with 'k' specified nodes. Oper. Res. 14 (1969), 909-913.Google ScholarDigital Library
- 7 Bellmore, M., and Nemhauser, G.L. The traveling salesman problem: A survey. Oper. Res. 16 (1968), 538-558.Google ScholarDigital Library
- 8 Berge, C. The Theory of Graphs and Its Applications. Wiley, New York, 1962.Google Scholar
- 9 Berge, C., and Ghouila-Houri, A. Programming, Games and Transportation Networks. Wiley, New York, 1965.Google Scholar
Recommendations
Problem Statements for k-Node Shortest Path and k-Node Shortest Cycle in a Complete Graph*
The author formulates mixed Boolean linear programming problems to find the shortest route and the shortest cycle that pass through the given number of nodes in a complete graph. Their special cases provide formulations of problems for finding the ...
A Multiple Pairs Shortest Path Algorithm
The multiple pairs shortest path problem (MPSP) arises in many applications where the shortest paths and distances between only some specific pairs of origin-destination (OD) nodes in a network are desired. The traditional repeated single-source shortest ...
A simpler and more efficient algorithm for the next-to-shortest path problem
COCOA'10: Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part IIGiven an undirected graph G = (V,E) with positive edge weights and two vertices s and t, the next-to-shortest path problem is to find an st-path which length is minimum among all st-paths of lengths strictly larger than the shortest path length. In this ...
Comments