Author:
Bockmayr Alexander,Eisenbrand Friedrich,Hartmann Mark,Schulz Andreas S.
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference13 articles.
1. Edmonds polytopes and a hierarchy of combinatorial problems;Chvátal;Discrete Math.,1973
2. On cutting-plane proofs in combinatorial optimization;Chvátal;Linear Algebra Appl.,1989
3. Sensitivity theorems in integer linear programming;Cook;Math. Programming,1986
4. W. Cook, M. Hartmann, On the complexity of branch and cut methods for the traveling salesman problem, in: W. Cook, P.D. Seymour (Eds.), Polyhedral Combinatorics, DIMACS, 1990, pp. 75–81.
5. A.M.H. Gerards, On cutting planes and matrices, in: W. Cook, P.D. Seymour (Eds.), Polyhedral Combinatories, DIMACS, 1990, pp. 29–32.
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献