Pages that link to "Item:Q2275577"
From MaRDI portal
The following pages link to A well-solvable special case of the bounded knapsack problem (Q2275577):
Displaying 5 items.
- A polynomial-time algorithm for knapsack with divisible item sizes (Q287072) (← links)
- Unbounded knapsack problems with arithmetic weight sequences (Q545110) (← links)
- Using well-solvable minimum cost exact covering for VLSI clock energy minimization (Q1785247) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- Bilevel optimization for the deployment of refuelling stations for electric vehicles on road networks (Q6551058) (← links)