Pages that link to "Item:Q3931021"
From MaRDI portal
The following pages link to AN ALGORITHM FOR SOLVING BILINEAR KNAPSACK PROBLEMS (Q3931021):
Displayed 4 items.
- Knowledge based approach to the cutting stock problem (Q1197096) (← links)
- Combinatorial optimization with interaction costs: complexity and solvable cases (Q2010918) (← links)
- On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty (Q2664004) (← links)
- Models and methods of solution of quadratic integer programming problems (Q3807880) (← links)