Pages that link to "Item:Q3048580"

The following pages link to On the symmetric travelling salesman problem I: Inequalities (Q3048580):

Displaying 50 items.

• Light on the infinite group relaxation. I: Foundations and taxonomy (Q262442) (← links)
• A branch-and-cut framework for the consistent traveling salesman problem (Q320686) (← links)
• The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach (Q336445) (← links)
• Multi-depot multiple TSP: a polyhedral study and computational results (Q367624) (← links)
• On the membership problem for the \({0, 1/2}\)-closure (Q408382) (← links)
• An extended approach for lifting clique tree inequalities (Q498425) (← links)
• Minimum-weight two-connected spanning networks (Q582215) (← links)
• Polyhedral study of the capacitated vehicle routing problem (Q688914) (← links)
• A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants (Q716345) (← links)
• A spectral approach to polyhedral dimension (Q750306) (← links)
• Optimizing over the subtour polytope of the travelling salesman problem (Q803048) (← links)
• Solution of large-scale symmetric travelling salesman problems (Q810369) (← links)
• On the graphical relaxation of the symmetric traveling salesman polytope (Q877195) (← links)
• Chvátal closures for mixed integer programming problems (Q922950) (← links)
• Recent advances in vehicle routing exact algorithms (Q926561) (← 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)
• On the domino-parity inequalities for the STSP (Q985309) (← links)
• Certification of an optimal TSP tour through 85,900 cities (Q1002076) (← links)
• The optimum assignments and a new heuristic approach for the traveling salesman problem (Q1051562) (← links)
• \(K_ i\)-covers. I: Complexity and polytopes (Q1070249) (← links)
• A cutting plane procedure for the travelling salesman problem on road networks (Q1072449) (← links)
• A new class of cutting planes for the symmetric travelling salesman problem (Q1107441) (← links)
• On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
• On minimal Eulerian graphs (Q1162523) (← links)
• Polyhedral results for a vehicle routing problem (Q1176821) (← links)
• The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities (Q1181903) (← links)
• On symmetric subtour problems (Q1202764) (← links)
• Clique tree inequalities define facets of the asymmetric traveling salesman polytope (Q1343150) (← links)
• Survey of facial results for the traveling salesman polytope (Q1596750) (← links)
• Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm (Q1622797) (← links)
• Local search inequalities (Q1751111) (← links)
• A computational comparison of flow formulations for the capacitated location-routing problem (Q1799384) (← links)
• The skeleton of the symmetric Traveling Salesman Polytope (Q1801669) (← links)
• The graphical relaxation: A new framework for the symmetric traveling salesman polytope (Q1803616) (← links)
• Hamiltonian path and symmetric travelling salesman polytopes (Q1803617) (← links)
• The general routing polyhedron: A unifying framework (Q1806888) (← links)
• Facets and algorithms for capacitated lot sizing (Q1823857) (← links)
• Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies (Q1919186) (← links)
• Galois connections for phylogenetic networks and their polytopes (Q2045067) (← links)
• The multiple Steiner TSP with order constraints: complexity and optimization algorithms (Q2156919) (← links)
• On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms (Q2241575) (← links)
• On the Chvátal-Gomory closure of a compact convex set (Q2248755) (← links)
• A combinatorial approach to nonlocality and contextuality (Q2258010) (← links)
• Path planning for unmanned vehicles with localization constraints (Q2311193) (← links)
• On the facial structure of symmetric and graphical traveling salesman polyhedra (Q2339807) (← 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)
• The 2-edge-connected subgraph polyhedron (Q2576774) (← links)
• New techniques for cost sharing in combinatorial optimization games (Q2638367) (← links)