Pages that link to "Item:Q2917206"
From MaRDI portal
The following pages link to An improved FPTAS for mobile agent routing with time constraints (Q2917206):
Displaying 4 items.
- An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem (Q398866) (← links)
- Fast approximation algorithms for routing problems with hop-wise constraints (Q490222) (← links)
- Strongly polynomial FPTASes for monotone dynamic programs (Q2088581) (← links)
- Improving the solution complexity of the scheduling problem with deadlines: A general technique (Q2954334) (← links)