scientific article; zbMATH DE number 2086925
From MaRDI portal
Publication:4737530
zbMath1049.90531MaRDI QIDQ4737530
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2337/23370230.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)
Related Items (25)
Exact algorithms for the minimum latency problem ⋮ Some notes on bounded starwidth graphs ⋮ Routing Under Uncertainty: The a priori Traveling Repairman Problem ⋮ Approximation and complexity of multi-target graph search and the Canadian traveler problem ⋮ A survey on combinatorial optimization in dynamic environments ⋮ A branch-and-price algorithm for the minimum latency problem ⋮ Network construction/restoration problems: cycles and complexity ⋮ Exact and Approximation Algorithms for the Expanding Search Problem ⋮ Approximation algorithms for the a priori traveling repairman ⋮ A simple and effective metaheuristic for the minimum latency problem ⋮ Search and delivery man problems: when are depth-first paths optimal? ⋮ Reoptimization of minimum latency problem revisited: don't panic when asked to revisit the route after local modifications ⋮ Approximating the \(k\)-traveling repairman problem with repair times ⋮ Profit-based latency problems on the line ⋮ The expanding search ratio of a graph ⋮ On the power of lookahead in on-line server routing problems ⋮ The Chinese deliveryman problem ⋮ Tree optimization based heuristics and metaheuristics in network construction problems ⋮ The A priori traveling repairman problem ⋮ Minimizing latency of capacitated \(k\)-tours ⋮ A new formulation for the traveling deliveryman problem ⋮ Optimally solving a versatile traveling salesman problem on tree networks with soft due dates and multiple congestion scenarios ⋮ Vehicle routing problems on a line-shaped network with release time constraints ⋮ 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
This page was built for publication:
