Enhanced exact algorithms for discrete bilevel linear problems
From MaRDI portal
Recommendations
- An enhanced branch-and-bound algorithm for bilevel integer linear programming
- An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
- scientific article; zbMATH DE number 35514
- Computational Difficulties of Bilevel Linear Programming
- scientific article; zbMATH DE number 1264394
Cites work
- scientific article; zbMATH DE number 4191395 (Why is no real title available?)
- scientific article; zbMATH DE number 1264368 (Why is no real title available?)
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- A simple tabu search method to solve the mixed-integer linear bilevel programming problem
- Algorithms for solving the mixed integer two-level linear programming problem
- An exact algorithm for bilevel 0-1 knapsack problems
- An overview of bilevel optimization
- Discrete linear bilevel programming problem
- Disjunctive cuts for continuous linear bilevel programming
- Foundations of bilevel programming
- Links between linear bilevel and mixed 0-1 programming problems
- New branch-and-Cut algorithm for bilevel linear programming
- On two-level optimization
- Practical bilevel optimization. Algorithms and applications
- The Mixed Integer Linear Bilevel Programming Problem
- The polynomial hierarchy and a simple model for competitive analysis
- Two-Level Linear Programming
Cited in
(26)- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
- A framework for generalized Benders' decomposition and its application to multilevel optimization
- Matching coefficients for improved staggered bilinears
- Bilevel integer programming on a Boolean network for discovering critical genetic alterations in cancer development and therapy
- The leader multipurpose shopping location problem
- Intersection cuts for bilevel optimization
- Improved x-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks
- On a class of bilevel linear mixed-integer programs in adversarial settings
- On pricing-based equilibrium for network expansion planning. A multi-period bilevel approach under uncertainty
- On bilevel optimization with inexact follower
- A deterministic bounding procedure for the global optimization of a bi-level mixed-integer problem
- An enhanced branch-and-bound algorithm for bilevel integer linear programming
- Benders Subproblem Decomposition for Bilevel Problems with Convex Follower
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
- Multilevel approaches for the critical node problem
- A unified framework for multistage mixed integer linear optimization
- An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
- Bilevel programming solution algorithms for optimal price-bidding of energy producers in multi-period day-ahead electricity markets with non-convexities
- On the use of intersection cuts for bilevel optimization
- A survey on mixed-integer programming techniques in bilevel optimization
- Mixed-integer bilevel representability
- An exact algorithm for solving the bilevel facility interdiction and fortification problem
- Bilevel Integer Programs with Stochastic Right-Hand Sides
- The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem
- Bilevel optimization: theory, algorithms, applications and a bibliography
- An exact solution algorithm for integer bilevel programming with application in energy market optimization
This page was built for publication: Enhanced exact algorithms for discrete bilevel linear problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q499703)
