Pages that link to "Item:Q2892157"
From MaRDI portal
The following pages link to Approximation algorithms for distance constrained vehicle routing problems (Q2892157):
Displaying 31 items.
- The \(k\)-dissimilar vehicle routing problem (Q319301) (← links)
- Improved approximation algorithms for some min-max and minimum cycle cover problems (Q344767) (← links)
- The school bus problem on trees (Q378249) (← links)
- The capacitated orienteering problem (Q496434) (← links)
- Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems (Q517802) (← links)
- Set covering in fuel-considered vehicle routing problems (Q896127) (← links)
- Probabilistic time-dependent vehicle routing problem (Q1788926) (← links)
- Vehicle routing with subtours (Q2010917) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity (Q2156303) (← links)
- Combinatorial algorithms for rooted prize-collecting walks and applications to orienteering and minimum-latency problems (Q2164695) (← links)
- Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints (Q2169436) (← links)
- The median routing problem for simultaneous planning of emergency response and non-emergency jobs (Q2183877) (← links)
- Data mule scheduling on a path with handling time and time span constraints (Q2228361) (← links)
- New LP relaxations for minimum cycle/path/tree cover problems (Q2283007) (← links)
- An approximation algorithm for vehicle routing with compatibility constraints (Q2294242) (← links)
- Distance constrained vehicle routing problem to minimize the total cost (Q2300077) (← links)
- Better approximability results for min-max tree/cycle/path cover problems (Q2420656) (← links)
- Approximation algorithms for distance constraint sweep coverage with base stations (Q2424716) (← links)
- Approximation Algorithms for Generalized Bounded Tree Cover (Q2803829) (← links)
- Improved Approximation Algorithms for the Min-Max Tree Cover and Bounded Tree Cover Problems (Q3088103) (← links)
- Approximation Algorithms for Conflict-Free Vehicle Routing (Q3092267) (← links)
- Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems (Q3196380) (← links)
- Prize-Collecting TSP with a Budget Constraint (Q5111751) (← links)
- Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems (Q5119847) (← links)
- Approximations for minimum and min-max vehicle routing problems (Q5491457) (← links)
- New approximation algorithms for the rooted budgeted cycle cover problem (Q5918725) (← links)
- Approximation algorithms for some minimum postmen cover problems (Q5918771) (← links)
- New approximation algorithms for the minimum cycle cover problem (Q5919633) (← links)
- New approximation algorithms for the rooted budgeted cycle cover problem (Q5925709) (← links)
- Exact and approximation algorithms for the multi-depot data mule scheduling with handling time and time span constraints (Q6606172) (← links)
