Mixed-integer programming approaches for the time-constrained maximal covering routing problem
From MaRDI portal
Publication:2241905
DOI10.1007/s00291-021-00635-yzbMath1476.90060OpenAlexW3163578062MaRDI QIDQ2241905
Publication date: 9 November 2021
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-021-00635-y
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Orienteering problem: a survey of recent variants, solution approaches and applications
- Solving the team orienteering problem with cutting planes
- Time constrained maximal covering salesman problem with weighted demands and partial coverage
- The selective travelling salesman problem
- The team orienteering problem
- An optimal solution procedure for the multiple tour maximum collection problem using column generation
- Strong linear programming relaxations for the orienteering problem
- A mixed-integer model for solving ordering problems with side constraints
- The time constrained maximal covering salesman problem
- An exact algorithm for team orienteering problems
- The Team Orienteering Problem: Formulations and Branch-Cut and Price
- Vehicle Routing
- Integer Programming
- The orienteering problem
- TSPLIB—A Traveling Salesman Problem Library
- Solving the Orienteering Problem through Branch-and-Cut
- Solving Steiner tree problems in graphs to optimality
- A branch‐and‐cut algorithm for the Team Orienteering Problem
- A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem
- On implementing push-relabel method for the maximum flow problem
- Location Science
This page was built for publication: Mixed-integer programming approaches for the time-constrained maximal covering routing problem
