Pages that link to "Item:Q2220913"

The following pages link to A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation (Q2220913):

Displaying 31 items.

• The impact of neighboring markets on renewable locations, transmission expansion, and generation investment (Q2030627) (← links)
• Outer approximation for global optimization of mixed-integer quadratic bilevel problems (Q2044965) (← links)
• The continuous maximum capacity path interdiction problem (Q2083925) (← links)
• An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities (Q2089867) (← links)
• A framework for generalized Benders' decomposition and its application to multilevel optimization (Q2097644) (← links)
• Bilevel integer programming on a Boolean network for discovering critical genetic alterations in cancer development and therapy (Q2116889) (← links)
• SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs (Q2164703) (← links)
• Complexity of near-optimal robust versions of multilevel optimization problems (Q2230787) (← links)
• Competitive location in cognitive radio networks (Q2342922) (← links)
• Poisoning finite-horizon Markov decision processes at design time (Q2668608) (← links)
• A Unified Framework for Multistage Mixed Integer Linear Optimization (Q5014640) (← links)
• Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← 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)
• Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments (Q5058394) (← 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)
• A generic optimization framework for resilient systems (Q5882239) (← 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)
• 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)
• Presolving linear bilevel optimization problems (Q6169995) (← links)
• Rejection-proof mechanisms for multi-agent kidney exchange (Q6188665) (← links)
• Branch-and-cut solution approach for multilevel mixed integer linear programming problems (Q6491343) (← links)