Bottleneck extrema

Journal of Combinatorial Theory - Tập 8 - Trang 299-306 - 1970
Jack Edmonds1,2, D.R. Fulkerson1,2
1National Bureau of Standards Washington, D.C. 20234 USA
2The RAND Corporation, 1700 Main Street, Santa Monica, California 90406 USA

Tài liệu tham khảo

Berge, 1958 Edmonds, 1965, Paths, Trees, and Flowers, Canad. J. Math., 17, 447, 10.4153/CJM-1965-045-4 Ford, 1962 Fulkerson, 1966, Flow Networks and Combinatorial Operations Research, Amer. Math. Monthly, 73, 115, 10.2307/2313544 Fulkerson, 1953 Gilmore, 1964, Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem, Operations Res., 12, 655, 10.1287/opre.12.5.655 Gross, 1959 Hu, 1965 Hu, 1961, The Maximum Capacity Route Problem, Operations Res., 9, 898, 10.1287/opre.9.6.898 Lawler, 1966, Covering Problems: Duality Relations and a New method of Solution, SIAM J, 14, 1115 A. Lehman, On the Width Length Inequality, to appear in SIAM J. Pollack, 1960, The Maximum Capacity Route through a Network, Operations Res., 9, 722 Shapley, 1962, Simple Games An Outline of the Descriptive Theory, Behavioral Sci., 7, 59, 10.1002/bs.3830070104 Tutte, 1952, The Factors of Graphs, Canad. J. Math., 4, 314, 10.4153/CJM-1952-028-2