The following pages link to (Q4400841):
Displaying 4 items.
- Approximation algorithms for shop scheduling problems with minsum objective (Q1607979) (← links)
- Preemptive and non-preemptive generalized min sum set cover (Q2248757) (← links)
- Solving the maximum duo-preservation string mapping problem with linear programming (Q2440161) (← links)
- Designing PTASs for MIN-SUM scheduling problems (Q2489956) (← links)