Indexed by：
Abstract：
A linearly constrained 0-1 quadratic programming problem is proved to be equivalent to a continuous concave quadratic problem with an easily computed penalty parameter. Moreover, it is proved that the feasibility of the former problem can be checked by solving the latter.
Keyword：
Reprint 's Address：
Email：
Version：
Source ：
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS
ISSN： 0022-3239
Year： 2003
Issue： 1
Volume： 116
Page： 229-239
0 . 5 8 3
JCR@2003
1 . 6 0 0
JCR@2023
ESI Discipline： ENGINEERING;
JCR Journal Grade：2
Cited Count：
SCOPUS Cited Count：
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 0
Affiliated Colleges：
