Time constrained maximal covering salesman problem with weighted demands and partial coverage

DOI10.1016/j.cor.2016.06.019zbMath1349.90117OpenAlexW2472000320MaRDI QIDQ342578

Gizem Ozbaygin, Hande Yaman, Oya Ekin Karaşan

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/36857

zbMATH Keywords

valid inequalitiesbranch-and-cutcovering salesman

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items (9)

Metaheuristics for the distance constrained generalized covering traveling salesman problem ⋮ Exact algorithms for budgeted prize-collecting covering subgraph problems ⋮ Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems ⋮ A data-driven optimization framework for routing mobile medical facilities ⋮ Robust strategic planning for mobile medical units with steerable and unsteerable demands ⋮ Mixed-integer programming approaches for the time-constrained maximal covering routing problem ⋮ A branch-and-cut algorithm for the maximum covering cycle problem ⋮ A covering traveling salesman problem with profit in the last mile delivery ⋮ Spatial coverage in routing and path planning problems

Cites Work

• Unnamed Item
• The orienteering problem: a survey
• The bi-objective covering tour problem
• The selective travelling salesman problem
• The median tour and maximal covering tour problems: Formulations and heuristics
• Approximation algorithms for the Geometric Covering Salesman Problem
• The time constrained maximal covering salesman problem
• The bi-objective stochastic covering tour problem
• Heuristics for the multi-vehicle covering tour problem
• The Generalized Covering Salesman Problem
• Survivability in hierarchical telecommunications networks
• The orienteering problem
• AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• The Covering Tour Problem
• A simple min-cut algorithm
• The Covering Salesman Problem
• Uma Metaheurística GRASP/VNS para uma Solução Aproximada do Problema de Recobrimento de Rotas

This page was built for publication: Time constrained maximal covering salesman problem with weighted demands and partial coverage