A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
From MaRDI portal
Publication:2220913
Abstract: In this paper, we describe a comprehensive algorithmic framework for solving mixed integer bilevel linear optimization problems (MIBLPs) using a generalized branch-and-cut approach. The framework presented merges features from existing algorithms (for both traditional mixed integer linear optimization and MIBLPs) with new techniques to produce a flexible and robust framework capable of solving a wide range of bilevel optimization problems. The framework has been fully implemented in the open-source solver MibS. The paper describes the algorithmic options offered by MibS and presents computational results evaluating the effectiveness of the various options for the solution of a number of classes of bilevel optimization problems from the literature.
Recommendations
- A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs
- New branch-and-Cut algorithm for bilevel linear programming
- A new general-purpose algorithm for mixed-integer bilevel linear programs
- On the use of intersection cuts for bilevel optimization
- An algorithm for the mixed-integer nonlinear bilevel programming problem
Cites work
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A library hierarchy for implementing scalable parallel search algorithms
- A mixed-integer bilevel programming approach for a competitive prioritized set covering problem
- A new general-purpose algorithm for mixed-integer bilevel linear programs
- A simple tabu search method to solve the mixed-integer linear bilevel programming problem
- A value-function-based exact approach for the bilevel mixed-integer programming problem
- An Automatic Method of Solving Discrete Programming Problems
- An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
- Bilevel knapsack with interdiction constraints
- 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
- Branching rules revisited
- Canonical Cuts on the Unit Hypercube
- Computational experience with a software framework for parallel integer programming
- Cutting planes in integer and mixed integer programming
- Discrete linear bilevel programming problem
- Duality for mixed-integer linear programs
- Enhanced exact algorithms for discrete bilevel linear problems
- Global solution of nonlinear mixed-integer bilevel programs
- scientific article; zbMATH DE number 35514 (Why is no real title available?)
- scientific article; zbMATH DE number 7005721 (Why is no real title available?)
- scientific article; zbMATH DE number 7124428 (Why is no real title available?)
- scientific article; zbMATH DE number 2209474 (Why is no real title available?)
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Mathematical Programs with Optimization Problems in the Constraints
- On the use of intersection cuts for bilevel optimization
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- Parametric global optimisation for bilevel programming
- Practical bilevel optimization. Algorithms and applications
- Proper efficiency and the theory of vector maximization
- Removing Arcs from a Network
- The N-k problem in power grids: new models, formulations, and numerical experiments
- The Mixed Integer Linear Bilevel Programming Problem
- The polynomial hierarchy and a simple model for competitive analysis
- The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem
- Weak via strong Stackelberg problem: New results
Cited in
(45)- The impact of neighboring markets on renewable locations, transmission expansion, and generation investment
- Outer approximation for global optimization of mixed-integer quadratic bilevel problems
- The continuous maximum capacity path interdiction problem
- An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities
- A framework for generalized Benders' decomposition and its application to multilevel optimization
- Bilevel integer programming on a Boolean network for discovering critical genetic alterations in cancer development and therapy
- SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs
- Complexity of near-optimal robust versions of multilevel optimization problems
- Competitive location in cognitive radio networks
- Poisoning finite-horizon Markov decision processes at design time
- Branch and cut method for solving integer indefinite quadratic bilevel programs
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
- A unified framework for multistage mixed integer linear optimization
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Core pricing in combinatorial exchanges with financially constrained buyers: computational hardness and algorithmic solutions
- A Branch-and-Cut Algorithm for Submodular Interdiction Games
- A Catalog of Formulations for the Network Pricing Problem
- Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments
- A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games
- Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem
- A generic optimization framework for resilient systems
- Solution techniques for bi-level knapsack problems
- Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem
- Metaheuristics for bilevel optimization: a comprehensive review
- Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem
- A fast combinatorial algorithm for the bilevel knapsack problem with interdiction constraints
- A survey on bilevel optimization under uncertainty
- Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds
- Interdicting restructuring networks with applications in illicit trafficking
- A survey on mixed-integer programming techniques in bilevel optimization
- An exact method for binary fortification games
- Presolving linear bilevel optimization problems
- Rejection-proof mechanisms for multi-agent kidney exchange
- Branch-and-cut solution approach for multilevel mixed integer linear programming problems
- On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs
- Solving a class of two-stage stochastic nonlinear integer programs using value functions
- A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs
- Last fifty years of integer linear programming: a focus on recent practical advances
- How many clues to give? A bilevel formulation for the minimum Sudoku clue problem
- A fast combinatorial algorithm for the bilevel knapsack problem with interdiction constraints
- Existence of solutions in bilevel stochastic linear programming with integer variables in the lower level problem
- Robust location for quarantine facilities under decentralized room assignment: a bi-level mixed-integer programming approach
- Bilevel optimization with sustainability perspective: a survey on applications
- Transformation of bi-level transit network design problem into single-objective unconstrained optimization
- On coupling constraints in pessimistic linear bilevel optimization
Describes a project that uses
Uses Software
This page was built for publication: A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2220913)
