EFFICIENT ALGORITHMS FOR SOLVING MULTICONSTRAINT ZERO-ONE KNAPSACK-PROBLEMS TO OPTIMALITY

被引：155

作者：

GAVISH, B ^{[1
]}

PIRKUL, H ^{[1
]}

机构：

[1] OHIO STATE UNIV,ACAD FAC ACCOUNTING,COLUMBUS,OH 43210

来源：

MATHEMATICAL PROGRAMMING | 1985年 / 31卷 / 01期

关键词：

D O I：

10.1007/BF02591863

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

MATHEMATICAL PROGRAMMING

引用

页码：78 / 105

页数：28

共 41 条

[1] PIVOT AND COMPLEMENT - A HEURISTIC FOR 0-1 PROGRAMMING [J].

BALAS, E ;

MARTIN, CH .

MANAGEMENT SCIENCE, 1980, 26 (01) :86-96

[2] AN ALGORITHM FOR LARGE ZERO-ONE KNAPSACK-PROBLEMS [J].

BALAS, E ;

ZEMEL, E .

OPERATIONS RESEARCH, 1980, 28 (05) :1130-1154

[3] COMPUTATIONAL RESULTS WITH A BRANCH-AND-BOUND ALGORITHM FOR THE GENERAL KNAPSACK PROBLEM [J].

BULFIN, RL ;

PARKER, RG ;

SHETTY, CM .

NAVAL RESEARCH LOGISTICS, 1979, 26 (01) :41-46

[4] AN ENUMERATION ALGORITHM FOR KNAPSACK PROBLEMS [J].

CABOT, AV .

OPERATIONS RESEARCH, 1970, 18 (02) :306-&

[5]

CHALMET L, 1976, 2ND P EUR C OP RES N, P103

[6] CALCULATING SURROGATE CONSTRAINTS [J].

DYER, ME .

MATHEMATICAL PROGRAMMING, 1980, 19 (03) :255-278

[7] DUAL-BASED PROCEDURE FOR UNCAPACITATED FACILITY LOCATION [J].

ERLENKOTTER, D .

OPERATIONS RESEARCH, 1978, 26 (06) :992-1009

[8] GENERALIZED LAGRANGE MULTIPLIER METHOD FOR SOLVING PROBLEMS OF OPTIMUM ALLOCATION OF RESOURCES [J].

EVERETT, H .

OPERATIONS RESEARCH, 1963, 11 (03) :399-417

[9] AN ALGORITHM FOR OPTIMAL ROUTE SELECTION IN SNA NETWORKS [J].

GAVISH, B ;

HANTLER, SL .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1983, 31 (10) :1154-1161

[10] TOPOLOGICAL DESIGN OF CENTRALIZED COMPUTER-NETWORKS - FORMULATIONS AND ALGORITHMS [J].

GAVISH, B .

NETWORKS, 1982, 12 (04) :355-377

← 1 2 3 4 5 →