Pages that link to "Item:Q3189064"
From MaRDI portal
The following pages link to Improved algorithms for orienteering and related problems (Q3189064):
Displaying 20 items.
- Approximation algorithms for the arc orienteering problem (Q477675) (← links)
- Minisum and maximin aerial surveillance over disjoint rectangles (Q518456) (← links)
- On the adaptivity gap of stochastic orienteering (Q896283) (← links)
- Maximum coverage problem with group budget constraints (Q1680483) (← links)
- Discounted reward TSP (Q1709577) (← links)
- Faster algorithms for orienteering and \(k\)-TSP (Q2124233) (← links)
- Combinatorial algorithms for rooted prize-collecting walks and applications to orienteering and minimum-latency problems (Q2164695) (← links)
- An approximation algorithm for vehicle routing with compatibility constraints (Q2294242) (← links)
- Orienteering for electioneering (Q2417102) (← links)
- Complexity and approximation for traveling salesman problems with profits (Q2441781) (← links)
- Capacitated Vehicle Routing with Nonuniform Speeds (Q2800377) (← links)
- Dynamic Traveling Repair Problem with an Arbitrary Time Window (Q2971153) (← links)
- Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems (Q5085153) (← links)
- Prize-Collecting TSP with a Budget Constraint (Q5111751) (← links)
- Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems (Q5119847) (← links)
- (Q5136319) (← links)
- Running Errands in Time: Approximation Algorithms for Stochastic Orienteering (Q5245015) (← links)
- New approximation algorithms for the rooted budgeted cycle cover problem (Q5918725) (← links)
- Deadline TSP (Q5925174) (← links)
- New approximation algorithms for the rooted budgeted cycle cover problem (Q5925709) (← links)
