Pages that link to "Item:Q3192105"

The following pages link to A Study on the Computational Complexity of the Bilevel Knapsack Problem (Q3192105):

Displaying 22 items.

• Observability of power systems with optimal PMU placement (Q1652693) (← links)
• A dynamic reformulation heuristic for generalized interdiction problems (Q1754203) (← links)
• On the Stackelberg knapsack game (Q2029942) (← links)
• The trouble with the second quantifier (Q2044549) (← links)
• 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)
• Computing equilibria for integer programming games (Q2160491) (← links)
• Mixed-integer bilevel representability (Q2220657) (← links)
• Complexity of near-optimal robust versions of multilevel optimization problems (Q2230787) (← links)
• Algorithms and applications for a class of bilevel MILPs (Q2283108) (← links)
• A Stackelberg knapsack game with weight control (Q2333816) (← links)
• A faster algorithm for the continuous bilevel knapsack problem (Q2661565) (← links)
• Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
• On Bilevel Optimization with Inexact Follower (Q5120277) (← links)
• Interdiction Games and Monotonicity, with Application to Knapsack Problems (Q5138270) (← links)
• The subset sum game revisited (Q5918370) (← links)
• Computational complexity characterization of protecting elections from bribery (Q5919119) (← links)
• Solution techniques for bi-level knapsack problems (Q6047889) (← links)
• Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds (Q6102856) (← links)
• A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)
• An exact method for binary fortification games (Q6167322) (← links)