Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
12 | Alejandro Marrero, Eduardo Segredo, Coromoto León, Emma Hart |
A Novelty-Search Approach to Filling an Instance-Space with Diverse and Discriminatory Instances for the Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPSN (1) ![In: Parallel Problem Solving from Nature - PPSN XVII - 17th International Conference, PPSN 2022, Dortmund, Germany, September 10-14, 2022, Proceedings, Part I, pp. 223-236, 2022, Springer, 978-3-031-14713-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Adel Nikfarjam, Anh Viet Do, Frank Neumann 0001 |
Analysis of Quality Diversity Algorithms for the Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPSN (2) ![In: Parallel Problem Solving from Nature - PPSN XVII - 17th International Conference, PPSN 2022, Dortmund, Germany, September 10-14, 2022, Proceedings, Part II, pp. 413-427, 2022, Springer, 978-3-031-14720-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Aneta Neumann, Yue Xie, Frank Neumann 0001 |
Evolutionary Algorithms for Limiting the Effect of Uncertainty for the Knapsack Problem with Stochastic Profits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPSN (1) ![In: Parallel Problem Solving from Nature - PPSN XVII - 17th International Conference, PPSN 2022, Dortmund, Germany, September 10-14, 2022, Proceedings, Part I, pp. 294-307, 2022, Springer, 978-3-031-14713-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu |
On the Complexity of Separation from the Knapsack Polytope. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization - 23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27-29, 2022, Proceedings, pp. 168-180, 2022, Springer, 978-3-031-06900-0. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Canh V. Pham, Dung K. T. Ha 0001, Huan X. Hoang, Tan D. Tran |
Fast Streaming Algorithms for k-Submodular Maximization under a Knapsack Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DSAA ![In: 9th IEEE International Conference on Data Science and Advanced Analytics, DSAA 2022, Shenzhen, China, October 13-16, 2022, pp. 1-10, 2022, IEEE, 978-1-6654-7330-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Jiashuo Jiang, Will Ma, Jiawei Zhang 0006 |
Tight Guarantees for Multi-unit Prophet Inequalities and Online Stochastic Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022, pp. 1221-1246, 2022, SIAM, 978-1-61197-707-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Kosuke Aratani, Masakazu Muramatsu |
A Variant of Knapsack Problem Efficient for Benders Decomposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IIAI-AAI-Winter ![In: 2022 13th International Congress on Advanced Applied Informatics Winter, IIAI-AAI 2022 -Winter, Phuket, Thailand, December 12-14, 2022, pp. 152-157, 2022, IEEE, 979-8-3503-0992-8. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Enpei Zhang, Kai Han 0003, Benwei Wu |
An Algorithmic View of Streaming Submodular Data Summarization with A Knapsack Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DSIT ![In: 5th International Conference on Data Science and Information Technology, DSIT 2022, Shanghai, China, July 22-24, 2022, pp. 1-6, 2022, IEEE, 978-1-6654-9868-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Amy Peerlinck, John Sheppard 0001 |
Multi-Objective Factored Evolutionary Optimization and the Multi-Objective Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CEC ![In: IEEE Congress on Evolutionary Computation, CEC 2022, Padua, Italy, July 18-23, 2022, pp. 1-8, 2022, IEEE, 978-1-6654-6708-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Victoria Miranda-Burgos, Nicolás Rojas-Morales |
Opposition-Inspired Strategies for Tabu Search approaches proposed for Knapsack Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CEC ![In: IEEE Congress on Evolutionary Computation, CEC 2022, Padua, Italy, July 18-23, 2022, pp. 1-8, 2022, IEEE, 978-1-6654-6708-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Zhicheng Liu, Jing Jin, Donglei Du, Xiaoyan Zhang 0001 |
Two-Stage Submodular Maximization Under Knapsack and Matroid Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation - 17th Annual Conference, TAMC 2022, Tianjin, China, September 16-18, 2022, Proceedings, pp. 140-154, 2022, Springer, 978-3-031-20349-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Soh Kumabe, Yuichi Yoshida |
Average Sensitivity of the Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany., pp. 75:1-75:14, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-247-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Sheng Yang 0005, Samir Khuller, Sunav Choudhary, Subrata Mitra, Kanak Mahadik |
Correlated Stochastic Knapsack with a Submodular Objective. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany., pp. 91:1-91:14, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-247-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Klaus Jansen, Arindam Khan 0001, Marvin Lira, K. V. N. Sreenivas |
A PTAS for Packing Hypercubes into a Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France., pp. 78:1-78:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-235-8. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Karl Bringmann, Alejandro Cassis |
Faster Knapsack Algorithms via Bounded Monotone Min-Plus-Convolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France., pp. 31:1-31:21, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-235-8. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Ziqiang Luo, Xueping Guo, Bin Wen, Junkuo Cao |
An Evolution Algorithm Based on Cloud Model for 0-1 Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCID ![In: 15th International Symposium on Computational Intelligence and Design, ISCID 2022, Hangzhou, China, December 17-18, 2022, pp. 147-150, 2022, IEEE, 978-1-6654-5616-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Lin Yang, Ali Zeynali, Mohammad H. Hajiesmaili, Ramesh K. Sitaraman, Don Towsley |
Competitive Algorithms for Online Multidimensional Knapsack Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMETRICS (Abstracts) ![In: SIGMETRICS/PERFORMANCE '22: ACM SIGMETRICS/IFIP PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems, Mumbai, India, June 6 - 10, 2022, pp. 87-88, 2022, ACM, 978-1-4503-9141-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu |
New Classes of Facets for Complementarity Knapsack Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCO ![In: Combinatorial Optimization - 7th International Symposium, ISCO 2022, Virtual Event, May 18-20, 2022, Revised Selected Papers, pp. 3-21, 2022, Springer, 978-3-031-18529-8. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Yanlian Du, Zejing Feng, Yijun Shen |
A Mixed-Factor Evolutionary Algorithm for Multi-objective Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIC (1) ![In: Intelligent Computing Theories and Application - 18th International Conference, ICIC 2022, Xi'an, China, August 7-11, 2022, Proceedings, Part I, pp. 51-67, 2022, Springer, 978-3-031-13869-0. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Md. Meheruzzaman Sarker, Md. Jakirul Islam, Md. Zakir Hossain |
A Clustering Based Niching Method for Effectively Solving the 0-1 Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MIET (2) ![In: Machine Intelligence and Emerging Technologies - First International Conference, MIET 2022, Noakhali, Bangladesh, September 23-25, 2022, Proceedings, Part II, pp. 173-187, 2022, Springer, 978-3-031-34621-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Imen Ben Mansour |
Optimizing Multi-objective Knapsack Problem using a Hybrid Ant Colony Approach within Multi Directional Framework. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICAART (2) ![In: Proceedings of the 14th International Conference on Agents and Artificial Intelligence, ICAART 2022, Volume 2, Online Streaming, February 3-5, 2022., pp. 409-418, 2022, SCITEPRESS, 978-989-758-547-0. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Andreas Abels, Leon Ladewig, Kevin Schewior, Moritz Stinzendörfer |
Knapsack Secretary Through Boosting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms - 20th International Workshop, WAOA 2022, Potsdam, Germany, September 8-9, 2022, Proceedings, pp. 61-81, 2022, Springer, 978-3-031-18366-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Benwei Wu, Kai Han 0003 |
Fast Algorithm for Big Data Summarization with Knapsack and Partition Matroid Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INISTA ![In: International Conference on INnovations in Intelligent SysTems and Applications, INISTA 2022, Biarritz, France, August 8-12, 2022, pp. 1-6, 2022, IEEE, 978-1-6654-9810-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Fatiha Bendali, Jean Mailfert, Eloise Mole Kamga, Alain Quilliot, Hélène Toussaint |
A Synchronized Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoDIT ![In: 8th International Conference on Control, Decision and Information Technologies, CoDIT 2022, Istanbul, Turkey, May 17-20, 2022, pp. 687-692, 2022, IEEE, 978-1-6654-9607-0. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Takuya Miyamoto, Akihiro Fujiwara |
Robust optimization algorithms for multi-objective knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CANDARW ![In: 2022 Tenth International Symposium on Computing and Networking, CANDAR 2022 - Workshops, Himeji, Japan, November 21-24, 2022, pp. 430-432, 2022, IEEE, 978-1-6654-7532-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Joan Boyar, Lene M. Favrholdt, Kim S. Larsen |
Online Unit Profit Knapsack with Untrusted Predictions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: 18th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2022, June 27-29, 2022, Tórshavn, Faroe Islands., pp. 20:1-20:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-236-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Maying Shen, Hongxu Yin, Pavlo Molchanov 0001, Lei Mao, Jianna Liu, José M. Álvarez 0004 |
Structural Pruning via Latency-Saliency Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NeurIPS ![In: Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, NeurIPS 2022, New Orleans, LA, USA, November 28 - December 9, 2022., 2022, 9781713871088. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
12 | Qi Qiu, Junyi He, Tao Zhu 0001 |
DE with A new population initialization method for the dynamic multidimensional knapsack problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDIS ![In: 4th International Conference on Data Intelligence and Security, ICDIS 2022, Shenzhen, China, August 24-26, 2022, pp. 415-421, 2022, IEEE, 978-1-6654-5968-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Max Klimm, Martin Knaack |
Maximizing a Submodular Function with Bounded Curvature Under an Unknown Knapsack Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 49:1-49:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Katharina Boudgoust, Erell Gachon, Alice Pellet-Mary |
Some Easy Instances of Ideal-SVP and Implications on the Partial Vandermonde Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO (2) ![In: Advances in Cryptology - CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, August 15-18, 2022, Proceedings, Part II, pp. 480-509, 2022, Springer, 978-3-031-15978-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Velichka Traneva, Petar R. Petrov, Stoyan Tranev |
Intuitionistic Fuzzy Knapsack Problem Trough the Index Matrices Prism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NMA ![In: Numerical Methods and Applications - 10th International Conference, NMA 2022, Borovets, Bulgaria, August 22-26, 2022, Proceedings, pp. 314-326, 2022, Springer, 978-3-031-32411-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Jingwen Chen, Zhongzheng Tang, Chenhao Wang 0001 |
Monotone k-Submodular Knapsack Maximization: An Analysis of the Greedy+Singleton Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Aspects in Information and Management - 16th International Conference, AAIM 2022, Guangzhou, China, August 13-14, 2022, Proceedings, pp. 144-155, 2022, Springer, 978-3-031-16080-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Kemin Yu, Min Li 0028, Yang Zhou 0018, Qian Liu |
Guarantees for Maximization of k-Submodular Functions with a Knapsack and a Matroid Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Aspects in Information and Management - 16th International Conference, AAIM 2022, Guangzhou, China, August 13-14, 2022, Proceedings, pp. 156-167, 2022, Springer, 978-3-031-16080-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Zhen Song, Wenjian Luo, Xin Lin, Zeneng She, Qingfu Zhang 0001 |
On Multiobjective Knapsack Problems with Multiple Decision Makers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSCI ![In: IEEE Symposium Series on Computational Intelligence, SSCI 2022, Singapore, December 4-7, 2022, pp. 156-163, 2022, IEEE, 978-1-6654-8768-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Pallavi Jain 0001, Krzysztof Sornat, Nimrod Talmon |
Preserving Consistency for Liquid Knapsack Voting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUMAS ![In: Multi-Agent Systems - 19th European Conference, EUMAS 2022, Düsseldorf, Germany, September 14-16, 2022, Proceedings, pp. 221-238, 2022, Springer, 978-3-031-20613-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Abdeldjalil Ikhelef, Mohand Yazid Saidi, Shuopeng Li, Ken Chen |
A Knapsack-based Optimization Algorithm for VNF Placement and Chaining Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCN ![In: 47th IEEE Conference on Local Computer Networks, LCN 2022, Edmonton, AB, Canada, September 26-29, 2022, pp. 430-437, 2022, IEEE, 978-1-6654-8001-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Binh Thanh Dang, Bach Hoai Nguyen, Peter Andreae |
Operation-based Greedy Algorithm for Discounted Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AI ![In: AI 2022: Advances in Artificial Intelligence - 35th Australasian Joint Conference, AI 2022, Perth, WA, Australia, December 5-8, 2022, Proceedings, pp. 646-660, 2022, Springer, 978-3-031-22694-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Andrzej Chmielowiec, Leszek Klich, Weronika Wos, Adam Blachowicz |
Global Spare Parts Exploitation Costs Optymization and Its Reduction to Rectangular Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICEIS (1) ![In: Proceedings of the 24th International Conference on Enterprise Information Systems, ICEIS 2022, Online Streaming, April 25-27, 2022, Volume 1., pp. 364-373, 2022, SCITEPRESS, 978-989-758-569-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Jacopo Pierotti |
Models and heuristics for hard routing and knapsack problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2022 |
RDF |
|
12 | Lin Yang, Ali Zeynali, Mohammad H. Hajiesmaili, Ramesh K. Sitaraman, Don Towsley |
Competitive Algorithms for Online Multidimensional Knapsack Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proc. ACM Meas. Anal. Comput. Syst. ![In: Proc. ACM Meas. Anal. Comput. Syst. 5(3), pp. 30:1-30:30, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Jing Tang 0004, Xueyan Tang, Andrew Lim 0001, Kai Han 0003, Chongshou Li, Junsong Yuan |
Revisiting Modified Greedy Algorithm for Monotone Submodular Maximization with a Knapsack Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proc. ACM Meas. Anal. Comput. Syst. ![In: Proc. ACM Meas. Anal. Comput. Syst. 5(1), pp. 08:1-08:22, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Kai Han 0003, Shuang Cui, Tianshuai Zhu, Enpei Zhang, Benwei Wu, Zhizhuo Yin, Tong Xu 0001, Shaojie Tang 0001, He Huang 0001 |
Approximation Algorithms for Submodular Data Summarization with a Knapsack Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proc. ACM Meas. Anal. Comput. Syst. ![In: Proc. ACM Meas. Anal. Comput. Syst. 5(1), pp. 05:1-05:31, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Bo Sun 0004, Lin Yang, Mohammad H. Hajiesmaili, Adam Wierman, John C. S. Lui, Don Towsley, Danny H. K. Tsang |
The Online Knapsack Problem with Departures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proc. ACM Meas. Anal. Comput. Syst. ![In: Proc. ACM Meas. Anal. Comput. Syst. 6(3), pp. 57:1-57:32, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Zequn Wei, Jin-Kao Hao |
Kernel based tabu search for the Set-union Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expert Syst. Appl. ![In: Expert Syst. Appl. 165, pp. 113802, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Jiaxin Li, Yan Lan, Feng Chen 0004, Xin Han, Jacek Blazewicz |
A Fast Algorithm for Knapsack Problem with Conflict Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asia Pac. J. Oper. Res. ![In: Asia Pac. J. Oper. Res. 38(6), pp. 2150010:1-2150010:34, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Yijing Wang, Donglei Du, Yanjun Jiang, Xianzhao Zhang |
Non-Submodular Maximization with Matroid and Knapsack Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asia Pac. J. Oper. Res. ![In: Asia Pac. J. Oper. Res. 38(5), pp. 2140001:1-2140001:22, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Ranjith J, Mahantesh K |
Blockchain-based Knapsack System for Security and Privacy Preserving to Medical Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SN Comput. Sci. ![In: SN Comput. Sci. 2(4), pp. 245, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Isma Dahmani, Mhand Hifi |
A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 298(1), pp. 125-147, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Gabriel L. Zenarosa, Oleg A. Prokopyev, Eduardo L. Pasiliao |
On exact solution approaches for bilevel quadratic 0-1 knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 298(1), pp. 555-572, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Shijin Wang 0002, Wenli Cui, Feng Chu 0001, Jianbo Yu |
The interval min-max regret knapsack packing-delivery problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Prod. Res. ![In: Int. J. Prod. Res. 59(18), pp. 5661-5677, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Ran Wang 0001, Zichao Zhang |
Set Theory-Based Operator Design in Evolutionary Algorithms for Solving Knapsack Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Evol. Comput. ![In: IEEE Trans. Evol. Comput. 25(6), pp. 1133-1147, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Yasemin Merzifonluoglu, Joseph Geunes |
The Risk-Averse Static Stochastic Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFORMS J. Comput. ![In: INFORMS J. Comput. 33(3), pp. 931-948, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Yu Yang 0014, Natashia Boland, Martin W. P. Savelsbergh |
Multivariable Branching: A 0-1 Knapsack Problem Case Study. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFORMS J. Comput. ![In: INFORMS J. Comput. 33(4), pp. 1354-1367, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Daniel Blado, Alejandro Toriello |
A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. Comput. ![In: Math. Program. Comput. 13(1), pp. 185-223, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Iván Derpich, Carlos Herrera 0001, Felipe D. Sepúlveda, Hugo Ubilla |
Complexity indices for the multidimensional knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Central Eur. J. Oper. Res. ![In: Central Eur. J. Oper. Res. 29(2), pp. 589-609, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Ismail M. Ali, Daryl Essam, Kathryn Kasmarik |
Novel binary differential evolution algorithm for knapsack problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Sci. ![In: Inf. Sci. 542, pp. 177-194, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Artur Alves Pessoa, Michael Poss, Ruslan Sadykov, François Vanderbeck |
Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. ![In: Oper. Res. 69(3), pp. 739-754, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Kate Smith-Miles, Jeffrey Christiansen, Mario Andrés Muñoz |
Revisiting where are the hard knapsack problems? via Instance Space Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 128, pp. 105184, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Denise D. Tönissen, Loe Schlicher |
Using 3D-printing in disaster response: The two-stage stochastic 3D-printing knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 133, pp. 105356, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Paolo Detti |
A new upper bound for the multiple knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 129, pp. 105210, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Zequn Wei, Jin-Kao Hao |
A threshold search based memetic algorithm for the disjunctively constrained knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 136, pp. 105447, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Waldo Gálvez, Fabrizio Grandoni 0001, Salvatore Ingala, Sandy Heydrich, Arindam Khan 0001, Andreas Wiese |
Approximating Geometric Knapsack via L-packings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 17(4), pp. 33:1-33:67, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Zhenzhou Wang, Xinyuan Li, Pingping Yu, Ning Cao 0002, Russell Higgs |
Research on electric vehicle charging scheduling algorithms based on a 'fractional knapsack'. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Embed. Syst. ![In: Int. J. Embed. Syst. 14(1), pp. 36-44, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Khadoudja Ghanem, Abdesslem Layeb |
Feature Selection and Knapsack Problem Resolution Based on a Discrete Backtracking Optimization Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Appl. Evol. Comput. ![In: Int. J. Appl. Evol. Comput. 12(2), pp. 1-15, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Igor Deplano, Charly Lersteau, Trung Thanh Nguyen 0002 |
A mixed-integer linear model for the multiple heterogeneous knapsack problem with realistic container loading constraints and bins' priority. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. Trans. Oper. Res. ![In: Int. Trans. Oper. Res. 28(6), pp. 3244-3275, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Ulrich Pferschy, Joachim Schauer, Clemens Thielen |
Approximating the product knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 15(8), pp. 2529-2540, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Jean Paulo Martins, Bruno Cesar Ribas |
A randomized heuristic repair for the multidimensional knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 15(2), pp. 337-355, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Matthieu Parizy, Nozomu Togawa |
Analysis and Acceleration of the Quadratic Knapsack Problem on an Ising Machine. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Fundam. Electron. Commun. Comput. Sci. ![In: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 104-A(11), pp. 1526-1535, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Tianming Zhao 0002, Weisheng Si, Wei Li 0058, Albert Y. Zomaya |
Optimizing the Maximum Vertex Coverage Attacks Under Knapsack Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 29(3), pp. 1088-1104, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Yichao He, Xinlu Zhang, Wenbin Li, Jinghong Wang, Ning Li |
An efficient binary differential evolution algorithm for the multidimensional knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eng. Comput. ![In: Eng. Comput. 37(1), pp. 745-761, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Asaju La'aro Bolaji, Friday Zinzendoff Okwonu, Peter Bamidele Shola, Babatunde Sulaiman Balogun, Obinna Damian Adubisi |
A Modified Binary Pigeon-Inspired Algorithm for Solving the Multi-dimensional Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Intell. Syst. ![In: J. Intell. Syst. 30(1), pp. 90-103, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Susanne Albers, Arindam Khan 0001, Leon Ladewig |
Improved Online Algorithms for Knapsack and GAP in the Random Order Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(6), pp. 1750-1785, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Chien-Chung Huang, Naonori Kakimura |
Improved Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(3), pp. 879-902, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Thiago Alcântara Luiz, Haroldo Gambini Santos, Eduardo Uchoa |
Cover by disjoint cliques cuts for the knapsack problem with conflicting items. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 49(6), pp. 844-850, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Sahar Abdollahi, Arash Deldari, Hamid Asadi, Ahmadreza Montazerolghaem, Sayyed Majid Mazinani |
Flow-Aware Forwarding in SDN Datacenters Using a Knapsack-PSO-Based Solution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Netw. Serv. Manag. ![In: IEEE Trans. Netw. Serv. Manag. 18(3), pp. 2902-2914, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | David Yang Gao |
Canonical Duality Theory and Algorithm for Solving Bilevel Knapsack Problems With Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Syst. Man Cybern. Syst. ![In: IEEE Trans. Syst. Man Cybern. Syst. 51(2), pp. 893-904, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Mingwu Zhang, Yu Chen 0056, Zhe Xia, Jiangyi Du, Willy Susilo |
PPO-DFK: A Privacy-Preserving Optimization of Distributed Fractional Knapsack With Application in Secure Footballer Configurations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Syst. J. ![In: IEEE Syst. J. 15(1), pp. 759-770, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Yupeng Zhou, Mengyu Zhao, Mingjie Fan, Yiyuan Wang, Jianan Wang |
An efficient local search for large-scale set-union knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Data Technol. Appl. ![In: Data Technol. Appl. 55(2), pp. 233-250, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Elias Munapo, Santosh Kumar |
Reducing the complexity of the knapsack linear integer problem by reformulation techniques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Syst. Assur. Eng. Manag. ![In: Int. J. Syst. Assur. Eng. Manag. 12(6), pp. 1087-1093, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Zhongzheng Tang, Chenhao Wang 0001, Hau Chan |
On maximizing a monotone k-submodular function under a knapsack constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2105.15159, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Jakob Bossek, Aneta Neumann, Frank Neumann 0001 |
Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2104.13133, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Jeff Giliberti, Andreas Karrenbauer |
Improved Online Algorithm for Fractional Knapsack in the Random Order Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2109.04428, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Ariel Kulik, Roy Schwartz 0002, Hadas Shachnai |
A Faster Tight Approximation for Submodular Maximization Subject to a Knapsack Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2102.12879, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Mihai Oltean, Crina Grosan, Mihaela Oltean |
Evolving Digital Circuits for the Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2109.13107, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Yue Xie, Aneta Neumann, Frank Neumann 0001, Andrew M. Sutton |
Runtime Analysis of RLS and the (1+1) EA for the Chance-constrained Knapsack Problem with Correlated Uniform Weights. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2102.05778, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Jiashuo Jiang, Will Ma, Jiawei Zhang 0006 |
Tight Guarantees for Multi-unit Prophet Inequalities and Online Stochastic Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2107.02058, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Michael Beyer, Steven Mills |
Preemptive Two-stage Goal-Programming Formulation of a Strict Version of the Unbounded Knapsack Problem with Bounded Weights. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2109.13686, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Zequn Wei, Jin-Kao Hao |
A threshold search based memetic algorithm for the disjunctively constrained knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2101.04753, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Menglu Yu, Chuan Wu 0001, Bo Ji 0001, Jia Liu 0002 |
A Sum-of-Ratios Multi-Dimensional-Knapsack Decomposition for DNN Resource Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2105.13855, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Javier Albert, Dmitri Goldenberg |
E-Commerce Promotions Personalization via Online Multiple-Choice Knapsack with Uplift Modeling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2108.13298, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Sahar Abdollahi, Arash Deldari, Hamid Asadi, Ahmadreza Montazerolghaem, Sayyed Majid Mazinani |
Flow aware Forwarding in SDN Datacenters Using a Knapsack PSO Based Solution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2104.13001, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Oren Neumann, Claudius Gros |
Investment vs. reward in a competitive knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2101.10964, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Dmitry V. Gribanov |
An FPTAS for the Δ-modular multidimensional knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2103.07257, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Arindam Khan 0001, Eklavya Sharma, K. V. N. Sreenivas |
Approximation Algorithms for Generalized Multidimensional Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2102.05854, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Shaojie Tang 0001 |
Beyond Pointwise Submodularity: Non-Monotone Adaptive Submodular Maximization subject to a Knapsack Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2104.04853, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Adam Polak 0001, Lars Rohwedder, Karol Wegrzycki |
Knapsack and Subset Sum with Small Items. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2105.04035, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Yann Disser, Max Klimm, David Weckbecker |
Fractionally Subadditive Maximization under an Incremental Knapsack Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2106.14454, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Waldo Gálvez, Fabrizio Grandoni 0001, Arindam Khan 0001, Diego Ramírez-Romero, Andreas Wiese |
Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2103.10406, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Yaron Fairstein, Ariel Kulik, Joseph Naor, Danny Raz |
General Knapsack Problems in a Dynamic Setting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2105.00882, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Arindam Khan 0001, Arnab Maiti, Amatya Sharma, Andreas Wiese |
On Guillotine Separable Packings for the Two-dimensional Geometric Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2103.09735, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|