Pages that link to "Item:Q4938773"
From MaRDI portal
The following pages link to Convex quadratic programming relaxations for network scheduling problems (Q4938773):
Displaying 5 items.
- A conic quadratic formulation for a class of convex congestion functions in network flow problems (Q713098) (← links)
- Polynomial time approximation algorithms for machine scheduling: Ten open problems (Q1806342) (← links)
- Designing PTASs for MIN-SUM scheduling problems (Q2489956) (← links)
- Convex quadratic and semidefinite programming relaxations in scheduling (Q3196615) (← links)
- A branch-and-price algorithm for unrelated parallel machine scheduling with machine usage costs (Q6565429) (← links)