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 条

[31] CONTINUOUS MAXIMIN KNAPSACK-PROBLEMS WITH GLB CONSTRAINTS
EISELT, HA
MATHEMATICAL PROGRAMMING, 1986, 36 (01) : 114 - 121
[32] Approximation schemes for r-weighted Minimization Knapsack problems
Khaled Elbassioni
Areg Karapetyan
Trung Thanh Nguyen
Annals of Operations Research, 2019, 279 : 367 - 386
[33] Approximation schemes for r-weighted Minimization Knapsack problems
Elbassioni, Khaled
Karapetyan, Areg
Trung Thanh Nguyen
ANNALS OF OPERATIONS RESEARCH, 2019, 279 (1-2) : 367 - 386
[34] O((log n)2) Time Online Approximation Schemes for Bin Packing and Subset Sum Problems
Ding, Liang
Fu, Bin
Fu, Yunhui
Lu, Zaixin
Zhao, Zhiyu
FRONTIERS IN ALGORITHMICS, 2010, 6213 : 250 - +
[35] 0-1 MULTIDIMENSIONAL KNAPSACK-PROBLEMS - 0-1 OPTIMIZATION OF BOUNDS ON THE SUM OF VARIABLES
BUI, M
RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 1993, 27 (02): : 249 - 264
[36] Approximation schemes for subset-sums ratio problems
Melissinos, Nikolaos
Pagourtzis, Aris
Triommatis, Theofilos
THEORETICAL COMPUTER SCIENCE, 2022, 931 : 17 - 30
[37] MATROIDAL RELAXATIONS FOR 0-1 KNAPSACK-PROBLEMS
AMADO, L
BARCIA, P
OPERATIONS RESEARCH LETTERS, 1993, 14 (03) : 147 - 152
[38] APPROXIMATION SCHEMES FOR THE SUBSET SUM PROBLEM - SURVEY AND EXPERIMENTAL-ANALYSIS
MARTELLO, S
TOTH, P
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1985, 22 (01) : 56 - 69
[39] AN IMPROVED DIRECT DESCENT ALGORITHM FOR BINARY KNAPSACK-PROBLEMS
MURPHY, RA
COMPUTERS & OPERATIONS RESEARCH, 1989, 16 (04) : 305 - 313
[40] PREFERENCE ORDER STOCHASTIC KNAPSACK-PROBLEMS - METHODOLOGICAL ISSUES
SNIEDOVICH, M
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1980, 31 (11) : 1025 - 1032

← 1 2 3 4 5 →