Pages that link to "Item:Q670656"
From MaRDI portal
The following pages link to A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs (Q670656):
Displayed 17 items.
- An enhanced branch-and-bound algorithm for bilevel integer linear programming (Q2030724) (← 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)
- SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs (Q2164703) (← links)
- Mixed-integer bilevel representability (Q2220657) (← links)
- Bilevel programming solution algorithms for optimal price-bidding of energy producers in multi-period day-ahead electricity markets with non-convexities (Q2245701) (← links)
- Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints (Q2274885) (← links)
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
- A Branch-and-Cut Algorithm for Submodular Interdiction Games (Q5058006) (← 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)
- 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)
- Bilevel optimization for joint scheduling of production and energy systems (Q6159497) (← links)
- An exact method for binary fortification games (Q6167322) (← links)