Pages that link to "Item:Q4602475"

The following pages link to A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs (Q4602475):

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)
• The maximum clique interdiction problem (Q1735171) (← links)
• A dynamic reformulation heuristic for generalized interdiction problems (Q1754203) (← links)
• Multilevel Approaches for the Critical Node Problem (Q4994170) (← links)
• Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method (Q4995065) (← links)
• Core Pricing in Combinatorial Exchanges with Financially Constrained Buyers: Computational Hardness and Algorithmic Solutions (Q5031010) (← links)
• A Branch-and-Cut Algorithm for Submodular Interdiction Games (Q5058006) (← links)
• A Catalog of Formulations for the Network Pricing Problem (Q5058007) (← links)
• Managing Product Transitions: A Bilevel Programming Approach (Q5058022) (← 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)
• A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games (Q5085997) (← links)
• Benders Subproblem Decomposition for Bilevel Problems with Convex Follower (Q5087737) (← links)
• Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem (Q5106375) (← links)
• Interdiction Games and Monotonicity, with Application to Knapsack Problems (Q5138270) (← 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)
• Metaheuristics for bilevel optimization: a comprehensive review (Q6065604) (← links)
• Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem (Q6065606) (← 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)
• An exact solution algorithm for integer bilevel programming with application in energy market optimization (Q6103704) (← links)
• Interdicting restructuring networks with applications in illicit trafficking (Q6112570) (← links)
• A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)
• On a computationally ill-behaved bilevel problem with a continuous and nonconvex lower level (Q6163957) (← links)
• An exact method for binary fortification games (Q6167322) (← links)
• Mathematical programming formulations for the collapsed k-core problem (Q6168587) (← links)
• Presolving linear bilevel optimization problems (Q6169995) (← links)
• Branch-and-cut solution approach for multilevel mixed integer linear programming problems (Q6491343) (← links)