The following pages link to (Q4737530):
Displaying 25 items.
- The A priori traveling repairman problem (Q722527) (← links)
- Minimizing latency of capacitated \(k\)-tours (Q724250) (← links)
- Exact algorithms for the minimum latency problem (Q834971) (← links)
- Profit-based latency problems on the line (Q943793) (← links)
- On the power of lookahead in on-line server routing problems (Q959800) (← links)
- A new formulation for the traveling deliveryman problem (Q1003469) (← links)
- Vehicle routing problems on a line-shaped network with release time constraints (Q1015302) (← links)
- Approximation and complexity of multi-target graph search and the Canadian traveler problem (Q1637225) (← links)
- A branch-and-price algorithm for the minimum latency problem (Q1652580) (← links)
- The expanding search ratio of a graph (Q1741496) (← links)
- A simple and effective metaheuristic for the minimum latency problem (Q1926884) (← links)
- The Chinese deliveryman problem (Q2025136) (← links)
- Tree optimization based heuristics and metaheuristics in network construction problems (Q2027081) (← links)
- Network construction/restoration problems: cycles and complexity (Q2168711) (← links)
- Search and delivery man problems: when are depth-first paths optimal? (Q2184055) (← links)
- Optimally solving a versatile traveling salesman problem on tree networks with soft due dates and multiple congestion scenarios (Q2294628) (← links)
- Reoptimization of minimum latency problem revisited: don't panic when asked to revisit the route after local modifications (Q2420657) (← links)
- Approximating the \(k\)-traveling repairman problem with repair times (Q2457300) (← links)
- Some notes on bounded starwidth graphs (Q2628278) (← links)
- Approximation algorithms for the a priori traveling repairman (Q2661528) (← links)
- A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
- Routing Under Uncertainty: The a priori Traveling Repairman Problem (Q3453299) (← links)
- Exact and Approximation Algorithms for the Expanding Search Problem (Q5084651) (← links)
- An Improved Online Algorithm for the Traveling Repairperson Problem on a Line (Q5092364) (← links)
- Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems (Q5860477) (← links)
