Journal of the Operations Research Society of China ›› 2013, Vol. 1 ›› Issue (1): 3-.
• Continuous Optimization • Previous Articles Next Articles
Online:
Published:
Abstract: In this paper, we consider approximation algorithms for optimizing a generic multivariate polynomial function in discrete (typically binary) variables. Such models have natural applications in graph theory, neural networks, error-correcting codes, among many others. In particular, we focus on three types of optimization models: (1) maximizing a homogeneous polynomial function in binary variables; (2) maximizing a homogeneous polynomial function in binary variables, mixed with variables under spherical constraints; (3) maximizing an inhomogeneous polynomial function in binary variables. We propose polynomial-time randomized approximation algorithms for such polynomial optimization models, and establish the approximation ratios (or relative approximation ratios whenever appropriate) for the proposed algorithms. Some examples of applications for these models and algorithms are discussed as well.
Key words: Polynomial optimization problem , Binary integer programming , Mixed integer programming , Approximation algorithm , Approximation ratio
Si-Mai He · Zhe-Ning Li · Shu-Zhong Zhang. Approximation Algorithms for Discrete Polynomial Optimization[J]. Journal of the Operations Research Society of China, 2013, 1(1): 3-.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jorsc.shu.edu.cn/EN/
https://www.jorsc.shu.edu.cn/EN/Y2013/V1/I1/3