Resolution method for mixed integer bi-level linear problems based on decomposition technique
From MaRDI portal
Recommendations
- A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs
- On the use of intersection cuts for bilevel optimization
- scientific article; zbMATH DE number 970346
- scientific article; zbMATH DE number 1145365
- New branch-and-Cut algorithm for bilevel linear programming
Cites work
- scientific article; zbMATH DE number 3972625 (Why is no real title available?)
- scientific article; zbMATH DE number 1329057 (Why is no real title available?)
- scientific article; zbMATH DE number 976325 (Why is no real title available?)
- scientific article; zbMATH DE number 970346 (Why is no real title available?)
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- A Note on: An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem
- A global optimization approach for the linear two-level program
- A mixed-integer optimization framework for the synthesis and analysis of regulatory networks
- Algorithms for solving the mixed integer two-level linear programming problem
- An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem
- An extended Kuhn-Tucker approach for linear bilevel programming
- An extended branch and bound algorithm for linear bilevel programming
- An investigation of the linear three level programming problem
- Discrete linear bilevel programming problem
- Exact and inexact penalty methods for the generalized bilevel programming problem
- Global optimization of mixed-integer bilevel programming problems
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Parametric global optimisation for bilevel programming
- Partitioning procedures for solving mixed-variables programming problems
- The Mixed Integer Linear Bilevel Programming Problem
Cited in
(44)- A framework for generalized Benders' decomposition and its application to multilevel optimization
- A single-level reformulation of mixed integer bilevel programming problems
- Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing
- A bilevel partial interdiction problem with capacitated facilities and demand outsourcing
- Integrating link-based discrete credit charging scheme into discrete network design problem
- Optimizing system resilience: a facility protection model with recovery time
- Optimal engineering design via Benders' decomposition
- Optimizing fortification plan of capacitated facilities with maximum distance limits
- A value-function-based exact approach for the bilevel mixed-integer programming problem
- Markov decision process design: a framework for integrating strategic and operational decisions
- The Benders decomposition algorithm: a literature review
- Bilevel programming and applications
- A weighting method for 0-1 indefinite quadratic bilevel programming
- An enhanced branch-and-bound algorithm for bilevel integer linear programming
- An effective bilevel programming approach for the evasive flow capturing location problem
- Benders Subproblem Decomposition for Bilevel Problems with Convex Follower
- Multi-parametric global optimization approach for tri-level mixed-integer linear optimization problems
- A survey of network interdiction models and algorithms
- Location of urban micro‐consolidation centers to reduce the social cost of last‐mile deliveries of cargo: A heuristic approach
- Optimal sensor deployment to increase the security of the maximal breach path in border surveillance
- Optimizing dynamic investment decisions for railway systems protection
- A unified framework for multistage mixed integer linear optimization
- A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints
- Speed-up Benders decomposition using maximum density cut (MDC) generation
- Model building using bi-level optimization
- A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints
- A continuous bi-level model for the expansion of highway networks
- An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
- Solving discrete linear bilevel optimization problems using the optimal value reformulation
- A bi-level programming model for protection of hierarchical facilities under imminent attacks
- Estimating the parameters of a fatigue model using Benders' decomposition
- On the use of intersection cuts for bilevel optimization
- A survey on mixed-integer programming techniques in bilevel optimization
- On unbounded and binary parameters in multi-parametric programming: applications to mixed-integer bilevel optimization and duality theory
- An exact algorithm for solving the bilevel facility interdiction and fortification problem
- Accelerating Benders method using covering cut bundle generation
- Solving multi-period interdiction via generalized Bender's decomposition
- Bilevel Integer Programs with Stochastic Right-Hand Sides
- Managing Product Transitions: A Bilevel Programming Approach
- Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets
- Uncertain random multilevel programming with application to production control problem
- Bilevel optimization: theory, algorithms, applications and a bibliography
- A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs
- An interior-point Benders based branch-and-cut algorithm for mixed integer programs
This page was built for publication: Resolution method for mixed integer bi-level linear problems based on decomposition technique
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2271156)
