Pages that link to "Item:Q4785216"
From MaRDI portal
The following pages link to A note on the traveling repairman problem (Q4785216):
Displayed 15 items.
- Solving the traveling repairman problem on a line with general processing times and deadlines (Q319440) (← links)
- Maintenance scheduling of geographically distributed assets with prognostics information (Q319618) (← links)
- Finding optimal tour schedules on transportation paths under extended time window constraints (Q341462) (← links)
- Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem (Q548680) (← links)
- Exact algorithms for the minimum latency problem (Q834971) (← links)
- Profit-based latency problems on the line (Q943793) (← links)
- Vehicle routing problems on a line-shaped network with release time constraints (Q1015302) (← links)
- Vehicle scheduling with combinable delivery and pickup operations (Q1043247) (← links)
- A branch-and-price algorithm for the minimum latency problem (Q1652580) (← links)
- The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach (Q1926737) (← links)
- A simple and effective metaheuristic for the minimum latency problem (Q1926884) (← links)
- Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints (Q2256169) (← links)
- Combining traveling salesman and traveling repairman problems: a multi-objective approach based on multiple scenarios (Q2329723) (← links)
- Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon (Q2392920) (← links)
- Single-vehicle scheduling problems with release and service times on a line (Q3082601) (← links)