A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
From MaRDI portal
Publication:2220913
DOI10.1007/s12532-020-00183-6zbMath1458.90488arXiv2104.09010OpenAlexW3156661518MaRDI QIDQ2220913
Sahar Tahernejad, Scott T. DeNegre, Ted K. Ralphs
Publication date: 25 January 2021
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.09010
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items
A generic optimization framework for resilient systems, 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, SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs, A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games, Poisoning finite-horizon Markov decision processes at design time, 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, Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem, 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, Complexity of near-optimal robust versions of multilevel optimization problems, 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, Competitive location in cognitive radio networks, 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, Core Pricing in Combinatorial Exchanges with Financially Constrained Buyers: Computational Hardness and Algorithmic Solutions
Uses Software
Cites Work
- An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
- 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
- Cutting planes in integer and mixed integer programming
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- A simple tabu search method to solve the mixed-integer linear bilevel programming problem
- Practical bilevel optimization. Algorithms and applications
- A mixed-integer bilevel programming approach for a competitive prioritized set covering problem
- A library hierarchy for implementing scalable parallel search algorithms
- On the use of intersection cuts for bilevel optimization
- Weak via strong Stackelberg problem: New results
- Branching rules revisited
- Discrete linear bilevel programming problem
- Global solution of nonlinear mixed-integer bilevel programs
- Parametric global optimisation for bilevel programming
- Proper efficiency and the theory of vector maximization
- Computational Experience with a Software Framework for Parallel Integer Programming
- The $N-k$ Problem in Power Grids: New Models, Formulations, and Numerical Experiments
- Bilevel Knapsack with Interdiction Constraints
- An Automatic Method of Solving Discrete Programming Problems
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- The polynomial hierarchy and a simple model for competitive analysis
- 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
- The Mixed Integer Linear Bilevel Programming Problem
- Removing Arcs from a Network
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Canonical Cuts on the Unit Hypercube
- Mathematical Programs with Optimization Problems in the Constraints
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
