SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs
From MaRDI portal
Publication:2164703
DOI10.1007/978-3-031-06901-7_20zbMath1497.90131arXiv2111.06824OpenAlexW4285079604MaRDI QIDQ2164703
Publication date: 16 August 2022
Full work available at URL: https://arxiv.org/abs/2111.06824
Uses Software
Cites Work
- An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
- Bilevel programming and the separation problem
- 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
- On the separation of disjunctive cuts
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs
- On exact solution approaches for bilevel quadratic 0-1 knapsack problem
- A dynamic programming algorithm for the bilevel Knapsack problem
- A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints
- Global solution of bilevel programs with a nonconvex inner program
- Feature selection for classification models via bilevel optimization
- On the use of intersection cuts for bilevel optimization
- Weak via strong Stackelberg problem: New results
- One-level reformulation of the bilevel Knapsack problem using dynamic programming
- Outer approximation for global optimization of mixed-integer quadratic bilevel problems
- A bilevel optimization approach to decide the feasibility of bookings in the European gas market
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
- A survey of network interdiction models and algorithms
- Population-based risk equilibration for the multimode hazmat transport network design problem
- Disjunctive cuts for continuous linear bilevel programming
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Intersection Cuts for Bilevel Optimization
- Disjunctive Programming
- A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
- A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem
- Disjunctive Programming
- The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
- Benders Subproblem Decomposition for Bilevel Problems with Convex Follower
- Two-Term Disjunctions on the Second-Order Cone
- Bilevel programming and price setting problems
- A survey on mixed-integer programming techniques in bilevel optimization
