Polyhedral analysis and a new algorithm for the length constrained \(K\)-drones rural postman problem

DOI10.1007/s10589-022-00383-xzbMath1496.90071OpenAlexW4283278550MaRDI QIDQ2162526

James F. Campbell, Isaac Plana, Paula Segura, Angel Corberán, José María Sanchis

Publication date: 8 August 2022

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-022-00383-x

zbMATH Keywords

branch and cutrural postman problemfacetsdroneslength constraints

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• A branch-and-cut algorithm for the maximum benefit Chinese postman problem
• On the cycle polytope of a binary matroid
• The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra
• A polyhedral approach to the rural postman problem
• The mixed general routing polyhedron
• A branch-and-cut algorithm for the undirected rural postman problem
• Solving the length constrained \(K\)-drones rural postman problem
• Routing for unmanned aerial vehicles: touring dimensional sets
• A note on the undirected rural postman problem polytope
• Coordinating drones with mothership vehicles: the mothership and drone routing problem with graphs
• On crossings, the Crossing Postman Problem, and the Rural Postman Problem
• Odd Minimum Cut Sets and b-Matchings Revisited
• Odd Minimum Cut-Sets and b-Matchings
• Arc Routing
• A branch & cut algorithm for the windy general routing problem and special cases
• A cutting plane algorithm for the general routing problem
• Arc routing problems: A review of the past, present, and future

This page was built for publication: Polyhedral analysis and a new algorithm for the length constrained \(K\)-drones rural postman problem