Pages that link to "Item:Q403662"

The following pages link to Bilevel programming and the separation problem (Q403662):

Displaying 16 items.

• A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs (Q670656) (← links)
• An approach for solving a fuzzy bilevel programming problem through nearest interval approximation approach and KKT optimality conditions (Q1701986) (← links)
• A dynamic reformulation heuristic for generalized interdiction problems (Q1754203) (← links)
• On the use of intersection cuts for bilevel optimization (Q1800991) (← links)
• Global optimization of multilevel electricity market models including network design and graph partitioning (Q2010915) (← links)
• SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs (Q2164703) (← links)
• Mixed-integer bilevel representability (Q2220657) (← links)
• Algorithms and applications for a class of bilevel MILPs (Q2283108) (← links)
• Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method (Q4995065) (← links)
• Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming (Q5086003) (← links)
• Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function (Q5129216) (← 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)
• Identifying optimal strategies in kidney exchange games is \(\varSigma_2^p\)-complete (Q6120903) (← links)
• An exact method for binary fortification games (Q6167322) (← links)
• Rejection-proof mechanisms for multi-agent kidney exchange (Q6188665) (← links)