OUTER APPROXIMATION ALGORITHMS FOR LOWER RANK BILINEAR PROGRAMMING PROBLEMS
From MaRDI portal
Publication:4860014
DOI10.15807/jorsj.38.230zbMath0843.90090OpenAlexW2121744616MaRDI QIDQ4860014
Yasutoshi Yajima, Hiroshi Konno
Publication date: 14 January 1996
Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.15807/jorsj.38.230
Related Items
Calculating a minimal sphere containing a polytope defined by a system of linear inequalities ⋮ On the use of optimization models for portfolio selection: A review and some computational results ⋮ Combinatorial optimization with interaction costs: complexity and solvable cases ⋮ A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem
