Pages that link to "Item:Q1954852"
From MaRDI portal
The following pages link to An exact algorithm for bilevel 0-1 knapsack problems (Q1954852):
Displaying 16 items.
- Enhanced exact algorithms for discrete bilevel linear problems (Q499703) (← links)
- An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable (Q645559) (← links)
- On exact solution approaches for bilevel quadratic 0-1 knapsack problem (Q829202) (← links)
- A dynamic programming algorithm for the bilevel Knapsack problem (Q833584) (← links)
- One-level reformulation of the bilevel Knapsack problem using dynamic programming (Q1941532) (← links)
- Exact solution approach for a class of nonlinear bilevel knapsack problems (Q2018478) (← links)
- The binary knapsack problem with qualitative levels (Q2029032) (← 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)
- Lower bounds and a new exact approach for the Bilevel Knapsack with Interdiction Constraints (Q2293085) (← links)
- Improved approximation algorithms for a bilevel knapsack problem (Q2354770) (← links)
- An interactive approach based on a discrete differential evolution algorithm for a class of integer bilevel programming problems (Q2822279) (← links)
- Bilevel Knapsack with Interdiction Constraints (Q3186662) (← links)
- Approximation Algorithms for a Bi-level Knapsack Problem (Q5199165) (← links)
- Solution techniques for bi-level knapsack problems (Q6047889) (← links)
