The time constrained maximal covering salesman problem
From MaRDI portal
Publication:1631991
DOI10.1016/J.APM.2014.01.001zbMath1428.90173OpenAlexW1989780284MaRDI QIDQ1631991
Majid Salari, Zahra Naji-Azimi
Publication date: 12 December 2018
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2014.01.001
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (4)
Exact algorithms for budgeted prize-collecting covering subgraph problems ⋮ Time constrained maximal covering salesman problem with weighted demands and partial coverage ⋮ A multi‐vehicle covering tour problem with speed optimization ⋮ Mixed-integer programming approaches for the time-constrained maximal covering routing problem
Uses Software
Cites Work
- Unnamed Item
- The orienteering problem: a survey
- An ILP improvement procedure for the open vehicle routing problem
- The median tour and maximal covering tour problems: Formulations and heuristics
- An integer programming-based local search for the covering salesman problem
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Solving the maximal covering location problem with heuristic concentration
- A new ILP-based refinement heuristic for vehicle routing problems
- The Generalized Covering Salesman Problem
- Integer Programming Formulation of Traveling Salesman Problems
- An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems
- The orienteering problem
- The prize collecting traveling salesman problem
- TSPLIB—A Traveling Salesman Problem Library
- The Covering Tour Problem
- The Covering Salesman Problem
This page was built for publication: The time constrained maximal covering salesman problem
