MERGING AND SORTING APPLIED TO ZERO-ONE KNAPSACK PROBLEM

被引：31

作者：

AHRENS, JH ^{[1
]}

FINKE, G ^{[1
]}

机构：

[1] NOVA SCOTIA TECH COLL,HALIFAX,NOVA SCOTIA,CANADA

来源：

OPERATIONS RESEARCH | 1975年 / 23卷 / 06期

关键词：

D O I：

10.1287/opre.23.6.1099

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：1099 / 1109

页数：11

共 50 条

[31] Rewriting integer variables into zero-one variables: Some guidelines for the integer quadratic multi-knapsack problem
Dominique Quadri
Eric Soutif
Operational Research, 2007, 7 (2)
[32] Asymptotic analysis on an unbounded zero-one knapsack with discrete-sized objects
Sum, J
Wu, J
PDPTA'03: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS 1-4, 2003, : 1829 - 1831
[33] AN APPROXIMATE ALGORITHM FOR MULTIDIMENSIONAL ZERO-ONE KNAPSACK-PROBLEMS - A PARAMETRIC APPROACH
LEE, JS
GUIGNARD, M
MANAGEMENT SCIENCE, 1988, 34 (03) : 402 - 410
[34] EFFICIENT ALGORITHMS FOR SOLVING MULTICONSTRAINT ZERO-ONE KNAPSACK-PROBLEMS TO OPTIMALITY
GAVISH, B
PIRKUL, H
MATHEMATICAL PROGRAMMING, 1985, 31 (01) : 78 - 105
[35] NOTE ON A ZERO-ONE TIME MINIMIZING TRANSPORTATION PROBLEM
BHATIA, HL
NEW ZEALAND OPERATIONAL RESEARCH, 1979, 7 (02): : 159 - 165
[36] 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)
[37] METHOD FOR SOLVING ZERO-ONE-KNAPSACK PROBLEM
KRAWCZYK, R
ANGEWANDTE INFORMATIK, 1972, (05): : 223 - &
[38] SOME EXPERIENCES ON SOLVING MULTICONSTRAINT ZERO-ONE KNAPSACK-PROBLEMS WITH GENETIC ALGORITHMS
THIEL, J
VOSS, S
INFOR, 1994, 32 (04) : 226 - 242
[39] ZERO-ONE LAWS
MORGAN, JC
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1977, 62 (02) : 353 - 358
[40] ZERO-ONE PROGRAMMING
PADBERG, MW
OPERATIONS RESEARCH, 1975, 23 (04) : 833 - 837

← 1 2 3 4 5 →