Edmonds polytopes and weakly Hamiltonian graphs
From MaRDI portal
Cites work
- Cycles and Connectivity in Graphs
- Edmonds polytopes and a hierarchy of combinatorial problems
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 3303655 (Why is no real title available?)
- Maximum matching and a polyhedron with 0,1-vertices
- The Factors of Graphs
- Tough graphs and Hamiltonian circuits.
Cited in
(44)- Certification of an optimal TSP tour through 85,900 cities
- The complexity of facets (and some facets of complexity)
- On cutting-plane proofs in combinatorial optimization
- A matching problem with side conditions
- Discrete extremal problems
- The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities
- On symmetric subtour problems
- A note on Hamiltonian split graphs
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
- Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm
- Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm
- A note on the polytope of bipartite TSP
- Understanding cutting planes for QBFs
- A computational comparison of flow formulations for the capacitated location-routing problem
- The graphical relaxation: A new framework for the symmetric traveling salesman polytope
- Cutting-plane proofs in polynomial space
- Polyhedron of triangle-free simple 2-matchings in subcubic graphs
- Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday)
- The symmetric quadratic traveling salesman problem
- Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint)
- Edmonds polytopes and a hierarchy of combinatorial problems
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization
- A branch-and-cut algorithm for the preemptive swapping problem
- On the symmetric travelling salesman problem I: inequalities
- On the symmetric travelling salesman problem II: lifting theorems and facets
- A survey of some network reliability analysis and synthesis results
- Multi-depot multiple TSP: a polyhedral study and computational results
- Sensitivity theorems in integer linear programming
- Partial linear characterizations of the asymmetric travelling salesman polytope
- Lineare Charakterisierungen von Travelling Salesman Problemen
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- On the complexity of cutting-plane proofs
- Branch and cut methods for network optimization
- On approximating the longest path in a graph
- Polyhedral study of the capacitated vehicle routing problem
- Circulant TSP: vertices of the edge-length polytope and superpolynomial lower bounds
- On the integrality gap of small asymmetric traveling salesman problems: a polyhedral and computational approach
- Recent trends in combinatorial optimization
- Optimizing over the subtour polytope of the travelling salesman problem
- Chvátal closures for mixed integer programming problems
- Recent advances in vehicle routing exact algorithms
- George Dantzig's contributions to integer programming
- Exploiting planarity in separation routines for the symmetric traveling salesman problem
- Exact algorithms for routing problems under vehicle capacity constraints
This page was built for publication: Edmonds polytopes and weakly Hamiltonian graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5685112)