Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds

DOI10.1007/s12532-022-00227-zzbMath1514.90191MaRDI QIDQ6102856

Oleg A. Prokopyev, Ted K. Ralphs, Xueyu Shi

Publication date: 23 June 2023

Published in: Mathematical Programming Computation (Search for Journal in Brave)

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Hierarchical games (including Stackelberg games) (91A65) Algorithmic game theory and complexity (91A68)

Related Items

Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exact solution approaches for bilevel assignment problems
• A class of algorithms for mixed-integer bilevel min-max optimization
• Bilevel programming and the separation problem
• The most vital nodes with respect to independent set and vertex cover
• On bilevel machine scheduling problems
• An integer programming approach for linear programs with probabilistic constraints
• An effective local search for the maximum clique problem
• Links between linear bilevel and mixed 0-1 programming problems
• Foundations of bilevel programming
• A polyhedral study on chance constrained program with random right-hand side
• A note on linearized reformulations for a class of bilevel linear integer problems
• On the use of intersection cuts for bilevel optimization
• k-interchange procedures for local search in a precedence-constrained routing problem
• Discrete linear bilevel programming problem
• An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
• A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
• The traveling salesman problem and its variations.
• Survivable network design under optimal and heuristic interdiction scenarios
• An overview of bilevel optimization
• A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• Bilevel Knapsack with Interdiction Constraints
• A Study on the Computational Complexity of the Bilevel Knapsack Problem
• Simple Local Search Problems that are Hard to Solve
• The polynomial hierarchy and a simple model for competitive analysis
• Matroid Applications and Algorithms
• An Efficient Heuristic Procedure for Partitioning Graphs
• New Results on the Old k-opt Algorithm for the Traveling Salesman Problem
• A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network
• A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem
• Shortest-path network interdiction
• Increasing the Weight of Minimum Spanning Trees
• Sequential Interdiction with Incomplete Information and Learning
• The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem
• Integer Programming Formulations for Minimum Spanning Tree Interdiction
• On Bilevel Optimization with Inexact Follower
• Interdiction Games and Monotonicity, with Application to Knapsack Problems
• The Mixed Integer Linear Bilevel Programming Problem
• On bilevel minimum and bottleneck spanning tree problems
• The mixed vertex packing problem.
• Introduction to global optimization.
• Mixing mixed-integer inequalities