Linear Reformulation of Polynomial Discrete Programming for Fast Computation
Published Online:21 Dec 2016https://doi.org/10.1287/ijoc.2016.0716
- Cited by
- 30 May 2026 | Computational Optimization and Applications, Vol. 28
- 2 January 2023 | International Transactions in Operational Research, Vol. 31, No. 4
- 2 March 2023 | Optimization Letters, Vol. 17, No. 4
- Expert Systems with Applications, Vol. 205
- 23 August 2022 | Processes, Vol. 10, No. 9
- 10 June 2021 | Journal of Global Optimization, Vol. 80, No. 3
- IEEE Transactions on Reliability, Vol. 70, No. 1
- Physica A: Statistical Mechanics and its Applications, Vol. 542
- European Journal of Operational Research, Vol. 281, No. 1
- Physica A: Statistical Mechanics and its Applications, Vol. 535
- Applied Mathematical Modelling, Vol. 71
- Applied Mathematical Modelling, Vol. 58
Volume 29, Issue 1
Winter 2017
Pages 1-195
Article Information
Supplemental Material
Metrics
Information
- Received:October 01, 2014
- Accepted:March 01, 2015
- Published Online:December 21, 2016
Copyright © 2016, INFORMS
Cite as
Han-Lin Li, Yao-Huei Huang, Shu-Cherng Fang (2016) Linear Reformulation of Polynomial Discrete Programming for Fast Computation. INFORMS Journal on Computing 29(1):108-122.
https://doi.org/10.1287/ijoc.2016.0716
Keywords
