Pages that link to "Item:Q3186662"

The following pages link to Bilevel Knapsack with Interdiction Constraints (Q3186662):

Displaying 41 items.

• The maximum clique interdiction problem (Q1735171) (← links)
• A dynamic reformulation heuristic for generalized interdiction problems (Q1754203) (← links)
• On the Stackelberg knapsack game (Q2029942) (← links)
• An enhanced branch-and-bound algorithm for bilevel integer linear programming (Q2030724) (← links)
• Closing the gap in linear bilevel optimization: a new valid primal-dual inequality (Q2039060) (← links)
• The trouble with the second quantifier (Q2044549) (← links)
• Outer approximation for global optimization of mixed-integer quadratic bilevel problems (Q2044965) (← links)
• A framework for generalized Benders' decomposition and its application to multilevel optimization (Q2097644) (← links)
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
• An exact approach for the bilevel knapsack problem with interdiction constraints and extensions (Q2196299) (← links)
• A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation (Q2220913) (← links)
• Algorithms and applications for a class of bilevel MILPs (Q2283108) (← links)
• Leadership in singleton congestion games: what is hard and what is easy (Q2289020) (← links)
• A survey of network interdiction models and algorithms (Q2294622) (← links)
• Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games (Q2308184) (← links)
• Computing a pessimistic Stackelberg equilibrium with multiple followers: the mixed-pure case (Q2309467) (← links)
• A Stackelberg knapsack game with weight control (Q2333816) (← links)
• A polynomial algorithm for a continuous bilevel knapsack problem (Q2417096) (← links)
• A faster algorithm for the continuous bilevel knapsack problem (Q2661565) (← links)
• Solving Quadratic Programming by Cutting Planes (Q4634098) (← links)
• The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem (Q4976158) (← links)
• Multilevel Approaches for the Critical Node Problem (Q4994170) (← links)
• Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method (Q4995065) (← links)
• Methods for Pessimistic Bilevel Optimization (Q5014636) (← links)
• A Unified Framework for Multistage Mixed Integer Linear Optimization (Q5014640) (← links)
• Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
• A Branch-and-Cut Algorithm for Submodular Interdiction Games (Q5058006) (← links)
• A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games (Q5085997) (← links)
• On Bilevel Optimization with Inexact Follower (Q5120277) (← links)
• Interdiction Games and Monotonicity, with Application to Knapsack Problems (Q5138270) (← links)
• Technical Note—There’s No Free Lunch: On the Hardness of Choosing a Correct Big-M in Bilevel Optimization (Q5144791) (← links)
• The subset sum game revisited (Q5918370) (← links)
• Solution techniques for bi-level knapsack problems (Q6047889) (← links)
• Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem (Q6062886) (← links)
• Logic-based Benders decomposition for wildfire suppression (Q6068720) (← links)
• A survey on bilevel optimization under uncertainty (Q6096565) (← 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)
• On the complexity of robust multi-stage problems with discrete recourse (Q6180695) (← links)
• Branch-and-cut solution approach for multilevel mixed integer linear programming problems (Q6491343) (← links)