Cite
HARVARD Citation
Wang, C. et al. (2017). A practicable branch-and-bound algorithm for globally solving linear multiplicative programming. Optimization. pp. 397-405. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Wang, C. et al. (2017). A practicable branch-and-bound algorithm for globally solving linear multiplicative programming. Optimization. pp. 397-405. [Online].