Transformation of Facets of the General Routing Problem Polytope

DOI10.1137/040607307MaRDI QIDQ5317556zbMATH OpenOpenAlexFDO

Authors Dirk Oliver Theis, Gerhard Reinelt

Publication date 16 September 2005

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/040607307

zbMATH Keywords

polytopefacetsseparationgeneral routing problemrural postman problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Symmetry properties of polytopes (52B15)

Recommendations

• scientific article; zbMATH DE number 5021774
• The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra
• New inequalities for the general routing problem
• The general routing polyhedron: A unifying framework
• On the general routing polytope

Cited in

(7)

• The Steiner traveling salesman problem and its extensions
• scientific article; zbMATH DE number 5021774 (Why is no real title available?)
• A transformation for the mixed general routing problem with turn penalties
• A branch-and-cut algorithm for the maximum benefit Chinese postman problem
• Recent results on arc routing problems: an annotated bibliography
• On the general routing polytope
• A note on the undirected rural postman problem polytope

This page was built for publication: Transformation of Facets of the General Routing Problem Polytope

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317556)