Pages that link to "Item:Q1800991"

The following pages link to On the use of intersection cuts for bilevel optimization (Q1800991):

Displaying 30 items.

• A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) (← links)
• The impact of neighboring markets on renewable locations, transmission expansion, and generation investment (Q2030627) (← links)
• An enhanced branch-and-bound algorithm for bilevel integer linear programming (Q2030724) (← links)
• Outer approximation for global optimization of mixed-integer quadratic bilevel problems (Q2044965) (← links)
• On tackling reverse convex constraints for non-overlapping of unequal circles (Q2045013) (← links)
• The continuous maximum capacity path interdiction problem (Q2083925) (← links)
• An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities (Q2089867) (← links)
• On convex lower-level black-box constraints in bilevel optimization with an application to gas market models with chance constraints (Q2089868) (← 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)
• On pricing-based equilibrium for network expansion planning. A multi-period bilevel approach under uncertainty (Q2189937) (← links)
• An exact approach for the bilevel knapsack problem with interdiction constraints and extensions (Q2196299) (← links)
• Mixed-integer bilevel representability (Q2220657) (← links)
• A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation (Q2220913) (← links)
• Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints (Q2274885) (← links)
• Multi-stage optimal design of road networks for automated vehicles with elastic multi-class demand (Q2669582) (← links)
• The leader multipurpose shopping location problem (Q2672066) (← links)
• Managing Product Transitions: A Bilevel Programming Approach (Q5058022) (← 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)
• 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)
• Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem (Q6065606) (← links)
• Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds (Q6102856) (← 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)
• Presolving linear bilevel optimization problems (Q6169995) (← links)
• Branch-and-cut solution approach for multilevel mixed integer linear programming problems (Q6491343) (← links)