On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30)

Cites Work

On sublinear inequalities for mixed integer conic programs
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
Lifting for conic mixed-integer programming
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
Conic mixed-integer rounding cuts
A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints
Two-term disjunctions on the second-order cone
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
An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities
SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs
A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
Handling separable non-convexities using disjunctive cuts
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
Cuts for mixed 0-1 conic programming
Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
On Minimal Valid Inequalities for Mixed Integer Conic Programs
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
Algorithms for Linear Bilevel Optimization
Benders Subproblem Decomposition for Bilevel Problems with Convex Follower
Technical Note—There’s No Free Lunch: On the Hardness of Choosing a Correct Big-M in Bilevel Optimization
The Mixed Integer Linear Bilevel Programming Problem
Bilevel programming and price setting problems
Disjunctive cuts in mixed-integer conic optimization
A survey on bilevel optimization under uncertainty
A survey on mixed-integer programming techniques in bilevel optimization
An outer-approximation algorithm for maximum-entropy sampling

This page was built for publication: On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs