JOURNAL ARTICLE
On cutting-plane proofs in combinatorial optimization
Vašek ChvátalWilliam J. CookMark Hartmann
Year: 1989 Journal: Linear Algebra and its Applications Vol: 114-115 Pages: 455-499 Publisher: Elsevier BV
Keywords:
Polyhedron Cutting-plane method Mathematics Travelling salesman problem Combinatorics Knapsack problem Set (abstract data type) Plane (geometry) Rank (graph theory) Bipartite graph Combinatorial optimization Mathematical proof Integer programming Discrete mathematics Mathematical optimization Computer science Graph
Metrics
114
Cited By
3.15
FWCI (Field Weighted Citation Impact)
70
Refs
0.90
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Optimization and Packing Problems
Physical Sciences → Engineering → Industrial and Manufacturing Engineering
Advanced Graph Theory Research
Physical Sciences → Computer Science → Computational Theory and Mathematics
Complexity and Algorithms in Graphs
Physical Sciences → Computer Science → Computational Theory and Mathematics
Related Documents
JOURNAL ARTICLE
Cutting Plane and Frege Proofs
Journal: Information and Computation Year: 1995 Vol: 121 (1)Pages: 103-122
JOURNAL ARTICLE
Cutting-plane proofs in polynomial space
Journal: Mathematical Programming Year: 1990 Vol: 47 (1-3)Pages: 11-18
BOOK-CHAPTER
Practical problem solving with cutting plane algorithms in combinatorial optimization
Michael JüngerGerhard ReineltStefan Thienel
DIMACS series in discrete mathematics and theoretical computer science Year: 1995 Pages: 111-152
JOURNAL ARTICLE
On the complexity of cutting-plane proofs
William J. CookCollette R. CoullardGy. Turán
Journal: Discrete Applied Mathematics Year: 1987 Vol: 18 (1)Pages: 25-38