Pages that link to "Item:Q2417096"
From MaRDI portal
The following pages link to A polynomial algorithm for a continuous bilevel knapsack problem (Q2417096):
Displaying 7 items.
- Complexity of the multilevel critical node problem (Q2121476) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective (Q2154452) (← links)
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions (Q2196299) (← links)
- A faster algorithm for the continuous bilevel knapsack problem (Q2661565) (← links)
- Exact solution approaches for a class of bilevel fractional programs (Q2679008) (← links)
- The subset sum game revisited (Q5918370) (← links)