Penalty for zero–one integer equivalent problem |
| |
Authors: | Bahman Kalantari J B Rosen |
| |
Institution: | (1) Computer Science Department, University of Minnesota, Minneapolis, MN, USA |
| |
Abstract: | The equivalence of zero–one integer programming and a concave quadratic penalty function problem has been shown by Raghavachari, for a sufficiently large value of the penalty. A lower bound for this penalty is obtained here, which in specific cases cannot be reduced.This research was supported in part by the Computer Science Section of the National Science Foundation under Research Grant MCS 8101214. |
| |
Keywords: | Integer Programming Global Minimum Concave Quadratic Programming |
本文献已被 SpringerLink 等数据库收录! |