PENALTY FOR ZERO-ONE INTEGER EQUIVALENT PROBLEM

被引:23
|
作者
KALANTARI, B
ROSEN, JB
机构
关键词
D O I
10.1007/BF01585106
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:229 / 232
页数:4
相关论文
共 50 条
  • [41] BRANCH-AND-BOUND ALGORITHM FOR ZERO-ONE MIXED INTEGER PROGRAMMING PROBLEMS
    DAVIS, RE
    KENDRICK, DA
    WEITZMAN, M
    [J]. OPERATIONS RESEARCH, 1971, 19 (04) : 1036 - &
  • [42] Solving zero-one mixed integer programming problems using tabu search
    Molde Coll & Res. Cent Molde, Molde, Norway
    [J]. Eur J Oper Res, 2-3 (624-658):
  • [43] TOOLS FOR REFORMULATING LOGICAL FORMS INTO ZERO-ONE MIXED-INTEGER PROGRAMS
    MITRA, G
    LUCAS, C
    MOODY, S
    HADJICONSTANTINOU, E
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 72 (02) : 262 - 276
  • [44] A HEURISTIC ALGORITHM FOR THE MULTIDIMENSIONAL ZERO-ONE KNAPSACK-PROBLEM
    MAGAZINE, MJ
    OGUZ, O
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1984, 16 (03) : 319 - 326
  • [45] A Hybrid Genetic Algorithm to Solve Zero-One Knapsack Problem
    Chen, Qing
    Shao, Yuxiang
    [J]. 2010 THE 3RD INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND INDUSTRIAL APPLICATION (PACIIA2010), VOL I, 2010, : 185 - 188
  • [46] ZERO-ONE INTEGER-PROGRAMMING FORMULATION OF PROBLEM OF LAND-USE ASSIGNMENT AND TRANSPORTATION-NETWORK DESIGN
    SMITH, JM
    LIEBMAN, JS
    [J]. ENVIRONMENT AND PLANNING B-PLANNING & DESIGN, 1978, 5 (01): : 101 - 115
  • [47] ANALYZING AND MODELING THE MAXIMUM DIVERSITY PROBLEM BY ZERO-ONE PROGRAMMING
    KUO, CC
    GLOVER, F
    DHIR, KS
    [J]. DECISION SCIENCES, 1993, 24 (06) : 1171 - 1185
  • [48] A Hybrid Genetic Algorithm to Solve Zero-One Knapsack Problem
    Chen, Qing
    Shao, Yuxiang
    [J]. APPLIED INFORMATICS AND COMMUNICATION, PT I, 2011, 224 : 315 - +
  • [49] AN EFFICIENT ZERO-ONE FORMULATION OF THE CELL-FORMATION PROBLEM
    ZHU, ZW
    HEADY, RB
    REINERS, S
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 1995, 28 (04) : 911 - 916