论文信息 - An algorithm for the detection and construction of Monge sequences - 字舞流文

An algorithm for the detection and construction of Monge sequences

N. Alon | R. Shamir | D. Hochbaum | Steven Cosares

[1] F. L. Hitchcock. The Distribution of a Product from Several Sources to Numerous Localities , 1941 .

[2] George B. Dantzig,et al. Linear programming and extensions , 1965 .

[3] R. Gomory,et al. Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem , 1964 .

[4] Benjamin Lev,et al. A Noniterative Algorithm for Tridiagonal Transportation Problems and Its Generalization , 1972, Oper. Res..

[5] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .

[6] Eugene L. Lawler,et al. Well-solved Special Cases of the Traveling Salesman Problem , 1984 .

[7] A. Hoffman,et al. On Transportation Problems with Upper Bounds on Leading Rectangles , 1985 .

[8] E. Lawler,et al. Well-solved special cases , 1985 .

[9] Ramaswamy Chandrasekaran. Recognition of Gilmore-Gomory traveling salesman problem , 1986, Discret. Appl. Math..

[10] James B. Orlin,et al. A faster strongly polynomial minimum cost flow algorithm , 1993, STOC '88.

[11] Ron Shamir,et al. Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem , 1991, Oper. Res..