Unsolvability of some optimization problems
作者：
Highlights：
•
摘要
We show that over unbounded domain no algorithm can be created for the integer programming, nonlinear equations, continuous global optimization and constraint satisfaction problems.
论文关键词：Integer programming,Nonlinear equations,Global optimization,Constraint satisfaction,Unsolvability
论文评审过程：Available online 21 July 2005.
论文官网地址：https://doi.org/10.1016/j.amc.2005.05.025
