Pages that link to "Item:Q1754203"
From MaRDI portal
The following pages link to A dynamic reformulation heuristic for generalized interdiction problems (Q1754203):
Displaying 18 items.
- DASH: dynamic approach for switching heuristics (Q320816) (← links)
- A simple greedy heuristic for linear assignment interdiction (Q513608) (← links)
- Multiple allocation hub interdiction and protection problems: model formulations and solution approaches (Q1754747) (← links)
- A study of general and security Stackelberg game formulations (Q1999631) (← links)
- On the Stackelberg knapsack game (Q2029942) (← links)
- A branch-and-cut algorithm for the edge interdiction clique problem (Q2031072) (← links)
- Closing the gap in linear bilevel optimization: a new valid primal-dual inequality (Q2039060) (← links)
- Outer approximation for global optimization of mixed-integer quadratic bilevel problems (Q2044965) (← links)
- Complexity of the multilevel critical node problem (Q2121476) (← links)
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions (Q2196299) (← links)
- Exact solution approaches for a class of bilevel fractional programs (Q2679008) (← links)
- A Brief Overview of Interdiction and Robust Optimization (Q3299227) (← 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)
- Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets (Q5084616) (← 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)
- Presolving linear bilevel optimization problems (Q6169995) (← links)
