|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 710 occurrences of 401 keywords
|
|
|
Results
Found 2811 publication records. Showing 2811 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
110 | Timothy J. Rolfe |
An alternative dynamic programming solution for the 0/1 knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM SIGCSE Bull. ![In: ACM SIGCSE Bull. 39(4), pp. 54-56, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
0/1 knapsack, knapsack without repetition, dynamic programming, algorithm analysis, knapsack |
95 | Alok Singh 0001, Anurag Singh Baghel |
A New Grouping Genetic Algorithm for the Quadratic Multiple Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EvoCOP ![In: Evolutionary Computation in Combinatorial Optimization, 7th European Conference, EvoCOP 2007, Valencia, Spain, April 11-13, 2007, Proceedings, pp. 210-218, 2007, Springer, 978-3-540-71614-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
quadratic multiple knapsack problem, Combinatorial optimization, knapsack problem, grouping genetic algorithm |
94 | Xin Han, Kazuhisa Makino |
Online Knapsack Problems with Limited Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, pp. 341-351, 2009, Springer, 978-3-642-10630-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
81 | Zhenbo Wang, Wenxun Xing |
A successive approximation algorithm for the multiple knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 17(4), pp. 347-366, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Approximation algorithm, Worst-case analysis, Multiple knapsack problem |
81 | Noboru Kunihiro |
New Definition of Density on Knapsack Cryptosystems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AFRICACRYPT ![In: Progress in Cryptology - AFRICACRYPT 2008, First International Conference on Cryptology in Africa, Casablanca, Morocco, June 11-14, 2008. Proceedings, pp. 156-173, 2008, Springer, 978-3-540-68159-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Low-Weight Knapsack Cryptosystems, Lattice Attack, (pseudo-)density, Shannon Entropy |
81 | René Beier, Berthold Vöcking |
An Experimental Study of Random Knapsack Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 45(1), pp. 121-136, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Random instances, Pareto optimality, Knapsack problem, Experimental study |
81 | Bryant A. Julstrom |
Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2005, Proceedings, Washington DC, USA, June 25-29, 2005, pp. 607-614, 2005, ACM, 1-59593-010-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
greedy operators, quadratic knapsack problem, genetic algorithms |
81 | R. M. F. Goodman, Anthony J. McAuley |
A New Trapdoor Knapsack Public-Key Cryptosystem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology: Proceedings of EUROCRYPT 84, A Workshop on the Theory and Application of of Cryptographic Techniques, Paris, France, April 9-11, 1984, Proceedings, pp. 150-158, 1984, Springer, 3-540-16076-0. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
cryptography, codes, knapsack problem, public key, ciphers |
75 | Marko Loparic, Hugues Marchand, Laurence A. Wolsey |
Dynamic knapsack sets and capacitated lot-sizing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 95(1), pp. 53-69, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
69 | Alper Atamtürk |
Cover and Pack Inequalities for (Mixed) Integer Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 139(1), pp. 21-38, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
knapsack polyhedra, superadditive functions, integer programming, lifting |
66 | Ingemar Ingemarsson |
A new Algorithm for the Solution of the Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Cryptography, Proceedings of the Workshop on Cryptography, Burg Feuerstein, Germany, March 29 - April 2, 1982, pp. 309-315, 1982, Springer. The full citation details ...](Pics/full.jpeg) |
1982 |
DBLP DOI BibTeX RDF |
|
63 | O. L. Mangasarian |
Knapsack feasibility as an absolute value equation solvable by successive linear programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 3(2), pp. 161-170, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Knapsack feasibility, Absolute value equations, Successive linear programming |
63 | Yasuyuki Murakami, Tatsuo Douzono, Takeshi Nasako |
Relationship between weight of plaintext and successful attacks in knapsack cryptosystems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIS ![In: Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human (ICIS 2009), Seoul, Korea, 24-26 November 2009, pp. 935-939, 2009, ACM, 978-1-60558-710-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
knapsack public-key cryptosystem, low-density attack, weight of plaintext, density |
63 | Kazuo Iwama, Guochuan Zhang |
Optimal Resource Augmentations for Online Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings, pp. 180-188, 2007, Springer, 978-3-540-74207-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
On-line algorithms, knapsack, resource augmentation |
63 | Bin Zhang 0003, Hongjun Wu 0001, Dengguo Feng, Feng Bao 0001 |
Cryptanalysis of a Knapsack Based Two-Lock Cryptosystem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACNS ![In: Applied Cryptography and Network Security, Second International Conference, ACNS 2004, Yellow Mountain, China, June 8-11, 2004, Proceedings, pp. 303-309, 2004, Springer, 3-540-22217-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Two-lock cryptosystem, Cryptanalysis, Knapsack problem |
60 | Dibyendu Das |
Function inlining versus function cloning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM SIGPLAN Notices ![In: ACM SIGPLAN Notices 38(6), pp. 23-29, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
compilers, knapsack problem, cloning, inlining |
60 | Dibyendu Das |
Function inlining versus function cloning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM SIGPLAN Notices ![In: ACM SIGPLAN Notices 38(4), pp. 18-24, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
compilers, knapsack problem, cloning, inlining |
59 | Yunhong Zhou, Deeparnab Chakrabarty, Rajan M. Lukose |
Budget constrained bidding in keyword auctions and online knapsack problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WWW ![In: Proceedings of the 17th International Conference on World Wide Web, WWW 2008, Beijing, China, April 21-25, 2008, pp. 1243-1244, 2008, ACM, 978-1-60558-085-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
keyword bidding, multiple-choice knapsack problem, online knapsack problem, sponsored search auction |
59 | Amanda Hiley, Bryant A. Julstrom |
The quadratic multiple knapsack problem and three heuristic approaches to it. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2006, Proceedings, Seattle, Washington, USA, July 8-12, 2006, pp. 547-552, 2006, ACM, 1-59593-186-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
quadratic multiple knapsack problem, genetic algorithm, knapsack problems, greedy heuristic, hill-climber |
57 | Yunhong Zhou |
Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings, pp. 494-506, 2006, Springer, 3-540-49694-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
57 | Brian C. Dean, Michel X. Goemans, Jan Vondrák |
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 45th Symposium on Foundations of Computer Science (FOCS 2004), 17-19 October 2004, Rome, Italy, Proceedings, pp. 208-217, 2004, IEEE Computer Society, 0-7695-2228-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
57 | René Beier, Berthold Vöcking |
An Experimental Study of Random Knapsack Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2004, 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings, pp. 616-627, 2004, Springer, 3-540-23025-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
57 | Thomas Erlebach, Hans Kellerer, Ulrich Pferschy |
Approximating Multi-objective Knapsack Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 7th International Workshop, WADS 2001, Providence, RI, USA, August 8-10, 2001, Proceedings, pp. 210-221, 2001, Springer, 3-540-42423-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
55 | John E. Beasley |
Multidimensional Knapsack Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Optimization ![In: Encyclopedia of Optimization, Second Edition, pp. 2402-2406, 2009, Springer, 978-0-387-74758-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Multidimensional knapsack, Multiconstraint knapsack, Multiple choice knapsack, Combinatorial optimization |
55 | F. Jorissen, Joos Vandewalle, René Govaerts |
Extension of Brickell's Algorithm for Breaking High Density Knapsacks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT '87, Workshop on the Theory and Application of of Cryptographic Techniques, Amsterdam, The Netherlands, April 13-15, 1987, Proceedings, pp. 109-115, 1987, Springer, 3-540-19102-X. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
54 | Jerzy W. Greblicki, Jerzy Kotowski |
Analysis of the Properties of the Harmony Search Algorithm Carried Out on the One Dimensional Binary Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCAST ![In: Computer Aided Systems Theory - EUROCAST 2009, 12th International Conference, Las Palmas de Gran Canaria, Spain, February 15-20, 2009, Revised Selected Papers, pp. 697-704, 2009, Springer, 978-3-642-04771-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
HSA, Lamarck Effect, knapsack problem, Baldwin Effect |
54 | Rajeev Kumar, Ashwin H. Joshi, Krishna K. Banka, Peter I. Rockett |
Evolution of hyperheuristics for the biobjective 0/1 knapsack problem by multiobjective genetic programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2008, Proceedings, Atlanta, GA, USA, July 12-16, 2008, pp. 1227-1234, 2008, ACM, 978-1-60558-130-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
0-1 knapsack problem, genetic algorithm, genetic programming, heuristics, combinatorial optimization, multiobjective optimization, optimization methods, pareto front |
54 | Tugba Saraç, Aydin Sipahioglu |
A Genetic Algorithm for the Quadratic Multiple Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BVAI ![In: Advances in Brain, Vision, and Artificial Intelligence, Second International Symposium, BVAI 2007, Naples, Italy, October 10-12, 2007, Proceedings, pp. 490-498, 2007, Springer, 978-3-540-75554-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Quadratic Multiple Knapsack Problem, Genetic Algorithm, Combinatorial Optimization |
54 | Ravindra K. Ahuja, Claudio Barbieri da Cunha |
Very Large-Scale Neighborhood Search for the K-Constraint Multiple Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Heuristics ![In: J. Heuristics 11(5-6), pp. 465-481, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
neighborhood search algorithms, heuristics, knapsack problem |
54 | César Luis Alonso, Fernando Caro, José Luis Montaña |
An Evolutionary Strategy for the Multidimensional 0-1 Knapsack Problem Based on Genetic Computation of Surrogate Multipliers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWINAC (2) ![In: Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach: First International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2005, Las Palmas, Canary Islands, Spain, June 15-18, 2005, Proceedings, Part II, pp. 63-73, 2005, Springer, 3-540-26319-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
0–1 integer programming, genetic algorithms, Evolutionary computation, combinatorial optimization, knapsack problem |
54 | Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten |
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings, pp. 862-873, 2005, Springer, 3-540-29118-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
min-max regret, mi-nimum spanning tree, approximation, shortest path, knapsack, min-max, fptas |
54 | Sima Uyar, Gülsen Eryigit |
Improvements to penalty-based evolutionary algorithms for the multi-dimensional knapsack problem using a gene-based adaptive mutation approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2005, Proceedings, Washington DC, USA, June 25-29, 2005, pp. 1257-1264, 2005, ACM, 1-59593-010-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
multi-dimensional knapsack problem, penalty-based constraint handling, genetic algorithms, adaptive mutation |
54 | Torsten Fahle, Meinolf Sellmann |
Cost Based Filtering for the Constrained Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 115(1-4), pp. 73-93, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
constrained knapsack problems, constraint programming, optimization constraints, cost based filtering, reduction algorithms |
54 | Hadas Shachnai, Tami Tamir |
On Two Class-Constrained Versions of the Multiple Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 29(3), pp. 442-467, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Multimedia on-demand, Approximation algorithms, Resource allocation, Fairness, Utilization, Packing, Knapsack |
50 | Alexander E. Mohr |
Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DCC ![In: 2002 Data Compression Conference (DCC 2002), 2-4 April, 2002, Snowbird, UT, USA, pp. 352-361, 2002, IEEE Computer Society, 0-7695-1477-4. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
multiple choice knapsack problem, MCKP, data compression, NP-complete, NP-hard, quantization, knapsack problem, bit allocation, rate-distortion optimization |
50 | Silvano Martello, Paolo Toth |
Algorithm 632: A Program for the 0-1 Multiple Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Math. Softw. ![In: ACM Trans. Math. Softw. 11(2), pp. 135-140, 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
single knapsack problem, branch and bound, multiple knapsack problem |
48 | Rung Ching Chen, Cheng-Huei Jian |
Solving Unbounded Knapsack Problem Using an Adaptive Genetic Algorithm with Elitism Strategy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPA Workshops ![In: Frontiers of High Performance Computing and Networking ISPA 2007 Workshops, ISPA 2007 International Workshops SSDSN, UPWN, WISH, SGC, ParDMCom, HiPCoMB, and IST-AWSN Niagara Falls, Canada, August 28 - September 1, 2007, Proceedings, pp. 193-202, 2007, Springer, 978-3-540-74766-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
48 | Jella Pfeiffer, Franz Rothlauf |
Greedy Heuristics and Weight-Coded EAs for Multidimensional Knapsack Problems and Multi-Unit Combinatorial Auctions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OR ![In: Operations Research, Proceedings 2007, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Saarbrücken, Germany, September 5-7, 2007, pp. 153-158, 2007, Springer, 978-3-540-77902-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
48 | Gagan Aggarwal, Jason D. Hartline |
Knapsack auctions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 1083-1092, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
48 | Xiaoling Liu, Shou-Ping Gao, De-Liang Gong, Kenli Li 0001 |
A Parallel Algorithm by Sampling for the Knapsack Problem Based on MIMD Parallel Computers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDCAT ![In: Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2006), 4-7 December 2006, Taipei, Taiwan, pp. 437-441, 2006, IEEE Computer Society, 0-7695-2736-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
48 | Mhand Hifi, Hedi M'Halla, Slim Sadfi |
Sensitivity of the Optimum to Perturbations of the Profit or Weight of an Item in the Binary Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 10(3), pp. 239-260, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
optimality, combinatorial optimization, sensitivity analysis, knapsacks |
48 | Mark Bartlett, Alan M. Frisch, Youssef Hamadi, Ian Miguel, Armagan Tarim, Chris Unsworth |
The Temporal Knapsack Problem and Its Solution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPAIOR ![In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Second International Conference, CPAIOR 2005, Prague, Czech Republic, May 30 - June 1, 2005, Proceedings, pp. 34-48, 2005, Springer, 3-540-26152-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
48 | René Beier, Berthold Vöcking |
Probabilistic analysis of knapsack core algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pp. 468-477, 2004, SIAM, 0-89871-558-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
48 | Abhijit Ray, Wu Jigang, Thambipillai Srikanthan |
Knapsack Model and Algorithm for HW/SW Partitioning Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science ![In: Computational Science - ICCS 2004, 4th International Conference, Kraków, Poland, June 6-9, 2004, Proceedings, Part I, pp. 200-205, 2004, Springer, 3-540-22114-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
48 | Meinolf Sellmann |
Approximated Consistency for Knapsack Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2003, 9th International Conference, CP 2003, Kinsale, Ireland, September 29 - October 3, 2003, Proceedings, pp. 679-693, 2003, Springer, 3-540-20202-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
approximation algorithms, global constraints, optimization constraints, relaxed consistency, cost-based filtering |
48 | Ulrich Pferschy |
Dynamic Programming Revisited: Improving Knapsack Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 63(4), pp. 419-430, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
AMS Subject Classifications: 90C10, 90C39 |
48 | David Pisinger |
A Minimal Algorithm for the Bounded Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 4th International IPCO Conference, Copenhagen, Denmark, May 29-31, 1995, Proceedings, pp. 95-109, 1995, Springer, 3-540-59408-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
48 | J. C. Lagarias 0001 |
Performance Analysis of Shamir's Attack on the Basic Merkle-Hellman Knapsack Cryptosystem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 11th Colloquium, Antwerp, Belgium, July 16-20, 1984, Proceedings, pp. 312-323, 1984, Springer, 3-540-13345-3. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
44 | Guangzhao Cui, Cuiling Li, Xuncai Zhang, Yanfeng Wang, Xinbo Qi, Xiaoguang Li, Haobin Li |
Application of DNA Computing by Self-assembly on 0-1 Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISNN (3) ![In: Advances in Neural Networks - ISNN 2009, 6th International Symposium on Neural Networks, ISNN 2009, Wuhan, China, May 26-29, 2009, Proceedings, Part III, pp. 684-693, 2009, Springer, 978-3-642-01512-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
DNA tile, DNA computing, Knapsack problem, Self-assembly |
44 | Abu Zafar M. Shahriar, Md. Mostofa Akbar, Mohammad Sohel Rahman, Muhammad Abdul Hakim Newton |
A multiprocessor based heuristic for multi-dimensional multiple-choice knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 43(3), pp. 257-280, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Multiprocessor systems, Heuristic algorithms, Knapsack problem, Process synchronization, Inter process communication |
44 | Yalçin Akçay, Haijun Li, Susan H. Xu |
Greedy algorithm for the general multidimensional knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 150(1), pp. 17-29, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Heuristics, Integer programming, Multidimensional knapsack problems |
44 | Jun He 0004, Yuren Zhou |
A Comparison of GAs Using Penalizing Infeasible Solutions and Repairing Infeasible Solutions on Average Capacity Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISICA ![In: Advances in Computation and Intelligence, Second International Symposium, ISICA 2007, Wuhan, China, September 21-23, 2007, Proceedings, pp. 100-109, 2007, Springer, 978-3-540-74580-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Genetic Algorithms, Performance Analysis, Constrained Optimization, Knapsack problem, Computation Time |
44 | Vicky Mak, Tommy Thomadsen |
Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 11(4), pp. 421-434, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Quadratic knapsack, Quadratic selective travelling salesman, Polyhedral analysis, Facets |
44 | Min Kong, Peng Tian |
A New Ant Colony Optimization Applied for the Multidimensional Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SEAL ![In: Simulated Evolution and Learning, 6th International Conference, SEAL 2006, Hefei, China, October 15-18, 2006, Proceedings, pp. 142-149, 2006, Springer, 3-540-47331-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Binary Ant System, Combinatorial Optimization, Ant Colony Optimization, Multidimensional Knapsack Problem |
44 | Arnaud Fréville, Saïd Hanafi |
The Multidimensional 0-1 Knapsack Problem - Bounds and Computational Aspects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 139(1), pp. 195-227, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
multidimensional 0-1 knapsack problem, heuristics and metaheuristics, probabilistic and worst-case analysis, surrogate and composite duality, MIP solvers, preprocessing |
44 | César Luis Alonso, Fernando Caro, José Luis Montaña |
A Flipping Local Search Genetic Algorithm for the Multidimensional 0-1 Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAEPIA ![In: Current Topics in Artificial Intelligence, 11th Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2005, Santiago de Compostela, Spain, November 16-18, 2005, Revised Selected Papers, pp. 21-30, 2005, Springer, 3-540-45914-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
linear 0–1 integer programming, genetic algorithms, Evolutionary computation, knapsack problem |
44 | Michael A. Trick |
A Dynamic Programming Approach for Consistency and Propagation for Knapsack Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 118(1-4), pp. 73-84, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
knapsack constraints, dynamic programming, global constraints |
44 | René Beier, Berthold Vöcking |
Random knapsack in expected polynomial time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 232-241, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
knapsack problem, exact algorithms, average case analysis |
44 | Dima Grigoriev |
Complexity of Positivstellensatz proofs for the knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 10(2), pp. 139-154, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Polynomial calculus, Positivstellensatz proofs, complexity of the knapsack |
42 | Yong Wei, Suchendra M. Bhandarkar, Kang Li 0001 |
Client-centered multimedia content adaptation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Multim. Comput. Commun. Appl. ![In: ACM Trans. Multim. Comput. Commun. Appl. 5(3), pp. 22:1-22:26, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Video personalization, multiple choice multidimensional knapsack problem, hidden Markov models, video indexing |
42 | Thomas Plantard, Willy Susilo |
Broadcast Attacks against Lattice-Based Cryptosystems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACNS ![In: Applied Cryptography and Network Security, 7th International Conference, ACNS 2009, Paris-Rocquencourt, France, June 2-5, 2009. Proceedings, pp. 456-472, 2009, 978-3-642-01956-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Broadcast attack, lattice-based cryptosystem, knapsack cryptosystem, intersecting lattice |
42 | Yong Wei, Suchendra M. Bhandarkar, Kang Li 0001 |
Video personalization in resource-constrained multimedia environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Multimedia ![In: Proceedings of the 15th International Conference on Multimedia 2007, Augsburg, Germany, September 24-29, 2007, pp. 902-911, 2007, ACM, 978-1-59593-702-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
multiple-choice multi-dimensional knapsack problem, request aggregation, video personalization, video summarization |
42 | Phong Q. Nguyen, Jacques Stern |
Adapting Density Attacks to Low-Weight Knapsacks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIACRYPT ![In: Advances in Cryptology - ASIACRYPT 2005, 11th International Conference on the Theory and Application of Cryptology and Information Security, Chennai, India, December 4-8, 2005, Proceedings, pp. 41-58, 2005, Springer, 3-540-30684-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Lattices, Knapsack, Public-Key Cryptanalysis, Subset Sum |
42 | Siming Huang |
Inverse Problems of Some NP-Complete Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Applications in Management, First International Conference, AAIM 2005, Xian, China, June 22-25, 2005, Proceedings, pp. 422-426, 2005, Springer, 3-540-26224-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
pseudo-polynomial algorithm, integer programming, Inverse problem, Knapsack problem |
39 | Weidong Zhang, Baocang Wang, Yupu Hu |
A New Knapsack Public-Key Cryptosystem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IAS ![In: Proceedings of the Fifth International Conference on Information Assurance and Security, IAS 2009, Xi'An, China, 18-20 August 2009, pp. 53-56, 2009, IEEE Computer Society, 978-0-7695-3744-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
39 | Klaus Jansen |
Parameterized approximation scheme for the multiple knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 665-674, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
39 | Sumit Ganguly, Christian Sohler |
d-Dimensional Knapsack in the Streaming Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, pp. 468-479, 2009, Springer, 978-3-642-04127-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
39 | Meinolf Sellmann |
On Decomposing Knapsack Constraints for Length-Lex Bounds Consistency. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2009, 15th International Conference, CP 2009, Lisbon, Portugal, September 20-24, 2009, Proceedings, pp. 762-770, 2009, Springer, 978-3-642-04243-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
39 | Maoguo Gong, Licheng Jiao, Wenping Ma 0001, Shuiping Gou |
Solving multidimensional knapsack problems by an immune-inspired algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Congress on Evolutionary Computation ![In: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2007, 25-28 September 2007, Singapore, pp. 3385-3391, 2007, IEEE, 978-1-4244-1339-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
39 | Moshe Babaioff, Nicole Immorlica, David Kempe 0001, Robert Kleinberg |
A Knapsack Secretary Problem with Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings, pp. 16-28, 2007, Springer, 978-3-540-74207-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
39 | Daniel C. Vanderster, Nikitas J. Dimopoulos, Rafael Parra-Hernandez, Randall J. Sobie |
Evaluation of Knapsack-Based Scheduling Using the NPACI JOBLOG. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HPCS ![In: 20th Annual International Symposium on High Performance Computing Systems and Applications (HPCS 2006), 14-17 May 2006, St. John's, Newfoundland, Canada, pp. 15, 2006, IEEE Computer Society, 0-7695-2582-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
39 | Bin Ye, Jun Sun 0008, Wenbo Xu 0001 |
Solving the Hard Knapsack Problems with a Binary Particle Swarm Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIC (3) ![In: Computational Intelligence and Bioinformatics, International Conference on Intelligent Computing, ICIC 2006, Kunming, China, August 16-19, 2006. Proceedings, Part III, pp. 155-163, 2006, Springer, 3-540-37277-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
39 | Daniel C. Vanderster, Nikitas J. Dimopoulos |
Sensitivity analysis of knapsack-based task scheduling on the grid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICS ![In: Proceedings of the 20th Annual International Conference on Supercomputing, ICS 2006, Cairns, Queensland, Australia, June 28 - July 01, 2006, pp. 317-323, 2006, ACM, 1-59593-282-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
39 | Kwok Yip Szeto, Jian Zhang |
Adaptive Genetic Algorithm and Quasi-parallel Genetic Algorithm: Application to Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LSSC ![In: Large-Scale Scientific Computing, 5th International Conference, LSSC 2005, Sozopol, Bulgaria, June 6-10, 2005, Revised Papers, pp. 189-196, 2005, Springer, 3-540-31994-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
39 | Crina Grosan |
Multiobjective 0/1 Knapsack Problem using Adaptive epsilon-Dominance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WSC ![In: Applied Soft Computing Technologies: The Challenge of Complexity, Proceedings of the 9th Online World Conference on Soft Computing in Industrial Applications (WSC9), September 20th - October 8th, 2004, held on the World Wide Web, pp. 547-556, 2004, Springer, 978-3-540-31649-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
39 | Darrell R. Ulm, Johnnie W. Baker, Michael C. Scherger |
Solving a 2D Knapsack Problem Using a Hybrid Data-Parallel/Control Style of Computing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), CD-ROM / Abstracts Proceedings, 26-30 April 2004, Santa Fe, New Mexico, USA, 2004, IEEE Computer Society, 0-7695-2132-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
39 | Crina Grosan, Mihai Oltean |
Improving the Performance of Evolutionary Algorithms for the Multiobjective 0/1 Knapsack Problem Using e-Dominance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science ![In: Computational Science - ICCS 2004, 4th International Conference, Kraków, Poland, June 6-9, 2004, Proceedings, Part II, pp. 674-677, 2004, Springer, 3-540-22115-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
39 | Hui Han, Hongxun Yao, Shaohui Liu, Yan Liu 0014 |
A Fragile Watermarking Based on Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PCM (3) ![In: Advances in Multimedia Information Processing - PCM 2004, 5th Pacific Rim Conference on Multimedia, Tokyo, Japan, November 30 - December 3, 2004, Proceedings, Part III, pp. 771-776, 2004, Springer, 3-540-23985-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
39 | Yingjie Liu |
The Fully Polynomial Approximation Algorithm for the 0-1 Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 35(5), pp. 559-564, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
39 | Stavros G. Kolliopoulos, George Steiner |
Partially-Ordered Knapsack and Applications to Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings, pp. 612-624, 2002, Springer, 3-540-44180-8. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
39 | Isto Aho |
On the Approximability of Interactive Knapsack Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2001: Theory and Practice of Informatics, 28th Conference on Current Trends in Theory and Practice of Informatics Piestany, Slovak Republic, November 24 - December 1, 2001, Proceedings, pp. 152-159, 2001, Springer, 3-540-42912-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
39 | Brent A. Smolinski |
Approximating the 0-1 Multiple Knapsack Problem with Agent Decomposition and Market Negotiation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEA/AIE ![In: Intelligent Problem Solving, Methodologies and Approaches, 13th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, IEA/AIE 2000, New Orleans, Louisiana, USA, June 19-22, 2000, Proceedings, pp. 296-305, 2000, Springer, 3-540-67689-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
39 | Alfredo Goldman, Denis Trystram |
An Efficient Parallel Algorithm for Solving the Knapsack Problem on the Hypercube. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: 11th International Parallel Processing Symposium (IPPS '97), 1-5 April 1997, Geneva, Switzerland, Proceedings, pp. 608-615, 1997, IEEE Computer Society, 0-8186-7792-9. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
39 | P. Schöbe, James L. Massey |
Fast Authentication in a Trapdoor - Knapsack Public Key Cryptosystem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Cryptography, Proceedings of the Workshop on Cryptography, Burg Feuerstein, Germany, March 29 - April 2, 1982, pp. 289-306, 1982, Springer. The full citation details ...](Pics/full.jpeg) |
1982 |
DBLP DOI BibTeX RDF |
|
39 | Ellis Horowitz, Sartaj Sahni |
Computing Partitions with Applications to the Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 21(2), pp. 277-292, 1974. The full citation details ...](Pics/full.jpeg) |
1974 |
DBLP DOI BibTeX RDF |
|
36 | Kan Takeuchi, John Lin, Yan Chen 0014, Thomas A. Finholt |
Shake it up baby: scheduling with package auctions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), San Diego, California, USA, June 11-15, 2007, pp. 113, 2007, ACM, 978-1-59593-653-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
resource allocation, mechanism design, combinatorial auction, cyberinfrastructure, collaboratory |
36 | Hadas Shachnai, Tami Tamir |
Polynominal time approximation schemes for class-constrained packing problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX ![In: Approximation Algorithms for Combinatorial Optimization, Third International Workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings, pp. 238-249, 2000, Springer, 3-540-67996-0. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
35 | Zhigang Ren, Zuren Feng |
An ant colony optimization approach to the multiple-choice multidimensional knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2010, Proceedings, Portland, Oregon, USA, July 7-11, 2010, pp. 281-288, 2010, ACM, 978-1-4503-0072-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
multiple-choice multidimensional knapsack problem, ant colony optimization, lagrangian relaxation |
35 | Justin Yip, Pascal Van Hentenryck |
Length-lex bound consistency for knapsack constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2009 ACM Symposium on Applied Computing (SAC), Honolulu, Hawaii, USA, March 9-12, 2009, pp. 1397-1401, 2009, ACM, 978-1-60558-166-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
length-lex, set variable, knapsack, bound consistency |
35 | Ling Wang 0009, Xiuting Wang, Minrui Fei |
A novel quantum-inspired pseudorandom proportional evolutionary algorithm for the multidimensional knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GEC Summit ![In: Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation, GEC Summit 2009, Shanghai, China, June 12-14, 2009, pp. 545-552, 2009, ACM, 978-1-60558-326-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
pseudo-random proportional operation, multidimensional knapsack problem, quantum-inspired evolutionary algorithm |
35 | Ricardo P. Beausoleil, M. Gulnara Baldoquin, Rodolfo A. Montejo |
Multi-start and path relinking methods to deal with multiobjective knapsack problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 157(1), pp. 105-133, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Multiple objective metaheuristics, Multi-start methods, Knapsack problems, Path relinking |
35 | Yannick Vimont, Sylvain Boussier, Michel Vasquez |
Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 15(2), pp. 165-178, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Implicit enumeration, Variable fixing, Reduced costs, Constraint propagation, Multidimensional knapsack problem |
35 | Sandro Pirkwieser, Günther R. Raidl, Jakob Puchinger |
A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Recent Advances in Evolutionary Computation for Combinatorial Optimization ![In: Recent Advances in Evolutionary Computation for Combinatorial Optimization, pp. 69-85, 2008, Springer, 978-3-540-70806-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Knapsack Constrained Maximum Spanning Tree, Lagrangian Decomposition, Volume Algorithm, Evolutionary Algorithm, Local Search, Hybrid Approach |
35 | Yunhong Zhou, Victor Naroditskiy |
Algorithm for stochastic multiple-choice knapsack problem and application to keywords bidding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WWW ![In: Proceedings of the 17th International Conference on World Wide Web, WWW 2008, Beijing, China, April 21-25, 2008, pp. 1175-1176, 2008, ACM, 978-1-60558-085-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
keyword bidding, multiple-choice knapsack problem, sponsored search auction, stochastic optimization |
35 | Ying Zhou, Zhanghui Kuang, Jiahai Wang |
A Chaotic Neural Network Combined Heuristic Strategy for Multidimensional Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISICA ![In: Advances in Computation and Intelligence, Third International Symposium, ISICA 2008, Wuhan, China, December 19-21, 2008 Proceedings, pp. 715-722, 2008, Springer, 978-3-540-92136-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Heuristic Strategy, Chaotic Neural Network, Multidimensional Knapsack Problem |
35 | Dominique Quadri, Éric Soutif |
Rewriting integer variables into zero-one variables: Some guidelines for the integer quadratic multi-knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. ![In: Oper. Res. 7(2), pp. 299-314, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
integer quadratic knapsack problem, separable objective function, direct expansion, binary expansion, piecewise interpolation |
35 | Abdelkader Sbihi |
A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 13(4), pp. 337-351, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Combinatorial optimization, Branch and bound, Knapsack, Sequential algorithm |
35 | Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten |
An Efficient Implementation for the 0-1 Multi-objective Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WEA ![In: Experimental Algorithms, 6th International Workshop, WEA 2007, Rome, Italy, June 6-8, 2007, Proceedings, pp. 406-419, 2007, Springer, 978-3-540-72844-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
multi-objective knapsack problem, dynamic programming, combinatorial optimization, efficient solutions, dominance relations |
35 | C. Patvardhan 0001, Apurva Narayan, Anand Srivastav |
Enhanced Quantum Evolutionary Algorithms for Difficult Knapsack Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PReMI ![In: Pattern Recognition and Machine Intelligence, Second International Conference, PReMI 2007, Kolkata, India, December 18-22, 2007, Proceedings, pp. 252-260, 2007, Springer, 978-3-540-77045-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Evolutionary Algorithms, knapsack, Quantum |
35 | Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten |
A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, pp. 717-728, 2007, Springer, 978-3-540-75519-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Multi-objective knapsack problem, dynamic programming, combinatorial optimization, approximation, dominance relations |
Displaying result #1 - #100 of 2811 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|