The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem
From MaRDI portal
Publication:4976158
DOI10.1137/15M1051592zbMath1373.90078OpenAlexW2739297732MaRDI QIDQ4976158
Publication date: 27 July 2017
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/15m1051592
Related Items (19)
Managing Product Transitions: A Bilevel Programming Approach ⋮ SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs ⋮ Bilevel Integer Programs with Stochastic Right-Hand Sides ⋮ Solution techniques for bi-level knapsack problems ⋮ Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds ⋮ An exact solution algorithm for integer bilevel programming with application in energy market optimization ⋮ A survey on mixed-integer programming techniques in bilevel optimization ⋮ An exact approach for the bilevel knapsack problem with interdiction constraints and extensions ⋮ Mixed-integer bilevel representability ⋮ A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation ⋮ Feature selection for classification models via bilevel optimization ⋮ Improved \(x\)-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks ⋮ Bilevel programming solution algorithms for optimal price-bidding of energy producers in multi-period day-ahead electricity markets with non-convexities ⋮ An enhanced branch-and-bound algorithm for bilevel integer linear programming ⋮ A Gilmore-Gomory construction of integer programming value functions ⋮ A framework for generalized Benders' decomposition and its application to multilevel optimization ⋮ A Unified Framework for Multistage Mixed Integer Linear Optimization ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ Bilevel integer programming on a Boolean network for discovering critical genetic alterations in cancer development and therapy
Cites Work
- An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
- Optimizing system resilience: a facility protection model with recovery time
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results
- Enhanced exact algorithms for discrete bilevel linear problems
- Parametric integer programming algorithm for bilevel mixed integer programs
- A sequential LCP method for bilevel linear programming
- A modified simplex approach for solving bilevel linear programming problems
- A simple tabu search method to solve the mixed-integer linear bilevel programming problem
- A mixed-integer bilevel programming approach for a competitive prioritized set covering problem
- A leader-follower game in competitive facility location
- Discrete bilevel programming: application to a natural gas cash-out problem
- Algorithms for solving the mixed integer two-level linear programming problem
- On generalized semi-infinite optimization and bilevel optimization
- Sequential discrete \(p\)-facility models for competitive location planning
- Global solution of nonlinear mixed-integer bilevel programs
- A bilevel mixed-integer program for critical infrastructure protection planning
- Disjunctive cuts for continuous linear bilevel programming
- Parametric global optimisation for bilevel programming
- Production planning problem with sequence dependent setups as a bilevel programming problem
- Global optimization of mixed-integer bilevel programming problems
- Intersection Cuts for Bilevel Optimization
- Bilevel Knapsack with Interdiction Constraints
- COMPUTATIONAL METHODS THROUGH GENETIC ALGORITHMS FOR OBTAINING STACKELBERG SOLUTIONS TO TWO-LEVEL INTEGER PROGRAMMING PROBLEMS
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- On the Global Solution of Linear Programs with Linear Complementarity Constraints
- On two-level optimization
- New Branch-and-Bound Rules for Linear Bilevel Programming
- The Mixed Integer Linear Bilevel Programming Problem
This page was built for publication: The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem
