Indefinite quadratic integer bilevel programming problem with bounded variables
From MaRDI portal
Publication:1956480
DOI10.1007/s12597-009-0027-9zbMath1225.90086OpenAlexW2011118869MaRDI QIDQ1956480
Publication date: 22 September 2010
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12597-009-0027-9
integer programmingbox constraintsmixed integer cutbilevel programming problemindefinite quadratic optimization problem
Related Items (2)
Branch and cut method for solving integer indefinite quadratic bilevel programs ⋮ A cutting plane approach for multi-objective integer indefinite quadratic programming problem
Cites Work
- Unnamed Item
- Unnamed Item
- The free parametrization for linear programming with bounded variables
- On the indefinite quadratic bilevel programming problem.
- Optimality conditions for the bilevel programming problem
- An Algorithm for Solving the General Bilevel Programming Problem
- On two-level optimization
- Integer Programming with Bounded Variables via Canonical Separation
- Two-Level Linear Programming
This page was built for publication: Indefinite quadratic integer bilevel programming problem with bounded variables