Pages that link to "Item:Q4604908"
From MaRDI portal
The following pages link to A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem (Q4604908):
Displaying 43 items.
- A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs (Q670656) (← links)
- Bilevel optimization to deal with demand response in power grids: models, methods and challenges (Q828745) (← links)
- Feature selection for classification models via bilevel optimization (Q1734837) (← links)
- The maximum clique interdiction problem (Q1735171) (← links)
- Integrating link-based discrete credit charging scheme into discrete network design problem (Q1991119) (← links)
- A deterministic bounding procedure for the global optimization of a bi-level mixed-integer problem (Q2029945) (← 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)
- The cost of decoupling trade and transport in the European entry-exit gas market with linear physics modeling (Q2060426) (← links)
- A Gilmore-Gomory construction of integer programming value functions (Q2060593) (← 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)
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation (Q2220913) (← links)
- Improved \(x\)-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks (Q2242189) (← links)
- Bilevel programming solution algorithms for optimal price-bidding of energy producers in multi-period day-ahead electricity markets with non-convexities (Q2245701) (← links)
- A survey of network interdiction models and algorithms (Q2294622) (← links)
- A matheuristic for solving the bilevel approach of the facility location problem with cardinality constraints and preferences (Q2664416) (← links)
- A value function-based approach for robust surgery planning (Q2668757) (← links)
- Methods for Pessimistic Bilevel Optimization (Q5014636) (← links)
- A Unified Framework for Multistage Mixed Integer Linear Optimization (Q5014640) (← 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)
- Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments (Q5058394) (← links)
- Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets (Q5084616) (← 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)
- Benders Subproblem Decomposition for Bilevel Problems with Convex Follower (Q5087737) (← links)
- Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem (Q5106375) (← links)
- Interdiction Games and Monotonicity, with Application to Knapsack Problems (Q5138270) (← links)
- A generic optimization framework for resilient systems (Q5882239) (← links)
- Solution techniques for bi-level knapsack problems (Q6047889) (← links)
- Using neural networks to solve linear bilevel problems with unknown lower level (Q6097481) (← links)
- Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds (Q6102856) (← 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)
- A deterministic bounding algorithm vs. a hybrid meta-heuristic to deal with a bilevel mixed-integer nonlinear optimization model for electricity dynamic pricing (Q6164598) (← links)
- Rejection-proof mechanisms for multi-agent kidney exchange (Q6188665) (← links)
- On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs (Q6589745) (← links)
- Solving a class of two-stage stochastic nonlinear integer programs using value functions (Q6667707) (← links)