THE INDEFINITE ZERO-ONE QUADRATIC PROBLEM

被引:45
|
作者
CARTER, MW
机构
关键词
D O I
10.1016/0166-218X(84)90111-2
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
引用
收藏
页码:23 / 44
页数:22
相关论文
共 50 条
  • [21] A tight linearization strategy for zero-one quadratic programming problems
    Gharibi, Wajeb
    Xia, Yong
    International Journal of Computer Science Issues, 2012, 9 (03): : 294 - 299
  • [22] EFFICIENT REDUCTION OF POLYNOMIAL ZERO-ONE OPTIMIZATION TO THE QUADRATIC CASE
    Buchheim, Christoph
    Rinaldi, Giovanni
    SIAM JOURNAL ON OPTIMIZATION, 2008, 18 (04) : 1398 - 1413
  • [23] An improved linearization strategy for zero-one quadratic programming problems
    Sherali, Hanif D.
    Smith, J. Cole
    OPTIMIZATION LETTERS, 2007, 1 (01) : 33 - 47
  • [24] NOTE ON A ZERO-ONE TIME MINIMIZING TRANSPORTATION PROBLEM
    BHATIA, HL
    NEW ZEALAND OPERATIONAL RESEARCH, 1979, 7 (02): : 159 - 165
  • [25] DirichletRank: Solving the zero-one gap problem of PageRank
    Wang, Xuanhui
    Tao, Tao
    Sun, Jian-Ta
    Shakery, Azadeh
    Zhai, Chengxiang
    ACM TRANSACTIONS ON INFORMATION SYSTEMS, 2008, 26 (02)
  • [26] A hybrid approach for the zero-one multidimensional knapsack problem
    Vasquez, M
    Hao, JK
    RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 2001, 35 (04): : 415 - 438
  • [27] SOLUTION OF THE ZERO-ONE MULTIPLE KNAPSACK-PROBLEM
    MARTELLO, S
    TOTH, P
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1980, 4 (04) : 276 - 283
  • [28] THE ZERO-ONE KNAPSACK-PROBLEM WITH EQUALITY CONSTRAINT
    KAUFMAN, L
    PLASTRIA, F
    TUBEECKX, S
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1985, 19 (03) : 384 - 389
  • [29] COMPUTATIONAL ASPECTS OF A BRANCH AND BOUND ALGORITHM FOR QUADRATIC ZERO-ONE PROGRAMMING
    PARDALOS, PM
    RODGERS, GP
    COMPUTING, 1990, 45 (02) : 131 - 144
  • [30] A new AS Algorithm to solve the zero-one knapsack problem
    Wang, Yuanni
    Ge, Fei
    Li, Xiang
    Zhu, Li
    PROGRESS IN INTELLIGENCE COMPUTATION AND APPLICATIONS, PROCEEDINGS, 2007, : 285 - 288