An enhanced branch-and-bound algorithm for bilevel integer linear programming
From MaRDI portal
Publication:2030724
DOI10.1016/j.ejor.2020.10.002zbMath1487.90482OpenAlexW3091951114MaRDI QIDQ2030724
Xiangpei Hu, Nan Kong, Shaonan Liu, Ming-Zheng Wang
Publication date: 7 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.10.002
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05)
Related Items
Solution techniques for bi-level knapsack problems, An exact solution algorithm for integer bilevel programming with application in energy market optimization, A bi-level multi-follower optimization model for R\&D project portfolio: an application to a pharmaceutical holding company, Complexity of near-optimal robust versions of multilevel optimization problems, Uncertain random bilevel programming models and their application to shared capacity routing problem, Bilevel integer programming on a Boolean network for discovering critical genetic alterations in cancer development and therapy
Uses Software
Cites Work
- Unnamed Item
- A class of algorithms for mixed-integer bilevel min-max optimization
- An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
- Natural gas bilevel cash-out problem: convergence of a penalty function method
- Enhanced exact algorithms for discrete bilevel linear problems
- A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs
- A natural gas cash-out problem: a bilevel programming framework and a penalty function method
- Uniqueness of solution in linear programming
- Capacity planning with competitive decision-makers: trilevel MILP formulation, degeneracy, and solution approaches
- A note on linearized reformulations for a class of bilevel linear integer problems
- A mixed-integer bilevel programming approach for a competitive prioritized set covering problem
- Discrete bilevel programming: application to a natural gas cash-out problem
- On the use of intersection cuts for bilevel optimization
- Discrete linear bilevel programming problem
- Resolution method for mixed integer bi-level linear problems based on decomposition technique
- Lower bounds and a new exact approach for the Bilevel Knapsack with Interdiction Constraints
- A linearization approach to solve the natural gas cash-out bilevel problem
- Parametric global optimisation for bilevel programming
- Capacitated plant selection in a decentralized manufacturing environment: a bilevel optimization approach
- A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints
- A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing
- Intersection Cuts for Bilevel Optimization
- Bilevel Knapsack with Interdiction Constraints
- The polynomial hierarchy and a simple model for competitive analysis
- A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network
- A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
- A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem
- The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem
- Necessary optimality conditions in pessimistic bilevel programming
- The Mixed Integer Linear Bilevel Programming Problem
- Pessimistic Bilevel Optimization
- A Backward Sampling Framework for Interdiction Problems with Fortification
