Jing Zhou, Ye Tian, Lei Zhang. An Enhanced SOCP Relaxation-Based Branch and Bound Algorithm for Quadratic Programming with a Second-Order Cone Constraint and Linear Inequalities. // Journal of the Operations Research Society of China. – 2026. – DOI: 10.1007/s40305-026-00693-5. – URL: https://doi.org/10.1007/s40305-026-00693-5
Jing Zhou, Ye Tian, & Lei Zhang (2026). An Enhanced SOCP Relaxation-Based Branch and Bound Algorithm for Quadratic Programming with a Second-Order Cone Constraint and Linear Inequalities. Journal of the Operations Research Society of China. https://doi.org/10.1007/s40305-026-00693-5
Jing Zhou, et al. “An Enhanced SOCP Relaxation-Based Branch and Bound Algorithm for Quadratic Programming with a Second-Order Cone Constraint and Linear Inequalities.” Journal of the Operations Research Society of China, 2026. doi:10.1007/s40305-026-00693-5.
@article{Zhou2026,
title = {An Enhanced SOCP Relaxation-Based Branch and Bound Algorithm for Quadratic Programming with a Second-Order Cone Constraint and Linear Inequalities},
author = {Zhou, Jing and Tian, Ye and Zhang, Lei},
journal = {Journal of the Operations Research Society of China},
year = {2026},
doi = {10.1007/s40305-026-00693-5},
url = {https://doi.org/10.1007/s40305-026-00693-5}
}