Disjunctive cuts for continuous linear bilevel programming
From MaRDI portal
Publication:2463829
Recommendations
- Concavity cuts for disjoint bilinear programming
- Disjunctive cuts for mixed integer nonlinear programming problems
- Disjunctive cuts in mixed-integer conic optimization
- Discrete linear bilevel programming problem
- SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs
- Disjunctive Cuts for Nonconvex MINLP
- A cutting plane approach for solving linear bilevel programming problems
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
- Intersection cuts for bilevel optimization
- On disjunctive cuts for combinatorial optimization
Cites work
- A bilevel programming approach to determining tax credits for biofuel production
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- A symmetrical linear maxmin approach to disjoint bilinear programming
- A theoretical approximation scheme for Stackelberg problems
- Descent approaches for quadratic bilevel programming
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- scientific article; zbMATH DE number 1163110 (Why is no real title available?)
- Lift-and-project for mixed 0-1 programming: recent progress
- Linear bilevel programming solution by genetic algorithm
- Links between linear bilevel and mixed 0-1 programming problems
- Multicriteria approach to bilevel optimization
- New Branch-and-Bound Rules for Linear Bilevel Programming
- New branch-and-Cut algorithm for bilevel linear programming
Cited in
(27)- Multilevel decision-making: a survey
- A dynamic reformulation heuristic for generalized interdiction problems
- On a class of bilevel linear mixed-integer programs in adversarial settings
- On the use of intersection cuts for bilevel optimization
- Closing the gap in linear bilevel optimization: a new valid primal-dual inequality
- SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs
- Mixed-integer bilevel representability
- A cutting plane method for bilevel linear programming with interval coefficients
- Solving linear programs with complementarity constraints using branch-and-cut
- A solution to bi/tri-level programming problems using particle swarm optimization
- A convex-analysis perspective on disjunctive cuts
- Disjunctive Cuts for Nonconvex MINLP
- Intersection cuts for bilevel optimization
- A computational study for bilevel quadratic programs using semidefinite relaxations
- Obtaining tighter relaxations of mathematical programs with complementarity constraints
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
- The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem
- Enhanced exact algorithms for discrete bilevel linear problems
- Algorithms for Linear Bilevel Optimization
- Bilevel optimization: theory, algorithms, applications and a bibliography
- On bilevel optimization with inexact follower
- A survey on mixed-integer programming techniques in bilevel optimization
- On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs
- Robust bilevel optimization for near-optimal lower-level solutions
- A tutorial on solving single-leader-multi-follower problems using SOS1 reformulations
- On disjunction convex hulls by big-\(\mathrm{M}\) lifting
- On disjunction convex hulls by lifting
This page was built for publication: Disjunctive cuts for continuous linear bilevel programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2463829)
