Pages that link to "Item:Q3048581"

The following pages link to On the symmetric travelling salesman problem II: Lifting theorems and facets (Q3048581):

Displaying 37 items.

• Light on the infinite group relaxation. I: Foundations and taxonomy (Q262442) (← links)
• An extended approach for lifting clique tree inequalities (Q498425) (← links)
• On the \({\mathcal {H}}\)-free extension complexity of the TSP (Q519756) (← links)
• Minimum-weight two-connected spanning networks (Q582215) (← links)
• Recent trends in combinatorial optimization (Q788638) (← links)
• Optimizing over the subtour polytope of the travelling salesman problem (Q803048) (← links)
• Solution of large-scale symmetric travelling salesman problems (Q810369) (← links)
• Facet identification for the symmetric traveling salesman polytope (Q918865) (← links)
• George Dantzig's contributions to integer programming (Q951090) (← links)
• Exploiting planarity in separation routines for the symmetric traveling salesman problem (Q951094) (← links)
• Polarity and the complexity of the shooting experiment (Q951126) (← links)
• On the domino-parity inequalities for the STSP (Q985309) (← links)
• The optimum assignments and a new heuristic approach for the traveling salesman problem (Q1051562) (← links)
• The complexity of facets (and some facets of complexity) (Q1061485) (← links)
• The complexity of facets resolved (Q1109565) (← links)
• On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
• Clique tree inequalities define facets of the asymmetric traveling salesman polytope (Q1343150) (← links)
• On the magnetisation of the ground states in two dimensional Ising spin glasses (Q1344221) (← links)
• Survey of facial results for the traveling salesman polytope (Q1596750) (← links)
• The graphical relaxation: A new framework for the symmetric traveling salesman polytope (Q1803616) (← links)
• Hamiltonian path and symmetric travelling salesman polytopes (Q1803617) (← links)
• Facets and algorithms for capacitated lot sizing (Q1823857) (← links)
• The time dependent traveling salesman problem: polyhedra and algorithm (Q1947199) (← links)
• Polyhedron of triangle-free simple 2-matchings in subcubic graphs (Q1949271) (← 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 the Chvátal-Gomory closure of a compact convex set (Q2248755) (← links)
• On the facial structure of symmetric and graphical traveling salesman polyhedra (Q2339807) (← links)
• The symmetric quadratic traveling salesman problem (Q2434982) (← links)
• Separation, dimension, and facet algorithms for node flow polyhedra (Q2638390) (← links)
• Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q2687063) (← links)
• Facet Generating Techniques (Q2971603) (← links)
• On the Chvátal-Gomory Closure of a Compact Convex Set (Q3009756) (← links)
• On the symmetric travelling salesman problem I: Inequalities (Q3048580) (← links)
• A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem (Q3057103) (← links)
• A New Formulation for the Travelling Salesman Problem (Q3315280) (← links)
• Minimum‐weight subgraphs with unicyclic components and a lower‐bounded girth (Q5326798) (← links)