Intersection Cuts for Bilevel Optimization
From MaRDI portal
Publication:3186493
DOI10.1007/978-3-319-33461-5_7zbMath1419.90076OpenAlexW2462361599WikidataQ62048263 ScholiaQ62048263MaRDI QIDQ3186493
Markus Sinnl, Matteo Fischetti, Ivana Ljubić, Michele Monaci
Publication date: 10 August 2016
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-33461-5_7
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
Maximal Quadratic-Free Sets, Intersection Disjunctions for Reverse Convex Sets, SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs, Benders Subproblem Decomposition for Bilevel Problems with Convex Follower, Integer programming formulations for three sequential discrete competitive location problems with foresight, Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem, Bilevel optimization for joint scheduling of production and energy systems, Interdiction Games and Monotonicity, with Application to Knapsack Problems, A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs, A dynamic reformulation heuristic for generalized interdiction problems, Optimizing power generation in the presence of micro-grids, A deterministic bounding procedure for the global optimization of a bi-level mixed-integer problem, An enhanced branch-and-bound algorithm for bilevel integer linear programming, Algorithms and applications for a class of bilevel MILPs, On the implementation and strengthening of intersection cuts for QCQPs, On the use of intersection cuts for bilevel optimization, On the implementation and strengthening of intersection cuts for QCQPs, The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem, Multilevel Approaches for the Critical Node Problem, Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method, An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities, 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, Maximal quadratic-free sets
Uses Software
Cites Work
- An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
- Enhanced exact algorithms for discrete bilevel linear problems
- Disjunctive cuts for continuous linear bilevel programming
- The Mixed Integer Linear Bilevel Programming Problem
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
