Pages that link to "Item:Q2457300"
From MaRDI portal
The following pages link to Approximating the \(k\)-traveling repairman problem with repair times (Q2457300):
Displaying 14 items.
- Maintenance scheduling of geographically distributed assets with prognostics information (Q319618) (← links)
- Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem (Q320880) (← links)
- Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems (Q517802) (← links)
- Polynomial formulation and heuristic based approach for the \(k\)-travelling repairman problem (Q1753757) (← links)
- Vehicle routing with subtours (Q2010917) (← links)
- The multi-depot \(k\)-traveling repairman problem (Q2091220) (← links)
- The arc-item-load and related formulations for the cumulative vehicle routing problem (Q2172084) (← links)
- A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem (Q2340494) (← links)
- A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (Q2514732) (← links)
- Approximation algorithms for distance constrained vehicle routing problems (Q2892157) (← links)
- Improved Approximation Algorithms for the Min-Max Tree Cover and Bounded Tree Cover Problems (Q3088103) (← links)
- The complexity of the travelling repairman problem (Q3709900) (← links)
- Approximation Algorithms for Capacitated k-Travelling Repairmen Problems. (Q4636540) (← links)
- LATIN 2004: Theoretical Informatics (Q5901662) (← links)
