Pages that link to "Item:Q980008"
From MaRDI portal
The following pages link to A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems (Q980008):
Displayed 3 items.
- Algorithms for some maximization scheduling problems on a single machine (Q612210) (← links)
- A note on a single machine scheduling problem with generalized total tardiness objective function (Q763495) (← links)
- Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one (Q1761818) (← links)