scientific article; zbMATH DE number 6297719
From MaRDI portal
Publication:5417636
zbMath1288.68100MaRDI QIDQ5417636
Publication date: 22 May 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (11)
A branch-and-price algorithm for the minimum latency problem ⋮ A simple and effective metaheuristic for the minimum latency problem ⋮ The multi-vehicle cumulative covering tour problem ⋮ Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining ⋮ An adaptive large neighborhood search approach for multiple traveling repairman problem with profits ⋮ Minimizing latency of capacitated \(k\)-tours ⋮ On combining machine learning with decision making ⋮ A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits ⋮ An Improved Online Algorithm for the Traveling Repairperson Problem on a Line ⋮ Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems ⋮ Solving the traveling delivery person problem with limited computational time
This page was built for publication:
