A Dynamic Programming Approach to Sequencing Problems
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
R. L. Ackoff, Progress in Operations Research, Vol. I, Publications in Operations Research, No. 5, John Wiley & Sons Inc., New York, 1961xii+505
2A.
Richard Bellman, Combinatorial processes and dynamic programmingProc. Sympos. Appl. Math., Vol. 10, American Mathematical Society, Providence, R.I., 1960, 217–249
2B.
Richard Bellman, Dynamic programming treatment of the travelling salesman problem, J. Assoc. Comput. Mach., 9 (1962), 61–63
3.
G. A. Croes, A method for solving traveling-salesman problems, Operations Res., 6 (1958), 791–812
4A.
G. Dantzig, R. Fulkerson, S. Johnson, Solution of a large-scale traveling-salesman problem, J. Operations Res. Soc. Amer., 2 (1954), 393–410
4B.
G. B. Dantzig, D. R. Fulkerson, S. M. Johnson, On a linear-programming, combinatorial approach to the traveling-salesman problem, Operations Res., 7 (1959), 58–66
5.
Kurt Eisemann, The trim problem, Management Sci., 3 (1957), 279–284
6.
Merrill M. Flood, The traveling-salesman problem, Operations Res., 4 (1956), 61–75
7.
P. C. Gilmore, R. E. Gomory, A linear programming approach to the cutting-stock problem, Operations Res., 9 (1961), 849–859
8.
Maurice Kraitchik, Mathematical recreations, Dover Publications Inc., New York, N. Y., 1953, 330–, Chapter 11
9.
Robert McNaughton, Scheduling with deadlines and loss functions, Management Sci., 6 (1959/1960), 1–12
10.
M. E. Salveson, The assembly line balancing problem, Journal of Industrial Engineering, 6 (1955), 18–25
11.
B. L. van der Waerden, Modern Algebra. Vol. I, Frederick Ungar Publishing Co., New York, N. Y., 1949xii+264
Information & Authors
Information
Published In
Copyright
Copyright © 1962 Society for Industrial and Applied Mathematics.
History
Submitted: 31 August 1961
Published online: 13 July 2006
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
- A 3/2-Approximation for the Metric Many-Visits Path TSPSIAM Journal on Discrete Mathematics, Vol. 36, No. 4 | 8 December 2022
- Approximation Limitations of Pure Dynamic ProgrammingSIAM Journal on Computing, Vol. 49, No. 1 | 18 February 2020
- On the Fine-Grained Complexity of Rainbow ColoringSIAM Journal on Discrete Mathematics, Vol. 32, No. 3 | 17 July 2018
- Bounding the Running Time of Algorithms for Scheduling and Packing ProblemsSIAM Journal on Discrete Mathematics, Vol. 30, No. 1 | 25 February 2016
- Tropical Complexity, Sidon Sets, and Dynamic ProgrammingSIAM Journal on Discrete Mathematics, Vol. 30, No. 4 | 1 November 2016
- Determinant Sums for Undirected HamiltonicitySIAM Journal on Computing, Vol. 43, No. 1 | 20 February 2014
- Symmetry Matters for Sizes of Extended FormulationsSIAM Journal on Discrete Mathematics, Vol. 26, No. 3 | 18 September 2012
- Parameterized Complexity of Arc-Weighted Directed Steiner ProblemsSIAM Journal on Discrete Mathematics, Vol. 25, No. 2 | 27 June 2011
- Set Partitioning via Inclusion-ExclusionSIAM Journal on Computing, Vol. 39, No. 2 | 23 July 2009
- Exact Algorithms for Treewidth and Minimum Fill-InSIAM Journal on Computing, Vol. 38, No. 3 | 2 July 2008
- The Probabilistic Relationship Between the Assignment and Asymmetric Traveling Salesman ProblemsSIAM Journal on Computing, Vol. 36, No. 5 | 26 January 2007
- Expected Computation Time for Hamiltonian Path problemSIAM Journal on Computing, Vol. 16, No. 3 | 13 July 2006
- The Traveling Salesman Problem with Many Visits to Few CitiesSIAM Journal on Computing, Vol. 13, No. 1 | 2 August 2006
- The Travelling Salesman Problem and Minimum Matching in the Unit SquareSIAM Journal on Computing, Vol. 12, No. 1 | 31 July 2006
- A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability OneSIAM Journal on Computing, Vol. 11, No. 1 | 31 July 2006
- Algorithms for Obtaining Shortest Paths Visiting Specified NodesSIAM Review, Vol. 15, No. 2 | 2 August 2006
- Finite-State Processes and Dynamic ProgrammingSIAM Journal on Applied Mathematics, Vol. 15, No. 3 | 13 July 2006
- Discrete OptimizingJournal of the Society for Industrial and Applied Mathematics, Vol. 13, No. 3 | 13 July 2006