On crossings, the Crossing Postman Problem, and the Rural Postman Problem

DOI<173::AID-NET1>3.0.CO;2-W 10.1002/(SICI)1097-0037(199910)34:3<173::AID-NET1>3.0.CO;2-WzbMath0980.90095OpenAlexW1986955497MaRDI QIDQ2766099

Robert Garfinkel, Ian R. Webb

Publication date: 27 January 2002

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199910)34:3<173::aid-net1>3.0.co;2-w

zbMATH Keywords

networkpostman problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (8)

Polyhedral analysis and a new algorithm for the length constrained \(K\)-drones rural postman problem ⋮ Mathematical models and routing algorithms for CAD technological preparation of cutting processes ⋮ Heuristics for a dynamic rural postman problem ⋮ A partitioning column approach for solving LED sorter manipulator path planning problems ⋮ Arc routing problems: A review of the past, present, and future ⋮ Recent results on Arc Routing Problems: An annotated bibliography ⋮ The estimation of the number of OE-chains and realizable OE-routes for cutting plans with combined contours ⋮ Routing for unmanned aerial vehicles: touring dimensional sets

This page was built for publication: On crossings, the Crossing Postman Problem, and the Rural Postman Problem