Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
暂无分享,去创建一个
[1] Mandell Bellmore,et al. Pathology of Traveling-Salesman Subtour-Elimination Algorithms , 1971, Oper. Res..
[2] G. Thompson,et al. An operator theory of parametric programming for the transportation problem‐II , 1972 .
[3] Robert S. Garfinkel,et al. Technical Note - On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem , 1973, Oper. Res..
[4] Gerald L. Thompson,et al. Computational Performance of Three Subtour Elimination Algorithms for Solving Asymmetric Traveling Salesman Problems. , 1977 .
[5] Paolo Toth,et al. Algorithm 548: Solution of the Assignment Problem [H] , 1980, TOMS.