Branch and cut method for solving integer indefinite quadratic bilevel programs
From MaRDI portal
Publication:2675637
DOI10.1007/s10479-021-04387-4zbMath1495.90196OpenAlexW4205871034MaRDI QIDQ2675637
Nacéra Maachou, Mustapha Moulaï
Publication date: 24 September 2022
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-021-04387-4
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30) Quadratic programming (90C20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generating the efficient set of multiobjective integer linear plus linear fractional programming problems
- An exact method for a discrete multiobjective linear fractional optimization
- Interactive fuzzy goal programming approach for bilevel programming problem
- On a class of quadratic programs
- Linear multiplicative programming
- Descent approaches for quadratic bilevel programming
- Foundations of bilevel programming
- Fuzzy programming approach to multi-level programming problems
- Indefinite quadratic integer bilevel programming problem with bounded variables
- On the indefinite quadratic bilevel programming problem.
- Indefinite quadratic fractional functional programming
- The Bargaining Problem
- An indefinite quadratic optimization over an integer efficient set
- Bicriteria Transportation Problem
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- The Linear-Quadratic Bilevel Programming Problem
- Optimality conditions and an algorithm for linear-quadratic bilevel programs$fr1:1$f:1partially supported by nsfc and madis. this paper was prepared during the first author's visiting universitat de barcelona. he is grateful to the financial support provided by universitat de barcelona. the authors are very grateful to the referees for their valuable suggestions and comments
- Extreme point quadratic fractional programming problem
- Bilevel Quadratic Fractional/Quadratic Problem
- Maximization of the ratio of two convex quadratic functions over a polytope
This page was built for publication: Branch and cut method for solving integer indefinite quadratic bilevel programs
