Pages that link to "Item:Q5685112"

The following pages link to Edmonds polytopes and weakly hamiltonian graphs (Q5685112):

Displaying 42 items.

• Multi-depot multiple TSP: a polyhedral study and computational results (Q367624) (← links)
• On the complexity of cutting-plane proofs (Q580175) (← links)
• On approximating the longest path in a graph (Q679451) (← links)
• Polyhedral study of the capacitated vehicle routing problem (Q688914) (← links)
• Recent trends in combinatorial optimization (Q788638) (← links)
• Optimizing over the subtour polytope of the travelling salesman problem (Q803048) (← links)
• Chvátal closures for mixed integer programming problems (Q922950) (← links)
• Recent advances in vehicle routing exact algorithms (Q926561) (← links)
• George Dantzig's contributions to integer programming (Q951090) (← links)
• Exploiting planarity in separation routines for the symmetric traveling salesman problem (Q951094) (← links)
• Exact algorithms for routing problems under vehicle capacity constraints (Q970191) (← links)
• Certification of an optimal TSP tour through 85,900 cities (Q1002076) (← links)
• The complexity of facets (and some facets of complexity) (Q1061485) (← links)
• On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
• A matching problem with side conditions (Q1145707) (← links)
• Discrete extremal problems (Q1152306) (← links)
• The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities (Q1181903) (← links)
• On symmetric subtour problems (Q1202764) (← links)
• A note on Hamiltonian split graphs (Q1255969) (← links)
• Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods (Q1621692) (← links)
• Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm (Q1622797) (← links)
• Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm (Q1651623) (← links)
• A note on the polytope of bipartite TSP (Q1682883) (← links)
• Understanding cutting planes for QBFs (Q1784953) (← links)
• A computational comparison of flow formulations for the capacitated location-routing problem (Q1799384) (← links)
• The graphical relaxation: A new framework for the symmetric traveling salesman polytope (Q1803616) (← links)
• Cutting-plane proofs in polynomial space (Q1813835) (← links)
• Polyhedron of triangle-free simple 2-matchings in subcubic graphs (Q1949271) (← links)
• Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday) (Q2373937) (← links)
• The symmetric quadratic traveling salesman problem (Q2434982) (← links)
• Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint) (Q2497988) (← links)
• Edmonds polytopes and a hierarchy of combinatorial problems (Q2557712) (← links)
• Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q2687063) (← links)
• A branch-and-cut algorithm for the preemptive swapping problem (Q2913951) (← links)
• On the symmetric travelling salesman problem I: Inequalities (Q3048580) (← links)
• On the symmetric travelling salesman problem II: Lifting theorems and facets (Q3048581) (← links)
• A survey of some network reliability analysis and synthesis results (Q3057110) (← links)
• Sensitivity theorems in integer linear programming (Q3793940) (← links)
• Partial linear characterizations of the asymmetric travelling salesman polytope (Q4119036) (← links)
• Lineare Charakterisierungen von Travelling Salesman Problemen (Q4119037) (← links)
• The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization (Q4789079) (← links)
• Branch and cut methods for network optimization (Q5936762) (← links)