Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem

DOI10.1007/s13675-015-0053-8zbMath1390.90394OpenAlexW2212020139MaRDI QIDQ1707079

Thais Ávila, Isaac Plana, Angel Corberán, José María Sanchis

Publication date: 28 March 2018

Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10251/107412

zbMATH Keywords

branch-and-cutdistance constrainedclose-enough arc routing problemgeneralized directed rural postman problemmultivehicle

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Operations research and management science (90B99)

Related Items (8)

The profitable close-enough arc routing problem ⋮ An improved multi-objective framework for the rich arc routing problem ⋮ The generalized arc routing problem ⋮ Arc routing problems: A review of the past, present, and future ⋮ A matheuristic for the distance-constrained close-enough arc routing problem ⋮ On the distance-constrained close enough arc routing problem ⋮ Spatial coverage in routing and path planning problems ⋮ The min-max close-enough arc routing problem

Cites Work

• A branch-and-cut algorithm for the profitable windy rural postman problem
• Lower bounds and heuristics for the windy rural postman problem
• Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems
• Solving the close-enough arc routing problem
• Min-Max K -vehicles windy rural postman problem
• Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network
• Multi-Terminal Network Flows
• The Covering Tour Problem

This page was built for publication: Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem