Pages that link to "Item:Q330266"

The following pages link to A class of algorithms for mixed-integer bilevel min-max optimization (Q330266):

Displaying 31 items.

• A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs (Q670656) (← links)
• Minimum cost edge blocker clique problem (Q827246) (← links)
• Exact algorithms for the minimum cost vertex blocker clique problem (Q1634092) (← links)
• On unbounded and binary parameters in multi-parametric programming: applications to mixed-integer bilevel optimization and duality theory (Q1683323) (← links)
• The maximum clique interdiction problem (Q1735171) (← links)
• A dynamic reformulation heuristic for generalized interdiction problems (Q1754203) (← links)
• On a class of bilevel linear mixed-integer programs in adversarial settings (Q1754450) (← links)
• An enhanced branch-and-bound algorithm for bilevel integer linear programming (Q2030724) (← links)
• A branch-and-cut algorithm for the edge interdiction clique problem (Q2031072) (← links)
• Outer approximation for global optimization of mixed-integer quadratic bilevel problems (Q2044965) (← links)
• Provable training set debugging for linear regression (Q2071505) (← links)
• An exact approach for the bilevel knapsack problem with interdiction constraints and extensions (Q2196299) (← links)
• Improved \(x\)-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks (Q2242189) (← links)
• A survey of network interdiction models and algorithms (Q2294622) (← links)
• Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty (Q4994141) (← links)
• Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method (Q4995065) (← links)
• Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
• A Branch-and-Cut Algorithm for Submodular Interdiction Games (Q5058006) (← links)
• Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets (Q5084616) (← links)
• Bilevel Integer Programs with Stochastic Right-Hand Sides (Q5084620) (← links)
• Min-Max Optimal Design of Two-Armed Trials with Side Information (Q5084640) (← links)
• On Bilevel Optimization with Inexact Follower (Q5120277) (← links)
• Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function (Q5129216) (← links)
• Interdiction Games and Monotonicity, with Application to Knapsack Problems (Q5138270) (← links)
• Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem (Q6062886) (← links)
• Why there is no need to use a big-\(M\) in linear bilevel optimization: a computational study of two ready-to-use approaches (Q6088759) (← links)
• Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds (Q6102856) (← links)
• On designing networks resilient to clique blockers (Q6106962) (← links)
• A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)
• An exact method for binary fortification games (Q6167322) (← links)
• Reformulations and complexity of the clique interdiction problem by graph mapping (Q6558672) (← links)