Analysis of a Random Cut Test Instance Generator for the TSP
暂无分享,去创建一个
[1] Mark W. Krentel. The complexity of optimization problems , 1986, STOC '86.
[2] Mihalis Yannakakis,et al. The complexity of facets (and some facets of complexity) , 1982, STOC '82.
[3] Martin Grötschel,et al. On the symmetric travelling salesman problem I: Inequalities , 1979, Math. Program..
[4] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[5] Laura A. Sanchis,et al. On the Complexity of Test Case Generation for NP-Hard Problems , 1990, Inf. Process. Lett..
[6] Ellis L. Johnson,et al. Solving Large-Scale Zero-One Linear Programming Problems , 1983, Oper. Res..
[7] M. Pilcher. Development and validation of random cut test problem generator , 1985 .
[8] Leslie G. Valiant,et al. NP is as easy as detecting unique solutions , 1985, STOC '85.
[9] William R. Pulleyblank,et al. Clique Tree Inequalities and the Symmetric Travelling Salesman Problem , 1986, Math. Oper. Res..
[10] Ronald L. Rardin,et al. Partial polyhedral description and generation of discrete optimization problems with known optima , 1992 .
[11] N. Biggs. THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .
[12] David S. Johnson,et al. The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.
[13] G. Ding. Discrete optimization , 1977 .