PARALLEL APPROXIMATION SCHEMES FOR SUBSET SUM AND KNAPSACK-PROBLEMS

被引：3

作者：

PETERS, JG

RUDOLPH, L

机构：

[1] CARNEGIE MELLON UNIV,DEPT COMP SCI,PITTSBURGH,PA 15213

[2] UNIV TORONTO,DEPT COMP SCI,TORONTO M5S 1A1,ONTARIO,CANADA

来源：

ACTA INFORMATICA | 1987年 / 24卷 / 04期

关键词：

D O I：

10.1007/BF00292111

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：417 / 432

页数：16

共 50 条

[41] A SOLUTION PROCEDURE FOR GENERAL KNAPSACK-PROBLEMS WITH A FEW CONSTRAINTS
OZDEN, M
COMPUTERS & OPERATIONS RESEARCH, 1988, 15 (02) : 145 - 155
[42] AN ALGORITHM FOR LARGE ZERO-ONE KNAPSACK-PROBLEMS
BALAS, E
ZEMEL, E
OPERATIONS RESEARCH, 1980, 28 (05) : 1130 - 1154
[43] A BRANCH AND SEARCH ALGORITHM FOR A CLASS OF NONLINEAR KNAPSACK-PROBLEMS
MATHUR, K
SALKIN, HM
MORITO, S
OPERATIONS RESEARCH LETTERS, 1983, 2 (04) : 155 - 160
[44] BUFFER ALLOCATION FOR A CLASS OF NONLINEAR STOCHASTIC KNAPSACK-PROBLEMS
SMITH, JM
CHIKHALE, N
ANNALS OF OPERATIONS RESEARCH, 1995, 58 : 323 - 360
[45] Parallel approximation schemes for problems on planar graphs
Diaz, J
Serna, MJ
Toran, J
ACTA INFORMATICA, 1996, 33 (04) : 387 - 408
[46] AN IMPROVED HEURISTIC FOR MULTIDIMENSIONAL 0-1 KNAPSACK-PROBLEMS
VOLGENANT, A
ZOON, JA
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1990, 41 (10) : 963 - 970
[47] APPROXIMATE ALGORITHMS FOR THE MULTIPLE-CHOICE CONTINUOUS KNAPSACK-PROBLEMS
IBARAKI, T
JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1980, 23 (01) : 28 - 63
[48] A LINEAR-TIME ALGORITHM FOR SOLVING CONTINUOUS MAXIMIN KNAPSACK-PROBLEMS
KUNO, T
KONNO, H
ZEMEL, E
OPERATIONS RESEARCH LETTERS, 1991, 10 (01) : 23 - 26
[49] Approximation schemes for the parametric knapsack problem
Giudici, Alberto
Halffmann, Pascal
Ruzika, Stefan
Thielen, Clemens
INFORMATION PROCESSING LETTERS, 2017, 120 : 11 - 15
[50] SOME COMPLEXITY ISSUES IN A CLASS OF KNAPSACK-PROBLEMS - WHAT MAKES A KNAPSACK-PROBLEM HARD
KRASS, D
SETHI, SP
SORGER, G
INFOR, 1994, 32 (03) : 149 - 162

← 1 2 3 4 5 →