Unsolvability of some optimization problems - Details

author：

Zhu, W. (Zhu, W..) ^[1]

Indexed by：

Scopus

Abstract：

We　show　that　over　unbounded　domain　no　algorithm　can　be　created　for　the　integer　programming,　nonlinear　equations,　continuous　global　optimization　and　constraint　satisfaction　problems.　©　2005　Elsevier　Inc.　All　rights　reserved.

Keyword：

Constraint satisfaction; Global optimization; Integer programming; Nonlinear equations; Unsolvability

Community：

[ 1 ] [Zhu, W.]Department of Computer Science and Technology, Fuzhou University, Fuzhou 350002, China
[ 2 ] [Zhu, W.]Center for Discrete Mathematics, Fuzhou University, Fuzhou 350002, China

Reprint 's Address：

[Zhu, W.]Department of Computer Science and Technology, Fuzhou University, Fuzhou 350002, China

Email：

wxzhu@fzu.edu.cn

Show more details

Related Keywords：

Source ：

Applied Mathematics and Computation

ISSN： 0096-3003

Year： 2006

Issue： 2

Volume： 174

Page： 921-926

0 . 8 1 6

JCR@2006

3 . 5 0 0

JCR@2023

JCR Journal Grade：2

Cited Count：

WoS CC Cited Count：

SCOPUS Cited Count： 9

ESI Highly Cited Papers on the List： 0 Unfold All

WanFang Cited Count：

Chinese Cited Count：

30 Days PV： 2

Affiliated Colleges：

Get Fulltext

DOI Library Discovery Baidu Scholar Search SCOPUS

Type
Departments

All Years Choose Year From to