On Linear Characterizations of Combinatorial Optimization Problems
Data up to Jan 2025
Total Citations Per Year
Abstract
References (19)
Combinatorial optimization:Algorithms and complexity
1984 • 3,523 citations
Paths, Trees, and Flowers
1965 • 2,165 citations
The ellipsoid method and its consequences in combinatorial optimization
1981 • 2,062 citations
Maximum matching and a polyhedron with 0,1-vertices
1965 • 1,719 citations
Solution of a Large-Scale Traveling-Salesman Problem
1954 • 1,141 citations
The Euclidean travelling salesman problem is NP-complete
1977 • 738 citations
On the facial structure of set packing polyhedra
1973 • 588 citations
On the complexity of integer programming
1981 • 555 citations
Odd Minimum Cut-Sets and b-Matchings
1982 • 421 citations
Facets of the knapsack polytope
1975 • 397 citations
Properties of vertex packing and independence system polyhedra
1974 • 360 citations
Faces for a linear inequality in 0–1 variables
1975 • 304 citations
On the symmetric travelling salesman problem I: Inequalities
1979 • 212 citations
Bounds on positive integral solutions of linear Diophantine equations
1976 • 211 citations
On the symmetric travelling salesman problem II: Lifting theorems and facets
1979 • 157 citations
Edmonds polytopes and weakly hamiltonian graphs
1973 • 155 citations
On the Computational Complexity of Integer Programming Problems
1978 • 137 citations
Polyedrische Charakterisierungen kombinatorischer Optimierungsprobleme
1977 • 73 citations
Some Results on the Convex Hull of the Hamiltonian Cycles of Symetric Complete Graphs
1975 • 13 citations