Feasibility of the Mixed Postman Problem with Restrictions on the Edges
نویسنده
چکیده
منابع مشابه
Approximation Algorithms for a Mixed Postman Problem with Restrictions on the Arcs
The mixed postman problem consists of finding a minimum cost tour of a mixed graph traversing all its vertices, edges, and arcs at least once. We consider the variant of the mixed postman problem where all arcs must be traversed exactly once and we transform it into a minimum cost feasible flow on an undirected graph. The decision version of our problem is NP-complete even if restricted to plan...
متن کاملChinese Postman Problem on Edge-Colored Multigraphs
It is well-known that the Chinese Postman Problem on undirected and directed graphs is polynomial-time solvable. We extend this result to edge-colored multigraphs. Our result is in sharp contrast to the Chinese Postman Problem on mixed graphs, i.e., graphs with directed and undirected edges, for which the problem is NP-hard.
متن کاملOn the mixed Chinese postman problem
The mixed Chinese postman problem is a version of the well-known Chinese postman problem in which the underlying graph consists of both directed and undirected edges. We give an integer linear programming formulation for this problem and then show that the extreme points of its linear relaxation polyhedron are all half-integral. keywords: Chinese postman problem, half-integrality, graph, flow
متن کاملThe mixed general routing polyhedron
In Arc Routing Problems, ARPs, the aim is to find on a graph a minimum cost traversal satisfying some conditions related to the links of the graph. Due to restrictions to traverse some streets in a specified way, most applications of ARPs must be modeled with a mixed graph. Although several exact algorithms have been proposed, no polyhedral investigations have been done for ARPs on a mixed grap...
متن کاملA branch-price-and-cut method for the min-max k-windy rural postman problem
Given the edges of a graph, the postman problem consists of determining for a vehicle (postman) a shortest route that traverses all edges at least once. Each edge can be traversed in either direction and, when an edge is traversed more than once, the vehicle is said to be deadheading after its first traversal. The rural postman problem is the same as the postman problem except that the edges ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 29 شماره
صفحات -
تاریخ انتشار 2007