Two improved formulations for the minimum latency problem
From MaRDI portal
Publication:346133
DOI10.1016/J.APM.2012.05.026zbMATH Open1349.90154OpenAlexW2036200993MaRDI QIDQ346133FDOQ346133
Authors: Francisco Angel-Bello, Irma García, Ada Alvarez 
Publication date: 5 December 2016
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2012.05.026
Recommendations
repairman problemcomputational evaluationdeliveryman problemdirected minimum latency probleminteger formulations
Cited In (14)
- A truck and drones model for last-mile delivery: a mathematical model and heuristic approach
- Minimization of the total completion time for asynchronous transmission in a packet data-transmission system
- Minimizing customers' waiting time in a vehicle routing problem with unit demands
- Routing multiple work teams to minimize latency in post-disaster road network restoration
- Minimum cost perfect matching with delays for two sources
- Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization
- Weighted online minimum latency problem with edge uncertainty
- New formulations and solution approaches for the latency location routing problem
- Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining
- An online optimization approach for post-disaster relief distribution with online blocked edges
- On the minimum delay problem
- Approximation schemes for minimum latency problems
- Minimizing latency in post-disaster road clearance operations
- An iterated local search algorithm for latency vehicle routing problems with multiple depots
This page was built for publication: Two improved formulations for the minimum latency problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q346133)
