|
|
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 |
12 | Mobolaji Williams |
Large N limit of the knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2107.14080, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Jakob Bossek, Aneta Neumann, Frank Neumann 0001 |
Exact Counting and Sampling of Optima for the Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2106.07412, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Christoph Buchheim, Dorothee Henke, Jannik Irmai |
The stochastic bilevel continuous knapsack problem with uncertain follower's objective. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2108.12303, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Zuguang Gao, John R. Birge, Varun Gupta 0004 |
Approximation Schemes for Multiperiod Binary Knapsack Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2104.00034, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi 0001, Alberto Marchetti-Spaccamela, Rebecca Reiffenhäuser |
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2102.08327, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Sean A. Mochocki, Gary B. Lamont, Robert C. Leishman, Kyle Kauffman |
Multi-objective database queries in combined knapsack and set covering problem domains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Big Data ![In: J. Big Data 8(1), pp. 46, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Jiawei Yuan, Yifan Li |
Solving binary multi-objective knapsack problems with novel greedy strategy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Memetic Comput. ![In: Memetic Comput. 13(4), pp. 447-458, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Isma Dahmani, Meriem Ferroum, Mhand Hifi |
An iterative rounding strategy-based algorithm for the set-union knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 25(21), pp. 13617-13639, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Yichao He, Xiang Hao, Wenbin Li, Qinglei Zhai |
Binary team game algorithm based on modulo operation for knapsack problem with a single continuous variable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Soft Comput. ![In: Appl. Soft Comput. 103, pp. 107180, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | José García 0002, Carlos Maureira |
A KNN quantum cuckoo search algorithm applied to the multidimensional knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Soft Comput. ![In: Appl. Soft Comput. 102, pp. 107077, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Zequn Wei, Jin-Kao Hao |
Multistart solution-based tabu search for the Set-Union Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Soft Comput. ![In: Appl. Soft Comput. 105, pp. 107260, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Luca E. Schäfer, Tobias Dietz, Maria Barbati, José Rui Figueira, Salvatore Greco, Stefan Ruzika |
The binary knapsack problem with qualitative levels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 289(2), pp. 508-514, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Simona Mancini, Michele Ciavotta, Carlo Meloni |
The Multiple Multidimensional Knapsack with Family-Split Penalties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 289(3), pp. 987-998, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Ulrich Pferschy, Gaia Nicosia, Andrea Pacifici, Joachim Schauer |
On the Stackelberg knapsack game. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 291(1), pp. 18-31, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | François Clautiaux, Boris Detienne, G. Guillot |
An iterative dynamic programming approach for the temporal knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 293(2), pp. 442-456, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Laura Galli, Silvano Martello, Carlos Rey 0001, Paolo Toth |
Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 291(3), pp. 871-882, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Stefano Coniglio, Fabio Furini, Pablo San Segundo |
A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 289(2), pp. 435-455, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Man Ding, Congying Han, Tiande Guo |
High generalization performance structured self-attention model for knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Algorithms Appl. ![In: Discret. Math. Algorithms Appl. 13(6), pp. 2150076:1-2150076:18, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Qiang Xu |
0-1 Knapsack problem driven resource scheduling in caching-enabled network: A case study on sports video. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Internet Technol. Lett. ![In: Internet Technol. Lett. 4(5), 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Yichao He, Xizhao Wang |
Group theory-based optimization algorithm for solving knapsack problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Knowl. Based Syst. ![In: Knowl. Based Syst. 219, pp. 104445, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Francisco Castillo-Zunino, Pinar Keskinocak |
Bi-criteria multiple knapsack problem with grouped items. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Heuristics ![In: J. Heuristics 27(5), pp. 747-789, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Lin Wang, Ronghua Shi, Jian Dong |
A Hybridization of Dragonfly Algorithm Optimization and Angle Modulation Mechanism for 0-1 Knapsack Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Entropy ![In: Entropy 23(5), pp. 598, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Frumen Olivas, Iván Amaya, José Carlos Ortiz-Bayliss, Santiago E. Conant-Pablos, Hugo Terashima-Marín |
Enhancing Hyperheuristics for the Knapsack Problem through Fuzzy Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Intell. Neurosci. ![In: Comput. Intell. Neurosci. 2021, pp. 8834324:1-8834324:17, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Md. Zulfikar Alom, Bikash Chandra Singh, Zeyar Aung, Mohammad Abdul Azim |
Knapsack graph-based privacy checking for smart environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Secur. ![In: Comput. Secur. 105, pp. 102240, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Thekra Al Douri, Mhand Hifi, Vassilis Zissimopoulos |
An iterative algorithm for the Max-Min knapsack problem with multiple scenarios. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. ![In: Oper. Res. 21(2), pp. 1355-1392, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Mohamed Abdel-Basset, Reda Mohamed, Seyedali Mirjalili |
A Binary Equilibrium Optimization Algorithm for 0-1 Knapsack Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Ind. Eng. ![In: Comput. Ind. Eng. 151, pp. 106946, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Ali Amiri 0001, Reza Barkhi |
A Lagrangean based solution algorithm for the multiple knapsack problem with setups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Ind. Eng. ![In: Comput. Ind. Eng. 153, pp. 107089, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Mohamed Abdel-Basset, Reda Mohamed, Karam M. Sallam, Ripon K. Chakrabortty, Michael J. Ryan |
BSMA: A novel metaheuristic algorithm for multi-dimensional knapsack problems: Method and comprehensive analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Ind. Eng. ![In: Comput. Ind. Eng. 159, pp. 107469, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Mohamed Abdel-Basset, Reda Mohamed, Ripon Kumar Chakrabortty, Michael J. Ryan, Seyedali Mirjalili |
New binary marine predators optimization algorithms for 0-1 knapsack problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Ind. Eng. ![In: Comput. Ind. Eng. 151, pp. 106949, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Zewen Li, Yichao He, Ya Li, Xiaohu Guo |
A hybrid grey wolf optimizer for solving the product knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Mach. Learn. Cybern. ![In: Int. J. Mach. Learn. Cybern. 12(1), pp. 201-222, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Enrico Bartolini, Dominik Goeke, Michael Schneider 0004, Mengdie Ye |
The Robust Traveling Salesman Problem with Time Windows Under Knapsack-Constrained Travel Time Uncertainty. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Transp. Sci. ![In: Transp. Sci. 55(2), pp. 371-394, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Shaojie Tang 0001 |
Beyond Pointwise Submodularity: Non-monotone Adaptive Submodular Maximization Subject to Knapsack and k-System Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MCO ![In: Modelling, Computation and Optimization in Information Systems and Management Sciences - Proceedings of the 4th International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences - MCO 2021, Hanoi, Vietnam, 13-14 December 2021., pp. 16-27, 2021, Springer, 978-3-030-92665-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Sameh Al-Shihabi |
Optimizing a Binary Integer Program by Identifying Its Optimal Core Problem - A New Optimization Concept Applied to the Multidimensional Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MCO ![In: Modelling, Computation and Optimization in Information Systems and Management Sciences - Proceedings of the 4th International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences - MCO 2021, Hanoi, Vietnam, 13-14 December 2021., pp. 28-39, 2021, Springer, 978-3-030-92665-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu |
Multi-cover Inequalities for Totally-Ordered Multiple Knapsack Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization - 22nd International Conference, IPCO 2021, Atlanta, GA, USA, May 19-21, 2021, Proceedings, pp. 193-207, 2021, Springer, 978-3-030-73878-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Hanyu Gu, Alireza Etminaniesfahani, Amir Salehipour |
A Bayesian Optimisation Approach for Multidimensional Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OLA ![In: Optimization and Learning - 4th International Conference, OLA 2021, Catania, Italy, June 21-23, 2021, Proceedings, pp. 86-97, 2021, Springer, 978-3-030-85671-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Samah Boukhari, Isma Dahmani, Mhand Hifi |
Computational Power of a Hybrid Algorithm for Solving the Multiple Knapsack Problem with Setup. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAI (1) ![In: Intelligent Computing - Proceedings of the 2021 Computing Conference, Volume 1, SAI 2021, Virtual Event, 15-16 July, 2021., pp. 154-168, 2021, Springer, 978-3-030-80118-2. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Stefka Fidanova, Maria Ganzha, Olympia Roeva |
InterCriteria Analyzis of Hybrid Ant Colony Optimization Algorithm for Multiple Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FedCSIS ![In: Proceedings of the 16th Conference on Computer Science and Intelligence Systems, Online, September 2-5, 2021., pp. 173-180, 2021, 978-83-959183-6-0. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Bharat Agarwal, Mohammed Amine Togou, Marco Ruffini, Gabriel-Miro Muntean |
PIRS3A: A Low Complexity Multi-knapsack-based Approach for User Association and Resource Allocation in HetNets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICC Workshops ![In: IEEE International Conference on Communications Workshops, ICC Workshops 2021, Montreal, QC, Canada, June 14-23, 2021, pp. 1-6, 2021, IEEE, 978-1-7281-9441-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Yaron Fairstein, Ariel Kulik, Hadas Shachnai |
Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)., pp. 41:1-41:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-204-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Adam Polak 0001, Lars Rohwedder, Karol Wegrzycki |
Knapsack and Subset Sum with Small Items. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)., pp. 106:1-106:19, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-195-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Tianshuai Zhu, Kai Han 0003, Enpei Zhang, Benwei Wu |
A Dynamic Algorithm for Submodular Maximization with a Knapsack Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HPCC/DSS/SmartCity/DependSys ![In: 2021 IEEE 23rd Int Conf on High Performance Computing & Communications; 7th Int Conf on Data Science & Systems; 19th Int Conf on Smart City; 7th Int Conf on Dependability in Sensor, Cloud & Big Data Systems & Application (HPCC/DSS/SmartCity/DependSys), Haikou, Hainan, China, December 20-22, 2021, pp. 462-469, 2021, IEEE, 978-1-6654-9457-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI 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) |
SoCG ![In: 37th International Symposium on Computational Geometry, SoCG 2021, June 7-11, 2021, Buffalo, NY, USA (Virtual Conference)., pp. 48:1-48:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-184-9. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI 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) |
SoCG ![In: 37th International Symposium on Computational Geometry, SoCG 2021, June 7-11, 2021, Buffalo, NY, USA (Virtual Conference)., pp. 39:1-39:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-184-9. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Teddy Nurcahyadi, Christian Blum 0001 |
Negative Learning in Ant Colony Optimization: Application to the Multi Dimensional Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMSI ![In: ISMSI 2021: 2021 5th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence, Victoria, Seychelles, April 10-11, 2021, pp. 22-27, 2021, ACM, 978-1-4503-8967-9. 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) |
SIGMETRICS (Abstracts) ![In: SIGMETRICS '21: ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Virtual Event, China, June 14-18, 2021., pp. 65-66, 2021, ACM, 978-1-4503-8072-0. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Bo Sun 0004, Ali Zeynali, Tongxin Li, Mohammad Hassan Hajiesmaili, Adam Wierman, Danny H. K. Tsang |
Competitive Algorithms for the Online Multiple Knapsack Problem with Application to Electric Vehicle Charging. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMETRICS (Abstracts) ![In: SIGMETRICS '21: ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Virtual Event, China, June 14-18, 2021., pp. 67-68, 2021, ACM, 978-1-4503-8072-0. 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) |
SIGMETRICS (Abstracts) ![In: SIGMETRICS '21: ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Virtual Event, China, June 14-18, 2021., pp. 63-64, 2021, ACM, 978-1-4503-8072-0. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Akansha Singh, P. Meghana Reddy, Shweta Jain 0002, Sujit Gujar |
Designing Bounded Min-Knapsack Bandits Algorithm for Sustainable Demand Response. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PRICAI (1) ![In: PRICAI 2021: Trends in Artificial Intelligence - 18th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2021, Hanoi, Vietnam, November 8-12, 2021, Proceedings, Part I, pp. 3-17, 2021, Springer, 978-3-030-89187-9. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Jakob Bossek, Aneta Neumann, Frank Neumann 0001 |
Exact Counting and Sampling of Optima for the Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LION ![In: Learning and Intelligent Optimization - 15th International Conference, LION 15, Athens, Greece, June 20-25, 2021, Revised Selected Papers, pp. 40-54, 2021, Springer, 978-3-030-92120-0. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Dmitriy V. Gribanov |
An FPTAS for the Δ-Modular Multidimensional Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MOTOR ![In: Mathematical Optimization Theory and Operations Research - 20th International Conference, MOTOR 2021, Irkutsk, Russia, July 5-10, 2021, Proceedings, pp. 79-95, 2021, Springer, 978-3-030-77875-0. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Ali Zeynali, Bo Sun 0004, Mohammad Hassan Hajiesmaili, Adam Wierman |
Data-driven Competitive Algorithms for Online Knapsack and Set Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAAI ![In: Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, IAAI 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, EAAI 2021, Virtual Event, February 2-9, 2021, pp. 10833-10841, 2021, AAAI Press, 978-1-57735-866-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Christoph Hertrich, Martin Skutella |
Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAAI ![In: Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, IAAI 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, EAAI 2021, Virtual Event, February 2-9, 2021, pp. 7685-7693, 2021, AAAI Press, 978-1-57735-866-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Lin Wang, Ronghua Shi, Wenyu Li, Xia Yuan, Jian Dong |
An Improved Dragonfly Algorithm Based on Angle Modulation Mechanism for Solving 0-1 Knapsack Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICSI (1) ![In: Advances in Swarm Intelligence - 12th International Conference, ICSI 2021, Qingdao, China, July 17-21, 2021, Proceedings, Part I, pp. 83-93, 2021, Springer, 978-3-030-78742-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Zuguang Gao, John R. Birge, Varun Gupta 0004 |
Approximation Schemes for Multiperiod Binary Knapsack Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications - 16th International Computer Science Symposium in Russia, CSR 2021, Sochi, Russia, June 28 - July 2, 2021, Proceedings, pp. 131-146, 2021, Springer, 978-3-030-79415-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Chi-Yo Huang, Ying-Ting Kuo, Liang-Chieh Wang, Yi-Hao Hsiao, Chia-Lee Yang |
Technology Roadmapping for the GAA-FETs Based on the Methods of Patent Mining, Fuzzy Knapsack Problem, and Fuzzy Competence Set Expansion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
iFUZZY ![In: 2021 International Conference on Fuzzy Theory and Its Applications, iFUZZY 2021, Taitung, Taiwan, October 5-8, 2021, pp. 1-7, 2021, IEEE, 978-1-6654-3358-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI 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) |
GECCO ![In: GECCO '21: Genetic and Evolutionary Computation Conference, Lille, France, July 10-14, 2021., pp. 556-564, 2021, ACM, 978-1-4503-8350-9. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Xinhua Yang, Yufan Zhou, Ailing Shen, Juan Lin 0001, Yiwen Zhong |
A hybrid ant colony optimization algorithm for the knapsack problem with a single continuous variable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: GECCO '21: Genetic and Evolutionary Computation Conference, Lille, France, July 10-14, 2021., pp. 57-65, 2021, ACM, 978-1-4503-8350-9. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI 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) |
GECCO ![In: GECCO '21: Genetic and Evolutionary Computation Conference, Lille, France, July 10-14, 2021., pp. 1187-1194, 2021, ACM, 978-1-4503-8350-9. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Wim van Dam, Karim Eldefrawy, Nicholas Genise, Natalie Parham |
Quantum Optimization Heuristics with an Application to Knapsack Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
QCE ![In: IEEE International Conference on Quantum Computing and Engineering, QCE 2021, Broomfield, CO, USA, October 17-22, 2021, pp. 160-170, 2021, IEEE, 978-1-6654-1691-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI 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) |
INFOCOM ![In: 40th IEEE Conference on Computer Communications, INFOCOM 2021, Vancouver, BC, Canada, May 10-13, 2021, pp. 1-10, 2021, IEEE, 978-1-6654-0325-2. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Jingjing Tan, Yicheng Xu, Dongmei Zhang 0002, Xiaoqing Zhang |
Maximizing the Sum of a Supermodular Function and a Monotone DR-submodular Function Subject to a Knapsack Constraint on the Integer Lattice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSoNet ![In: Computational Data and Social Networks - 10th International Conference, CSoNet 2021, Virtual Event, November 15-17, 2021, Proceedings, pp. 68-75, 2021, Springer, 978-3-030-91433-2. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Wenrong Jiang |
Research on the Recommendation Algorithm Based on 0-1 Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONF-CDS ![In: CONF-CDS 2021: The 2nd International Conference on Computing and Data Science, Stanford, CA, USA, January 28-30, 2021, pp. 191:1-191:5, 2021, ACM, 978-1-4503-8957-0. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Hans-Joachim Böckenhauer, Elisabet Burjons, Juraj Hromkovic, Henri Lotze, Peter Rossmanith |
Online Simple Knapsack with Reservation Costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 16:1-16:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Pascal Bergsträßer, Moses Ganardi, Georg Zetzsche |
A Characterization of Wreath Products Where Knapsack Is Decidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 11:1-11:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Jeff Giliberti, Andreas Karrenbauer |
Improved Online Algorithm for Fractional Knapsack in the Random Order Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms - 19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6-10, 2021, Revised Selected Papers, pp. 188-205, 2021, Springer, 978-3-030-92701-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Yann Disser, Max Klimm, David Weckbecker |
Fractionally Subadditive Maximization Under an Incremental Knapsack Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms - 19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6-10, 2021, Revised Selected Papers, pp. 206-223, 2021, Springer, 978-3-030-92701-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Soh Kumabe, Takanori Maehara |
Prophet Secretary for k-Knapsack and l-Matroid Intersection via Continuous Exchange Property. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms - 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5-7, 2021, Proceedings, pp. 428-441, 2021, Springer, 978-3-030-79986-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Sungjin Im, Ravi Kumar 0001, Mahshid Montazer Qaem, Manish Purohit |
Online Knapsack with Frequency Predictions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NeurIPS ![In: Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6-14, 2021, virtual., pp. 2733-2743, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Jingjing Tan, Fengmin Wang, Xiaoqing Zhang, Yang Zhou 0018 |
Maximization of Monotone Non-submodular Functions with a Knapsack Constraint over the Integer Lattice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications - 15th International Conference, COCOA 2021, Tianjin, China, December 17-19, 2021, Proceedings, pp. 364-373, 2021, Springer, 978-3-030-92680-9. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Alaidine Ben Ayed, Ismaïl Biskri, Jean-Guy Meunier |
Arabic text summarization via Knapsack balancing of effective retention. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACLING ![In: Fifth International Conference On Arabic Computational Linguistics, ACLING 2021, June 4-5, 2021, Virtual Event, pp. 312-319, 2021, Elsevier. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Steffen Goebbels, Frank Gurski, Dominique Komander |
The Knapsack Problem with Special Neighbor Constraints on Directed Co-graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OR ![In: Operations Research Proceedings 2021, Selected Papers of the International Conference of the Swiss, German and Austrian Operations Research Societies (SVOR/ASRO, GOR e.V., ÖGOR), University of Bern, Switzerland, August 31 - September 3, 2021, pp. 95-100, 2021, Springer, 978-3-031-08623-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz |
General Knapsack Problems in a Dynamic Setting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 15:1-15:18, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Song He, Wei Li |
An Adaptive Search Algorithm with Scatter and Tabu Strategy for Multidimensional Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISICA ![In: Exploration of Novel Intelligent Optimization Algorithms - 12th International Symposium, ISICA 2021, Guangzhou, China, November 20-21, 2021, Revised Selected Papers, pp. 327-344, 2021, Springer, 978-981-19-4108-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Franziska Eberle, Nicole Megow, Lukas Nölke, Bertrand Simon 0001, Andreas Wiese |
Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, December 15-17, 2021, Virtual Conference., pp. 18:1-18:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-215-0. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Duanshun Li, Jing Liu 0024, Dongeun Lee 0001, Ali Seyedmazloom, Giridhar Kaushik, Kookjin Lee, Noseong Park |
A Novel Method to Solve Neural Knapsack Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: Proceedings of the 38th International Conference on Machine Learning, ICML 2021, 18-24 July 2021, Virtual Event., pp. 6414-6424, 2021, PMLR. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi 0001, Alberto Marchetti-Spaccamela, Rebecca Reiffenhäuser |
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: Proceedings of the 38th International Conference on Machine Learning, ICML 2021, 18-24 July 2021, Virtual Event., pp. 231-242, 2021, PMLR. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Bin Liu 0009, Zihan Chen, Hongmin W. Du |
Streaming Algorithms for Maximizing DR-Submodular Functions with d-Knapsack Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Aspects in Information and Management - 15th International Conference, AAIM 2021, Virtual Event, December 20-22, 2021, Proceedings, pp. 159-169, 2021, Springer, 978-3-030-93175-9. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Omid Sadeghi, Maryam Fazel |
Differentially Private Monotone Submodular Maximization Under Matroid and Knapsack Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AISTATS ![In: The 24th International Conference on Artificial Intelligence and Statistics, AISTATS 2021, April 13-15, 2021, Virtual Event., pp. 2908-2916, 2021, PMLR. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Deval Patel, Arindam Khan 0001, Anand Louis |
Group Fairness for Knapsack Problems. (PDF / PS) ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, Virtual Event, United Kingdom, May 3-7, 2021., pp. 1001-1009, 2021, ACM, 978-1-4503-8307-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Pallavi Jain 0001, Krzysztof Sornat, Nimrod Talmon |
Preserving Consistency for Liquid Knapsack Voting. (PDF / PS) ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, Virtual Event, United Kingdom, May 3-7, 2021., pp. 1542-1544, 2021, ACM, 978-1-4503-8307-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Yang Qiu, Haomiao Li, Xiao Wang, Omar Dib |
On the adoption of Metaheuristics for Solving 0-1 Knapsack Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAAP ![In: 12th International Symposium on Parallel Architectures, Algorithms and Programming, PAAP 2021, Xi'an, China, December 10-12, 2021, pp. 56-61, 2021, IEEE, 978-1-6654-9639-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Rémi Bricout |
Comment utiliser des algorithmes quantiques pour remplir son sac à dos et décoder des syndromes. (How to use quantum algorithms to solve the knapsack problem and the syndrome decoding problem). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2021 |
RDF |
|
12 | Bo Sun 0004, Ali Zeynali, Tongxin Li, Mohammad Hassan Hajiesmaili, Adam Wierman, Danny H. K. Tsang |
Competitive Algorithms for the Online Multiple Knapsack Problem with Application to Electric Vehicle Charging. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proc. ACM Meas. Anal. Comput. Syst. ![In: Proc. ACM Meas. Anal. Comput. Syst. 4(3), pp. 51:1-51:32, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Nicolás Acevedo, Carlos Rey 0001, Carlos Contreras Bolton, Víctor Parada |
Automatic design of specialized algorithms for the binary knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expert Syst. Appl. ![In: Expert Syst. Appl. 141, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Isaías I. Huerta, Daniel A. Neira, Daniel A. Ortega, Vicente Varas, Julio Godoy, Roberto Javier Asín Achá |
Anytime automatic algorithm selection for knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expert Syst. Appl. ![In: Expert Syst. Appl. 158, pp. 113613, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Isma Dahmani, Mhand Hifi, Toufik Saadi, Labib Yousef |
A swarm optimization-based search algorithm for the quadratic knapsack problem with conflict Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expert Syst. Appl. ![In: Expert Syst. Appl. 148, pp. 113224, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Ali Amiri 0001 |
A Lagrangean based solution algorithm for the knapsack problem with setups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expert Syst. Appl. ![In: Expert Syst. Appl. 143, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Xiangjing Lai, Jin-Kao Hao, Zhang-Hua Fu, Dong Yue 0001 |
Diversity-preserving quantum particle swarm optimization for the multidimensional knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expert Syst. Appl. ![In: Expert Syst. Appl. 149, pp. 113310, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Christopher Hojny, Tristan Gally, Oliver Habeck, Hendrik Lüthen, Frederic Matter, Marc E. Pfetsch, Andreas Schmitt |
Knapsack polytopes: a survey. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 292(1), pp. 469-517, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Renata Mansini, Roberto Zanotti |
A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFORMS J. Comput. ![In: INFORMS J. Comput. 32(4), pp. 1061-1079, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Georgios Amanatidis, Georgios Birmpas, Evangelos Markakis |
A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 163, pp. 106010, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Ahmet Bacak, Ali Köksal Hocaoglu |
A novel resampling algorithm based on the knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Signal Process. ![In: Signal Process. 170, pp. 107436, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Husheng Wu, Jun-jie Xue, Renbin Xiao, Jinqiang Hu |
Uncertain bilevel knapsack problem based on an improved binary wolf pack algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Frontiers Inf. Technol. Electron. Eng. ![In: Frontiers Inf. Technol. Electron. Eng. 21(9), pp. 1356-1368, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Abir Chaabani, Lamjed Ben Said |
A co-evolutionary decomposition-based algorithm for the bi-level knapsack optimisation problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Intell. Stud. ![In: Int. J. Comput. Intell. Stud. 9(1/2), pp. 52-67, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Zhengtian Wu, Baoping Jiang, Hamid Reza Karimi |
A logarithmic descent direction algorithm for the quadratic knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Comput. ![In: Appl. Math. Comput. 369, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Robinson S. V. Hoto, Luiz Carlos Matioli, Paulo Sérgio Marques dos Santos |
A penalty algorithm for solving convex separable knapsack problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Comput. ![In: Appl. Math. Comput. 387, pp. 124855, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Yanjun Jiang, Yishui Wang, Dachuan Xu, Ruiqi Yang, Yong Zhang 0001 |
Streaming algorithm for maximizing a monotone non-submodular function under d-knapsack constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 14(5), pp. 1235-1248, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Seulgi Joung, Kyungsik Lee |
Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 14(1), pp. 101-113, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Wenjun Hou, Marek A. Perkowski |
Quantum-based algorithm and circuit design for bounded Knapsack optimization problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Quantum Inf. Comput. ![In: Quantum Inf. Comput. 20(9&10), pp. 766-786, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Chien-Chung Huang, Naonori Kakimura, Yuichi Yoshida |
Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 82(4), pp. 1006-1032, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
|
|