Transformation of Facets of the General Routing Problem Polytope

DOI10.1137/040607307zbMath1114.90107OpenAlexW2094369861MaRDI QIDQ5317556

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

polytopegeneral routing problemrural postman problemseparationfacets

Mathematics Subject Classification ID

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

Related Items (5)

A branch-and-cut algorithm for the maximum benefit Chinese postman problem ⋮ On the general routing polytope ⋮ The Steiner traveling salesman problem and its extensions ⋮ A note on the undirected rural postman problem polytope ⋮ Recent results on Arc Routing Problems: An annotated bibliography

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