Cutting plane/tabu search algorithms for low rank concave quadratic programming problems
From MaRDI portal
Publication:1272984
DOI10.1023/A:1008230825152zbMath0912.90229OpenAlexW1512142512MaRDI QIDQ1272984
Chenggang Gao, Ichiroh Saitoh, Hiroshi Konno
Publication date: 2 December 1998
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008230825152
Related Items (5)
Solving a class of generalized fractional programming problems using the feasibility of linear programs ⋮ A new Lagrangian-Benders approach for a concave cost supply chain network design problem ⋮ An FPTAS for optimizing a class of low-rank functions over a polytope ⋮ Linear decomposition approach for a class of nonconvex programming problems ⋮ Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints
This page was built for publication: Cutting plane/tabu search algorithms for low rank concave quadratic programming problems
