Pages that link to "Item:Q6114905"

The following pages link to A survey on mixed-integer programming techniques in bilevel optimization (Q6114905):

Displaying 25 items.

• Solving certain complementarity problems in power markets via convex programming (Q2085814) (← 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)
• A bilevel optimization approach to decide the feasibility of bookings in the European gas market (Q2155380) (← 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)
• Integer programming methods for solving binary interdiction games (Q2672065) (← links)
• Solution techniques for bi-level knapsack problems (Q6047889) (← links)
• A successive linear relaxation method for MINLPs with multivariate Lipschitz continuous nonlinearities (Q6050153) (← links)
• Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem (Q6062886) (← links)
• On the complexity of the bilevel minimum spanning tree problem (Q6064168) (← links)
• Metaheuristics for bilevel optimization: a comprehensive review (Q6065604) (← links)
• Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem (Q6065606) (← links)
• Shortest path interdiction problem with convex piecewise-linear costs (Q6080429) (← links)
• A survey on bilevel optimization under uncertainty (Q6096565) (← links)
• Setting closer targets based on non-dominated convex combinations of Pareto-efficient units: a bi-level linear programming approach in data envelopment analysis (Q6096632) (← links)
• Using neural networks to solve linear bilevel problems with unknown lower level (Q6097481) (← 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)
• Robust capacitated Steiner trees and networks with uniform demands (Q6179720) (← links)
• Rejection-proof mechanisms for multi-agent kidney exchange (Q6188665) (← links)
• Min–max optimization of node‐targeted attacks in service networks (Q6196869) (← links)