Aida Khajavirad. A polynomial-time solvable class of sparse box-constrained polynomial optimization problems. // Operations Research Letters. – 2027. – DOI: 10.1016/j.orl.2026.107563. – URL: https://doi.org/10.1016/j.orl.2026.107563
Aida Khajavirad (2027). A polynomial-time solvable class of sparse box-constrained polynomial optimization problems. Operations Research Letters. https://doi.org/10.1016/j.orl.2026.107563
Aida Khajavirad. “A polynomial-time solvable class of sparse box-constrained polynomial optimization problems.” Operations Research Letters, 2027. doi:10.1016/j.orl.2026.107563.
@article{Khajavirad2027,
title = {A polynomial-time solvable class of sparse box-constrained polynomial optimization problems},
author = {Khajavirad, Aida},
journal = {Operations Research Letters},
year = {2027},
doi = {10.1016/j.orl.2026.107563},
url = {https://doi.org/10.1016/j.orl.2026.107563}
}