Time-constrained maximal covering routing problem

DOI10.1007/S00291-018-0541-3MaRDI QIDQ6483633zbMATH OpenWikidataFDO

Authors Majid Salari

Publication date 15 January 2020

Published in OR Spectrum (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00291-018-0541-3

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Mixed integer programming (90C11)

Recommendations

• The time constrained maximal covering salesman problem
• Mixed-integer programming approaches for the time-constrained maximal covering routing problem
• Time constrained maximal covering salesman problem with weighted demands and partial coverage
• Maximal covering salesman problems with average travelling cost constraints
• An integer programming-based local search for the covering salesman problem

Cited in

(4)

• An elliptical cover problem in drone delivery network design and its solution algorithms
• Approximation algorithms for solving the trip-constrained vehicle routing cover problems
• Modeling a humanitarian-aid covering tour problem with location selection and vehicle assignment decisions
• A novel robust decomposition algorithm for a profit-oriented production routing problem with backordering, uncertain prices, and service level constraints

This page was built for publication: Time-constrained maximal covering routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6483633)