Pages that link to "Item:Q1867103"
From MaRDI portal
The following pages link to An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note (Q1867103):
Displaying 5 items.
- An alternative approach for proving the NP-hardness of optimization problems (Q320621) (← links)
- Complexity of buffer capacity allocation problems for production lines with unreliable machines (Q367250) (← links)
- Multi-product lot-sizing and sequencing on a single imperfect machine (Q409261) (← links)
- Approximation issues of fractional knapsack with penalties: a note (Q2144213) (← links)
- Lot-Sizing and Sequencing on a Single Imperfect Machine (Q3627683) (← links)
