Title of article :
On the general routing polytope Original Research Article
Author/Authors :
Gerhard Reinelt، نويسنده , , Dirk Oliver Theis، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2008
Abstract :
The General Routing Problem (GRP) consists of finding a minimum length closed walk in an edge-weighted undirected graph, subject to containing certain sets of required nodes and edges. It is related to the Rural Postman Problem and the Graphical Traveling Salesman Problem.
Keywords :
Rural Postman Problem , General Routing Problem , Facet , Polyhedral combinatorics , dimension
Journal title :
Discrete Applied Mathematics
Journal title :
Discrete Applied Mathematics
