Intersection cuts for bilevel optimization
From MaRDI portal
Recommendations
- On the use of intersection cuts for bilevel optimization
- A new general-purpose algorithm for mixed-integer bilevel linear programs
- A value-function-based exact approach for the bilevel mixed-integer programming problem
- Outer approximation for global optimization of mixed-integer quadratic bilevel problems
- Global optimization of mixed-integer bilevel programming problems
Cites work
- An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
- Disjunctive cuts for continuous linear bilevel programming
- Enhanced exact algorithms for discrete bilevel linear problems
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- The Mixed Integer Linear Bilevel Programming Problem
Cited in
(37)- Integer programming formulations for three sequential discrete competitive location problems with foresight
- A dynamic reformulation heuristic for generalized interdiction problems
- On the use of intersection cuts for bilevel optimization
- 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
- Closing the gap in linear bilevel optimization: a new valid primal-dual inequality
- Outer approximation for global optimization of mixed-integer quadratic bilevel problems
- An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities
- Bilevel integer programming on a Boolean network for discovering critical genetic alterations in cancer development and therapy
- Maximal quadratic-free sets
- SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs
- Partial hyperplane activation for generalized intersection cuts
- A cutting plane method for bilevel linear programming with interval coefficients
- A branch-and-cut algorithm for mixed-integer bilinear programming
- Algorithms and applications for a class of bilevel MILPs
- Disjunctive cuts for continuous linear bilevel programming
- On bilevel programming and its impact in branching, cutting and complexity. (Abstract)
- Bilevel programming and the separation problem
- A new general-purpose algorithm for mixed-integer bilevel linear programs
- 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
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Maximal quadratic-free sets
- Intersection Disjunctions for Reverse Convex Sets
- Benders Subproblem Decomposition for Bilevel Problems with Convex Follower
- Interdiction Games and Monotonicity, with Application to Knapsack Problems
- Technical note -- There's no free lunch: on the hardness of choosing a correct big-M in bilevel optimization
- On the implementation and strengthening of intersection cuts for QCQPs
- On the implementation and strengthening of intersection cuts for QCQPs
- 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
- On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs
- A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs
- Optimal electric vehicle charging with dynamic pricing, customer preferences and power peak reduction
- Markov decision process design: a framework for integrating strategic and operational decisions
- Optimizing power generation in the presence of micro-grids
This page was built for publication: Intersection cuts for bilevel optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3186493)
