Pages that link to "Item:Q1941532"
From MaRDI portal
The following pages link to One-level reformulation of the bilevel Knapsack problem using dynamic programming (Q1941532):
Displaying 21 items.
- A class of algorithms for mixed-integer bilevel min-max optimization (Q330266) (← links)
- On exact solution approaches for bilevel quadratic 0-1 knapsack problem (Q829202) (← links)
- A single-level reformulation of mixed integer bilevel programming problems (Q1727937) (← links)
- An exact algorithm for bilevel 0-1 knapsack problems (Q1954852) (← links)
- Designing coalition-based fair and stable pricing mechanisms under private information on consumers' reservation prices (Q1991130) (← links)
- Exact solution approach for a class of nonlinear bilevel knapsack problems (Q2018478) (← links)
- On the Stackelberg knapsack game (Q2029942) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs (Q2164703) (← links)
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions (Q2196299) (← links)
- A polynomial algorithm for a continuous bilevel knapsack problem (Q2417096) (← links)
- A faster algorithm for the continuous bilevel knapsack problem (Q2661565) (← 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)
- Bilevel “Defender–Attacker” Model with Multiple Attack Scenarios (Q4558293) (← links)
- Multilevel Approaches for the Critical Node Problem (Q4994170) (← links)
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
- A Branch-and-Cut Algorithm for Submodular Interdiction Games (Q5058006) (← links)
- Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function (Q5129216) (← links)
- Solution techniques for bi-level knapsack problems (Q6047889) (← links)
- On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs (Q6589745) (← links)
