On the Complexity of Semidefinite Programs Lorant PorkolabLeonid Khachiyan OriginalPaper Pages: 351 - 365
Semidefinite Programming Relaxation for Nonconvex Quadratic Programs Tetsuya FujieMasakazu Kojima OriginalPaper Pages: 367 - 380
Comparison of Two Reformulation-Linearization Technique Based Linear Programming Relaxations for Polynomial Programming Problems Hanif D. SheraliCihan H. Tuncbilek OriginalPaper Pages: 381 - 390
QAPLIB – A Quadratic Assignment Problem Library Rainer E. BurkardStefan E. KarischFranz Rendl OriginalPaper Pages: 391 - 403
Optimizing a General Optimal Replacement Model by Fractional Programming Techniques A. I. BarrosR. DekkerS. van Weeren OriginalPaper Pages: 405 - 423
Performance of Neural Net Heuristics for Maximum Clique on Diverse Highly Compressible Graphs Arun K. JagotaKenneth W. Regan OriginalPaper Pages: 439 - 465