The Steiner cycle polytope

DOI10.1016/S0377-2217(02)00359-4zbMath1031.90028OpenAlexW1993862500MaRDI QIDQ1873013

Juan-José Salazar-González

Publication date: 19 May 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00359-4

zbMATH Keywords

FacetsSteiner treesTravelling salesmanPolyhedra

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (9)

Quasilinear approximation scheme for Steiner multi cycle in the Euclidean plane ⋮ The multiple Steiner TSP with order constraints: complexity and optimization algorithms ⋮ Directed Steiner trees with diffusion costs ⋮ Randomized approximation scheme for Steiner multi cycle in the Euclidean plane ⋮ Approximations for the Steiner multicycle problem ⋮ The common face of some 0/1-polytopes with NP-complete nonadjacency relation ⋮ Unnamed Item ⋮ The Steiner cycle and path cover problem on interval graphs ⋮ Steiner Problems with Limited Number of Branching Nodes

Cites Work

• The Steiner tree polytope and related polyhedra
• Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
• The Circuit Polytope: Facets
• The symmetric generalized traveling salesman polytope
• On cycle cones and polyhedra
• Steiner tree problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Steiner cycle polytope