The rural postman problem with deadline classes

DOI10.1016/S0377-2217(97)00090-8zbMath0955.90111OpenAlexW2091251824WikidataQ57702400 ScholiaQ57702400MaRDI QIDQ1291753

Adam N. Letchford, Richard W. Eglese

Publication date: 22 February 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00090-8

zbMATH Keywords

integer programmingrural postman problemtime windowscutting-planes

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items

The target visitation arc routing problem, Heuristics for a dynamic rural postman problem, Arc routing problems: A review of the past, present, and future, A Decade of Capacitated Arc Routing, The windy rural postman problem with a time-dependent zigzag option, The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm, Recent results on Arc Routing Problems: An annotated bibliography, Heuristics for single-pass welding task sequencing, On the hierarchical Chinese postman problem with linear ordered classes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New inequalities for the general routing problem
• The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra
• A polyhedral approach to the rural postman problem
• Separating Maximally Violated Comb Inequalities in Planar Graphs
• Odd Minimum Cut-Sets and b-Matchings
• On general routing problems
• A fundamental problem in vehicle routing
• Algorithms for the Vehicle Routing Problems with Time Deadlines
• Arc Routing Problems, Part I: The Chinese Postman Problem
• An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
• Arc Routing Problems, Part II: The Rural Postman Problem