Bo Zhang, Suxia Ma, Yuelin Gao. Tight convex relaxation-based simplex branch-and-bound algorithm for generalized linear multiplicative programming. // Operations Research Perspectives. – 2026. – DOI: 10.1016/j.orp.2026.100424. – URL: https://doi.org/10.1016/j.orp.2026.100424
Bo Zhang, Suxia Ma, & Yuelin Gao (2026). Tight convex relaxation-based simplex branch-and-bound algorithm for generalized linear multiplicative programming. Operations Research Perspectives. https://doi.org/10.1016/j.orp.2026.100424
Bo Zhang, et al. “Tight convex relaxation-based simplex branch-and-bound algorithm for generalized linear multiplicative programming.” Operations Research Perspectives, 2026. doi:10.1016/j.orp.2026.100424.
@article{Zhang2026,
title = {Tight convex relaxation-based simplex branch-and-bound algorithm for generalized linear multiplicative programming},
author = {Zhang, Bo and Ma, Suxia and Gao, Yuelin},
journal = {Operations Research Perspectives},
year = {2026},
doi = {10.1016/j.orp.2026.100424},
url = {https://doi.org/10.1016/j.orp.2026.100424}
}