Pages that link to "Item:Q320621"
From MaRDI portal
The following pages link to An alternative approach for proving the NP-hardness of optimization problems (Q320621):
Displaying 3 items.
- Scheduling lower bounds via AND subset sum (Q2121467) (← links)
- On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty (Q2215204) (← links)
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
