Pages that link to "Item:Q5138270"

The following pages link to Interdiction Games and Monotonicity, with Application to Knapsack Problems (Q5138270):

Displaying 18 items.

• An exact approach for the \(r\)-interdiction covering problem with fortification (Q1725826) (← links)
• Multilevel Approaches for the Critical Node Problem (Q4994170) (← links)
• Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method (Q4995065) (← links)
• Play Like the Pros? Solving the Game of Darts as a Dynamic Zero-Sum Game (Q5057999) (← 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)
• Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem (Q5106375) (← 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)
• Optimizing edge sets in networks to produce ground truth communities based on modularity (Q6066243) (← links)
• Combining optimisation and simulation using logic-based Benders decomposition (Q6087478) (← 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)
• A survey on bilevel optimization under uncertainty (Q6096565) (← links)
• Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds (Q6102856) (← links)
• Interdicting restructuring networks with applications in illicit trafficking (Q6112570) (← links)
• A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)
• An exact method for binary fortification games (Q6167322) (← links)
• Mathematical programming formulations for the collapsed k-core problem (Q6168587) (← links)