论文信息 - The optimal network problem: Some computational procedures - 字舞流文

The optimal network problem: Some computational procedures

[1] U.G.W. Knight. Logical design of electrical networks , 1960 .

[2] U. G. Knight,et al. The logical design of electrical networks using linear pro-gramming methods , 1960 .

[3] A. Land,et al. An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.

[4] Duane F. Marble,et al. THE STRUCTURE OF TRANSPORTATION NETWORKS , 1962 .

[5] F. H. W. Green,et al. Structure of transportation networks , 1963 .

[6] E. Balas. An Additive Algorithm for Solving Linear Programs with Zero-One Variables , 1965 .

[7] Solomon W. Golomb,et al. Backtrack Programming , 1965, JACM.

[8] E. L. Lawler,et al. Branch-and-Bound Methods: A Survey , 1966, Oper. Res..

[9] E. L. Lawler,et al. A Method for Solving Discrete Optimization Problems , 1966, Oper. Res..

[10] Rod M. Burstall,et al. Computer Design of Electricity Supply Networks by a Heuristic Method , 1966, Comput. J..

[11] Allen J. Scott. A PROGRAMMING MODEL OF AN INTEGRATED TRANSPORTATION NETWORK , 1967 .

[12] Sonia Stairs. A REVIEW OF THE COMPUTATIONAL PROBLEMS OF SELECTING AN OPTIMAL TRAFFIC NETWORK. , 1967 .

[13] Alex Karel Obruca. Spanning Tree Manipulation and the Travelling Salesman Problem , 1968, Comput. J..