A note on the undirected rural postman problem polytope
From MaRDI portal
Publication:2492671
DOI10.1007/s10107-005-0640-1zbMath1134.90054MaRDI QIDQ2492671
Dirk Oliver Theis, Gerhard Reinelt
Publication date: 14 June 2006
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-005-0640-1
90C35: Programming involving graphs or networks
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
05C45: Eulerian and Hamiltonian graphs
Related Items
Polyhedral analysis and a new algorithm for the length constrained \(K\)-drones rural postman problem, On the general routing polytope
Cites Work
- New inequalities for the general routing problem
- A branch-and-cut algorithm for the undirected rural postman problem
- On finding spanning eulerian subgraphs
- An algorithm for the Rural Postman problem on a directed graph
- Supereulerian graphs: A survey
- On general routing problems
- Transformation of Facets of the General Routing Problem Polytope