Two improved formulations for the minimum latency problem

DOI10.1016/j.apm.2012.05.026zbMath1349.90154OpenAlexW2036200993MaRDI QIDQ346133

Francisco Angel-Bello, Irma García, Ada M. 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

zbMATH Keywords

repairman problemcomputational evaluationdeliveryman problemdirected minimum latency probleminteger formulations

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic network models in operations research (90B10)

Related Items (10)

New formulations and solution approaches for the latency location routing problem ⋮ An online optimization approach for post-disaster relief distribution with online blocked edges ⋮ Routing multiple work teams to minimize latency in post-disaster road network restoration ⋮ Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining ⋮ Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization ⋮ An iterated local search algorithm for latency vehicle routing problems with multiple depots ⋮ Minimizing latency in post-disaster road clearance operations ⋮ Minimizing customers' waiting time in a vehicle routing problem with unit demands ⋮ Weighted online minimum latency problem with edge uncertainty ⋮ A truck and drones model for last-mile delivery: a mathematical model and heuristic approach

This page was built for publication: Two improved formulations for the minimum latency problem