scientific article; zbMATH DE number 2086925

MaRDI QIDQ4737530zbMATH OpenFDO

Authors René A. Sitters

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2337/23370230.htm

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 2090008
• An improved approximation ratio for the minimum latency problem
• scientific article; zbMATH DE number 871910
• The minimum latency problem
• Approximation schemes for minimum latency problems

Cited in

(27)

• On the power of lookahead in on-line server routing problems
• The expanding search ratio of a graph
• A survey on combinatorial optimization in dynamic environments
• scientific article; zbMATH DE number 3956440 (Why is no real title available?)
• The A priori traveling repairman problem
• Minimizing latency of capacitated \(k\)-tours
• Approximation and complexity of multi-target graph search and the Canadian traveler problem
• A new formulation for the traveling deliveryman problem
• Exact and Approximation Algorithms for the Expanding Search Problem
• Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems
• A branch-and-price algorithm for the minimum latency problem
• Tree optimization based heuristics and metaheuristics in network construction problems
• Routing under uncertainty: the \textit{a priori} traveling repairman problem
• An improved online algorithm for the traveling repairperson problem on a line
• Profit-based latency problems on the line
• Approximation algorithms for the a priori traveling repairman
• Vehicle routing problems on a line-shaped network with release time constraints
• Exact algorithms for the minimum latency problem
• scientific article; zbMATH DE number 2090008 (Why is no real title available?)
• Optimally solving a versatile traveling salesman problem on tree networks with soft due dates and multiple congestion scenarios
• Search and delivery man problems: when are depth-first paths optimal?
• Some notes on bounded starwidth graphs
• A simple and effective metaheuristic for the minimum latency problem
• Network construction/restoration problems: cycles and complexity
• 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
• The Chinese deliveryman problem

This page was built for publication:

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