scientific article; zbMATH DE number 5764858

MaRDI QIDQ3579451zbMATH OpenFDO

Authors Chandra Chekuri, Nitish Korula, Martin Pál

Publication date 6 August 2010

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cited in

(16)

• A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs
• The capacitated orienteering problem
• scientific article; zbMATH DE number 7053373 (Why is no real title available?)
• Capacitated vehicle routing with non-uniform speeds
• The school bus problem on trees
• Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
• A fast and effective heuristic for the orienteering problem
• The directed orienteering problem
• Approximation algorithms for the directed \(k\)-Tour and \(k\)-Stroll problems
• Approximation algorithms for the traveling repairman and speeding deliveryman problems
• Orienteering problem: a survey of recent variants, solution approaches and applications
• scientific article; zbMATH DE number 1839476 (Why is no real title available?)
• Optimal deterministic algorithms for some variants of online quota traveling salesman problem
• The clustered orienteering problem
• The Directed Minimum Latency Problem
• Pruning 2-connected graphs

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 Q3579451)