Pages that link to "Item:Q1357781"
From MaRDI portal
The following pages link to Vehicle scheduling on a tree with release and handling times (Q1357781):
Displaying 15 items.
- Routing open shop and flow shop scheduling problems (Q421573) (← links)
- Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle (Q428867) (← links)
- A \(\frac{5}{3}\)-approximation algorithm for scheduling vehicles on a path with release and handling times (Q1007578) (← links)
- Submodularity and the traveling salesman problem (Q1124707) (← links)
- 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. (Q1406038) (← links)
- A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree (Q1827840) (← links)
- Two short notes on the on-line travelling salesman: handling times and lookahead. (Q1853561) (← links)
- An approximability result of the multi-vehicle scheduling problem on a path with release and handling times (Q1884949) (← links)
- Linear time approximation schemes for vehicle scheduling problems (Q1887080) (← links)
- Improved algorithms for single vehicle scheduling on tree/cycle networks (Q2051909) (← links)
- The single line moving target traveling salesman problem with release times (Q2158632) (← links)
- The routing open-shop problem on a network: complexity and approximation (Q2496075) (← links)
- Approximation algorithms for distance constrained vehicle routing problems (Q2892157) (← links)
- Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks (Q3150129) (← links)
- Balancing profits and costs on trees (Q5326788) (← links)