The rural postman problem with deadline classes

DOI10.1016/S0377-2217(97)00090-8MaRDI QIDQ1291753zbMATHOpenAlexWikidataFDO

Authors Adam N. Letchford, Richard 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 programmingtime windowsrural postman problemcutting-planes

Mathematics Subject Classification ID

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

Recommendations

• A branch-and-bound algorithm for the time-dependent rural postman problem
• Survey Paper—Time Window Constrained Routing and Scheduling Problems
• The time-dependent rural postman problem: polyhedral results
• Algorithms for the Vehicle Routing Problems with Time Deadlines
• Vehicle Routing with Time Windows

Cites work

• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1263277 (Why is no real title available?)
• scientific article; zbMATH DE number 956787 (Why is no real title available?)
• A fundamental problem in vehicle routing
• A polyhedral approach to the rural postman problem
• Algorithms for the Vehicle Routing Problems with Time Deadlines
• An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
• Arc Routing Problems, Part I: The Chinese Postman Problem
• Arc Routing Problems, Part II: The Rural Postman Problem
• New inequalities for the general routing problem
• Odd Minimum Cut-Sets and b-Matchings
• On general routing problems
• Separating maximally violated comb inequalities in planar graphs
• The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra

Cited in

(9)

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

This page was built for publication: The rural postman problem with deadline classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1291753)