Pages that link to "Item:Q3060773"
From MaRDI portal
The following pages link to Approximation Algorithms for the Multi-Vehicle Scheduling Problem (Q3060773):
Displaying 6 items.
- Improved approximation algorithms for some min-max and minimum cycle cover problems (Q344767) (← links)
- Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle (Q428867) (← links)
- Improved algorithms for single vehicle scheduling on tree/cycle networks (Q2051909) (← links)
- New LP relaxations for minimum cycle/path/tree cover problems (Q2283007) (← links)
- Better approximability results for min-max tree/cycle/path cover problems (Q2420656) (← links)
- Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems (Q3196380) (← links)