The multi‐purpose K‐drones general routing problem
From MaRDI portal
Publication:6180030
DOI10.1002/net.22176MaRDI QIDQ6180030
Angel Corberán, James F. Campbell, Paula Segura, José María Sanchis, Isaac Plana
Publication date: 18 January 2024
Published in: Networks (Search for Journal in Brave)
general routing problembranch-and-cutlogisticscapacity constraintsmatheuristicdronesmax-time constraints
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- A branch-and-cut algorithm for the maximum benefit Chinese postman problem
- The fleet size and mix problem for capacitated arc routing
- On the cycle polytope of a binary matroid
- Variable neighborhood search
- 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
- Tour splitting algorithms for vehicle routing problems
- Odd Minimum Cut Sets and b-Matchings Revisited
- Odd Minimum Cut-Sets and b-Matchings
- A fundamental problem in vehicle routing
- A branch & cut algorithm for the windy general routing problem and special cases
This page was built for publication: The multi‐purpose K‐drones general routing problem
