Cutting Plane Algorithms for Integer Programming, Cutting Plane Algorithms
暂无分享,去创建一个
[1] George B. Dantzig,et al. Solution of a Large-Scale Traveling-Salesman Problem , 1954, Oper. Res..
[2] Ralph E. Gomory,et al. An algorithm for integer solutions to linear programs , 1958 .
[3] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .
[4] Vasek Chvátal,et al. Edmonds polytopes and a hierarchy of combinatorial problems , 1973, Discret. Math..
[5] L. G. H. Cijan. A polynomial algorithm in linear programming , 1979 .
[6] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .
[7] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .
[8] Ellis L. Johnson,et al. Solving Large-Scale Zero-One Linear Programming Problems , 1983, Oper. Res..
[9] Gerhard Reinelt,et al. A Cutting Plane Algorithm for the Linear Ordering Problem , 1984, Oper. Res..
[10] M. Grötschel,et al. Solving matching problems with linear programming , 1985, Math. Program..
[11] M. Padberg,et al. Lp-based combinatorial problem solving , 1985 .
[12] David K. Smith. Theory of Linear and Integer Programming , 1987 .
[13] Martin Grötschel,et al. An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design , 1988, Oper. Res..
[14] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[15] Martin Grötschel,et al. Solution of large-scale symmetric travelling salesman problems , 1991, Math. Program..
[16] Manfred W. Padberg,et al. Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut , 1991, INFORMS J. Comput..
[17] Giovanni Rinaldi,et al. A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..
[18] G. Nemhauser,et al. A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing , 1992 .
[19] Michael Jünger,et al. Practical problem solving with cutting plane algorithms in combinatorialoptimization , 1993, Combinatorial Optimization.
[20] Michael Jünger,et al. Provably good solutions for the traveling salesman problem , 1994, Math. Methods Oper. Res..
[21] E. Andrew Boyd,et al. Fenchel Cutting Planes for Integer Programs , 1994, Oper. Res..
[22] G. Rinaldi,et al. Exact ground states of Ising spin glasses: New experimental results with a branch-and-cut algorithm , 1995 .
[23] David Applegate,et al. Finding Cuts in the TSP (A preliminary report) , 1995 .
[24] Milind Dawande,et al. Combining and Strengthening Gomory Cuts , 1995, IPCO.
[25] John E. Mitchell,et al. Solving real-world linear ordering problems using a primal-dual interior point cutting plane method , 1996, Ann. Oper. Res..
[26] V. Kaibel,et al. Angewandte Mathematik Und Informatik Universit at Zu K Oln a Basic Study of the Qap-polytope , 1996 .
[27] E. Balas,et al. Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework , 1996 .
[28] Egon Balas,et al. Gomory cuts revisited , 1996, Oper. Res. Lett..
[29] Martin Grötschel,et al. Packing Steiner trees: a cutting plane algorithm and computational results , 1996, Math. Program..
[30] A. Schrijver. Polyhedral combinatorics , 1996 .
[31] John E. Mitchell,et al. Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems , 1997 .
[32] John E. Mitchell. An Interior Point Cutting Plane Algorithm for Ising Spin Glass Problems , 1998 .
[33] J. Mitchell,et al. Solving Linear Ordering Problems with a Combined Interior Point/Simplex Cutting Plane Algorithm , 2000 .
[34] John E. Mitchell,et al. Computational Experience with an Interior Point Cutting Plane Algorithm , 1999, SIAM J. Optim..