24 papers:
ICALP-v1-2015-ImM #order- Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities (SI, BM), pp. 737–748.
CIKM-2014-YuR #multi- Search Result Diversification via Filling Up Multiple Knapsacks (HY, FR), pp. 609–618.
DATE-2012-SuriBE #approach #multi #problem #scalability- A scalable GPU-based approach to accelerate the multiple-choice knapsack problem (BS, UDB, PE), pp. 1126–1129.
ICTSS-2012-LahamiKBJ #adaptation #architecture #design #distributed #problem #using- Using Knapsack Problem Model to Design a Resource Aware Test Architecture for Adaptable and Distributed Systems (ML, MK, MB, MJ), pp. 103–118.
ICML-2011-Potetz #linear #problem #using- Estimating the Bayes Point Using Linear Knapsack Problems (BP), pp. 257–264.
DAC-2009-ShojaeiGBGSH #composition #heuristic #multi #runtime- A parameterized compositional multi-dimensional multiple-choice knapsack heuristic for CMP run-time management (HS, AHG, TB, MG, SS, RH), pp. 917–922.
STOC-2009-LeeMNS #constraints- Non-monotone submodular maximization under matroid and knapsack constraints (JL, VSM, VN, MS), pp. 323–332.
SAC-2009-YipH #bound #consistency #constraints- Length-lex bound consistency for knapsack constraints (JY, PVH), pp. 1397–1401.
- ICALP-v1-2006-Harren #approximate #orthogonal #problem
- Approximating the Orthogonal Knapsack Problem for Hypercubes (RH), pp. 238–249.
- ICALP-v2-2006-LyubashevskyM
- Generalized Compact Knapsacks Are Collision Resistant (VL, DM), pp. 144–155.
- SAC-2005-OuajaR #composition #hybrid
- Hybrid Lagrangian relaxation for bandwidth-constrained routing: knapsack decomposition (WO, BR), pp. 383–387.
- STOC-2003-BeierV #polynomial #random
- Random knapsack in expected polynomial time (RB, BV), pp. 232–241.
- ICALP-2002-IwamaT #online #problem
- Removable Online Knapsack Problems (KI, ST), pp. 293–305.
- SAC-2000-Gottlieb #algorithm #multi #problem
- Permutation-Based Evolutionary Algorithms for Multidimensional Knapsack Problems (JG), pp. 408–414.
- STOC-1997-GrigorievK #bound #random
- Randomized Ω(n²) Lower Bound for Knapsack (DG, MK), pp. 76–85.
- SAC-1994-GordonBW #algorithm #performance #problem #search-based
- A note on the performance of genetic algorithms on zero-one knapsack problems (VSG, APWB, DW), pp. 194–195.
- SAC-1994-KhuriBH #algorithm #multi #problem #search-based
- The zero/one multiple knapsack problem and genetic algorithms (SK, TB, JH), pp. 188–193.
- ICALP-1987-Marchetti-SpaccamelaV #algorithm #online #performance #problem
- Efficient On-Line Algorithms for the Knapsack Problem (Extended Abstract) (AMS, CV), pp. 445–456.
- STOC-1984-GoldbergM #on the #problem
- On Finding the Exact Solution of a Zero-One Knapsack Problem (AVG, AMS), pp. 359–368.
- ICALP-1984-Lagarias #analysis #performance
- Performance Analysis of Shamir’s Attack on the Basic Merkle-Hellman Knapsack Cryptosystem (JCL), pp. 312–323.
- STOC-1983-Adleman #on the
- On Breaking Generalized Knapsack Public Key Cryptosystems (Abstract) (LMA), pp. 402–412.
- STOC-1983-Heide #algorithm #linear #polynomial #problem
- A Polynomial Linear Search Algorithm for the N-Dimensional Knapsack Problem (FMadH), pp. 70–79.
- STOC-1981-Yao #on the #parallel #problem
- On the Parallel Computation for the Knapsack Problem (ACCY), pp. 123–127.
- STOC-1979-Shamir #complexity #on the
- On the Cryptocomplexity of Knapsack Systems (AS), pp. 118–129.
