Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions

Authors: Thai Quynh Phong, Le Dung Muu, Pham Dinh Tao

Source: Computational Optimization and Applications. 4:203-216

Subject Terms: convergent decomposition branch-and-bound algorithms, Mixed integer programming, 0211 other engineering and technologies, adaptive bisection, bilinear programming, 02 engineering and technology, Quadratic programming, Nonconvex programming, global optimization

File Description: application/xml

Access URL: https://zbmath.org/765201
https://doi.org/10.1007/bf01300871
https://rd.springer.com/article/10.1007/BF01300871
https://link.springer.com/article/10.1007%2FBF01300871
https://dblp.uni-trier.de/db/journals/coap/coap4.html#MuuPT95