|
|
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 | Jéssica Gabriela de Almeida Cunha, Vinícius Loti de Lima, Thiago Alves de Queiroz |
Grids for cutting and packing problems: a study in the 2D knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
4OR ![In: 4OR 18(3), pp. 293-339, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Dennis Fischer 0001, Gerhard J. Woeginger |
A faster algorithm for the continuous bilevel knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 48(6), pp. 784-786, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Christopher Hojny |
Polynomial size IP formulations of knapsack may require exponentially large coefficients. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 48(5), pp. 612-618, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Dylan Gaspar, Yun Lu 0003, Myung Soon Song, Francis J. Vasko |
Simple population-based metaheuristics for the multiple demand multiple-choice multidimensional knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Metaheuristics ![In: Int. J. Metaheuristics 7(4), pp. 330-351, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Reza Refaei Afshar, Yingqian Zhang 0001, Murat Firat, Uzay Kaymak |
A State Aggregation Approach for Solving Knapsack Problem with Deep Reinforcement Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2004.12117, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Yonathan Aflalo, Asaf Noy, Ming Lin, Itamar Friedman, Lihi Zelnik-Manor |
Knapsack Pruning with Inner Distillation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2002.08258, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP 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) |
CoRR ![In: CoRR abs/2010.00412, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Ivars Dzalbs, Tatiana Kalganova, Ian Dear |
Imperialist Competitive Algorithm with Independence and Constrained Assimilation for Solving 0-1 Multidimensional Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2003.06617, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Michael Figelius, Moses Ganardi, Markus Lohrey, Georg Zetzsche |
The complexity of knapsack problems in wreath products. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2002.08086, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Kianté Brantley, Miroslav Dudík, Thodoris Lykouris, Sobhan Miryoosefi, Max Simchowitz, Aleksandrs Slivkins, Wen Sun |
Constrained episodic reinforcement learning in concave-convex and knapsack settings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2006.05051, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP 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) |
CoRR ![In: CoRR abs/2012.05361, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Xingwen Zhang, Feng Qi 0005, Zhigang Hua, Shuang Yang |
Solving Billion-Scale Knapsack Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2002.00352, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Ali Aouad, Danny Segev |
An Approximate Dynamic Programming Approach to The Incremental Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2010.07633, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Dmitry V. Gribanov |
Properties of Δ-modular simplicies and "close" polyhedrons. O(Δ · polylog(Δ))-algorithm for knapsack, proximity and sparsity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2002.01307, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi 0001, Rebecca Reiffenhäuser |
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2007.05014, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP 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) |
CoRR ![In: CoRR abs/2012.00497, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Arturo I. Merino, Andreas Wiese |
On the Two-Dimensional Knapsack Problem for Convex Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2007.16144, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Luca E. Schäfer, Tobias Dietz, Maria Barbati, José Rui Figueira, Salvatore Greco, Stefan Ruzika |
The {0, 1}-knapsack problem with qualitative levels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2002.04850, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Yaron Fairstein, Ariel Kulik, Hadas Shachnai |
tight approximations for modular and submodular optimization with d-resource multiple knapsack constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2007.10470, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | András Hajdu, György Terdik, Attila Tiba, Henrietta Tomán |
A stochastic approach to handle knapsack problems in the creation of ensembles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2004.08101, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Deval Patel, Arindam Khan 0001, Anand Louis |
Group Fairness for Knapsack Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2006.07832, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Ashish Goel, Anilesh K. Krishnaswamy, Sukolsak Sakshuwong, Tanja Aitamurto |
Knapsack Voting for Participatory Budgeting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2009.06856, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Thomas Kesselheim, Marco Molinaro 0001 |
Knapsack Secretary with Bursty Adversary. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2006.11607, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Waleed Bin Owais, Iyad W. J. Alkhazendar, Mohammad Saleh |
Evaluating the impact of different types of crossover and selection methods on the convergence of 0/1 Knapsack using Genetic Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2010.03483, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Francisco Castillo-Zunino, Pinar Keskinocak |
Bi-Criteria Multiple Knapsack Problem with Grouped Items. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2006.00322, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP 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) |
CoRR ![In: CoRR abs/2008.05391, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Hans-Joachim Böckenhauer, Jan Dreier, Fabian Frei, Peter Rossmanith |
Advice for Online Knapsack With Removable Items. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2005.01867, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP 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) |
CoRR ![In: CoRR abs/2009.14043, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Ying Cao 0007, Bo Sun 0004, Danny H. K. Tsang |
Optimal Online Algorithms for One-Way Trading and Online Knapsack Problems: A Unified Competitive Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2004.10358, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Xiaoming Sun 0001, Jialin Zhang 0001, Zhijie Zhang |
Tight Algorithms for the Submodular Multiple Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2003.11450, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Lauren Pusey-Nazzaro, Prasanna Date |
Adiabatic Quantum Optimization Fails to Solve the Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2008.07456, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Martin Böhm 0001, Franziska Eberle, Nicole Megow, Lukas Nölke, Jens Schlöter, Bertrand Simon 0001, Andreas Wiese |
Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2007.08415, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Hirad Assimi, Oscar Harper, Yue Xie, Aneta Neumann, Frank Neumann 0001 |
Evolutionary Bi-objective Optimization for the Dynamic Chance-Constrained Knapsack Problem Based on Tail Bound Objectives. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2002.06766, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Yue Xie, Aneta Neumann, Frank Neumann 0001 |
Specific Single- and Multi-Objective Evolutionary Algorithms for the Chance-Constrained Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2004.03205, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Yuri Faenza, Danny Segev, Lingyi Zhang |
Approximation Algorithms for The Generalized Incremental Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2009.07248, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP 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) |
CoRR ![In: CoRR abs/2005.14105, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Vahid Roostapour, Aneta Neumann, Frank Neumann 0001 |
Evolutionary Multi-Objective Optimization for the Dynamic Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2004.12574, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Xiaotian Hao, Zhaoqing Peng, Yi Ma, Guan Wang, Junqi Jin, Jianye Hao, Shan Chen, Rongquan Bai, Mingzhou Xie, Miao Xu, Zhenzhe Zheng, Chuan Yu, Han Li, Jian Xu 0015, Kun Gai |
Dynamic Knapsack Optimization Towards Efficient Multi-Channel Sequential Advertising. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2006.16312, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Yaron Fairstein, Ariel Kulik, Joseph Naor, Danny Raz, Hadas Shachnai |
A (1-e-1-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2004.12224, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Fernando A. Morales, Jairo A. Martínez |
Expected Performance and Worst Case Scenario Analysis of the Divide-and-Conquer Method for the 0-1 Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2008.04124, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP 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) |
CoRR ![In: CoRR abs/2004.08574, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Marcin Bienkowski, Maciej Pacut, Krzysztof Piecuch |
An Optimal Algorithm for Online Multiple Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2002.04543, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Shi-hua Zhan, Lijin Wang, Ze-Jun Zhang, Yiwen Zhong |
Noising methods with hybrid greedy repair operator for 0-1 knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Memetic Comput. ![In: Memetic Comput. 12(1), pp. 37-50, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Congcong Wu, Yichao He |
Solving the set-union knapsack problem by a novel hybrid Jaya algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 24(3), pp. 1883-1902, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Huihong Wu, Shuqu Qian, Yanmin Liu, Dong Wang, Benhua Guo |
An immune-based response particle swarm optimizer for knapsack problems in dynamic environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 24(20), pp. 15409-15425, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Layane Rodrigues de Souza Queiroz, Marina Andretta |
Two effective methods for the irregular knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Soft Comput. ![In: Appl. Soft Comput. 95, pp. 106485, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Peter Goos, U. Syafitri, Bagus Sartono, Alan R. Vazquez |
A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 281(1), pp. 201-221, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Thomas Setzer, Sebastian M. Blanc |
Empirical orthogonal constraint generation for Multidimensional 0/1 Knapsack Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 282(1), pp. 58-70, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Marcia Helena Costa Fampa, D. Lubke, Fei Wang 0043, Henry Wolkowicz |
Parametric convex quadratic relaxation of the quadratic knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 281(1), pp. 36-49, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Thomas Setzer, Sebastian M. Blanc |
Corrigendum to "Empirical Orthogonal Constraint Generation for Multidimensional 0/1 Knapsack Problems". ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 286(2), pp. 791-795, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Federico Della Croce, Rosario Scatamacchia |
An exact approach for the bilevel knapsack problem with interdiction constraints and extensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 183(1), pp. 249-281, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Iskander Aliev, Martin Henk, Timm Oertel |
Distances to lattice points in knapsack polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 182(1), pp. 175-198, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Ya Li, Yichao He, Xuejing Liu, Xiaohu Guo, Zewen Li |
A novel discrete whale optimization algorithm for solving knapsack problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Intell. ![In: Appl. Intell. 50(10), pp. 3350-3366, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Congcong Wu, Jianli Zhao, Yanhong Feng, Malrey Lee |
"Solving discounted {0-1} knapsack problems by a discrete hybrid teaching-learning-based optimization algorithm". ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Intell. ![In: Appl. Intell. 50(6), pp. 1872-1888, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Chiranjit Changdar, Rajat Kumar Pal, Ghanshaym Singha Mahapatra, Abhinandan Khan |
A genetic algorithm based approach to solve multi-resource multi-objective knapsack problem for vegetable wholesalers in fuzzy environment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. ![In: Oper. Res. 20(3), pp. 1321-1352, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | José García 0002, Eduardo Lalla-Ruiz, Stefan Voß 0001, Enrique López Droguett |
Enhancing a machine learning binarization framework by perturbation operators: analysis on the multidimensional knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Mach. Learn. Cybern. ![In: Int. J. Mach. Learn. Cybern. 11(9), pp. 1951-1970, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Fernando A. Morales, Jairo A. Martínez |
Analysis of Divide-and-Conquer strategies for the 0-1 minimization knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 40(1), pp. 234-278, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Jakub Lojda, Jakub Podivinsky, Ondrej Cekan, Richard Panek, Martin Krcma, Zdenek Kotásek |
Automatic Design of Reliable Systems Based on the Multiple-choice Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DDECS ![In: 23rd International Symposium on Design and Diagnostics of Electronic Circuits & Systems, DDECS 2020, Novi Sad, Serbia, April 22-24, 2020, pp. 1-4, 2020, IEEE, 978-1-7281-9938-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Yuri da Silva Villas Boas, Daniel Santana Rocha, Charles F. de Barros, Jean Everson Martina |
F2MH Cryptosystem: Preliminary analysis of an original attempt to revive Knapsack-based public-key encryption schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDP ![In: 28th Euromicro International Conference on Parallel, Distributed and Network-Based Processing, PDP 2020, Västerås, Sweden, March 11-13, 2020, pp. 211-215, 2020, IEEE, 978-1-7281-6582-0. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Gerhard Hasslinger, Konstantinos Ntougias, Frank Hasslinger, Oliver Hohlfeld |
General Knapsack Bounds of Web Caching Performance Regarding the Properties of each Cacheable Object. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networking ![In: 2020 IFIP Networking Conference, Networking 2020, Paris, France, June 22-26, 2020, pp. 821-826, 2020, IEEE, 978-3-903176-28-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Yan Wang, Min Wang, Jia Li, Xiang Xu |
Comparison of genetic algorithm and dynamic programming solving knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACAI ![In: ACAI 2020: 3rd International Conference on Algorithms, Computing and Artificial Intelligence, Sanya, China, December, 2020, pp. 10:1-10:5, 2020, ACM, 978-1-4503-8811-5. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Xingwen Zhang, Feng Qi 0005, Zhigang Hua, Shuang Yang |
Solving Billion-Scale Knapsack Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WWW ![In: WWW '20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 2020, pp. 3105-3111, 2020, ACM / IW3C2, 978-1-4503-7023-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Saúl Zapotecas Martínez, Adriana Menchaca-Méndez |
On the Performance of Generational and Steady-State MOEA/D in the Multi-Objective 0/1 Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CEC ![In: IEEE Congress on Evolutionary Computation, CEC 2020, Glasgow, United Kingdom, July 19-24, 2020, pp. 1-8, 2020, IEEE, 978-1-7281-6929-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Xavier Sánchez 0001, José Carlos Ortiz-Bayliss, Iván Amaya, Jorge M. Cruz-Duarte, Santiago Enrique Conant-Pablos, Hugo Terashima-Marín |
A Preliminary Study on Feature-independent Hyper-heuristics for the 0/1 Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CEC ![In: IEEE Congress on Evolutionary Computation, CEC 2020, Glasgow, United Kingdom, July 19-24, 2020, pp. 1-8, 2020, IEEE, 978-1-7281-6929-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Arij Mkaouar, Skander Htiouech, Habib Chabchoub |
Solving the Multiple choice Multidimensional Knapsack problem with ABC algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CEC ![In: IEEE Congress on Evolutionary Computation, CEC 2020, Glasgow, United Kingdom, July 19-24, 2020, pp. 1-6, 2020, IEEE, 978-1-7281-6929-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Jianping Dong, Haina Rong, Ferrante Neri, Qiang Yang, Ming Zhu, Gexiang Zhang |
An Adaptive Memetic P System to Solve the 0/1 Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CEC ![In: IEEE Congress on Evolutionary Computation, CEC 2020, Glasgow, United Kingdom, July 19-24, 2020, pp. 1-8, 2020, IEEE, 978-1-7281-6929-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Frumen Olivas, Iván Amaya, José Carlos Ortiz-Bayliss, Santiago E. Conant-Pablos, Hugo Terashima-Marín |
A Fuzzy Hyper-Heuristic Approach for the 0-1 Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CEC ![In: IEEE Congress on Evolutionary Computation, CEC 2020, Glasgow, United Kingdom, July 19-24, 2020, pp. 1-8, 2020, IEEE, 978-1-7281-6929-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Theofilos Triommatis, Aris Pagourtzis |
Approximate #Knapsack Computations to Count Semi-fair Allocations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 16th International Conference, TAMC 2020, Changsha, China, October 18-20, 2020, Proceedings., pp. 239-250, 2020, Springer, 978-3-030-59266-0. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Kanaho Hanji, Hiroshi Fujiwara, Hiroaki Yamamoto |
Online Removable Knapsack Problems for Integer-Sized Items. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 16th International Conference, TAMC 2020, Changsha, China, October 18-20, 2020, Proceedings., pp. 82-93, 2020, Springer, 978-3-030-59266-0. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz, Hadas Shachnai |
A (1-e-1-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 44:1-44:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Arturo I. Merino, Andreas Wiese |
On the Two-Dimensional Knapsack Problem for Convex Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 84:1-84:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Thomas Kesselheim, Marco Molinaro 0001 |
Knapsack Secretary with Bursty Adversary. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 72:1-72:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Michael Figelius, Moses Ganardi, Markus Lohrey, Georg Zetzsche |
The Complexity of Knapsack Problems in Wreath Products. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 126:1-126:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Marcin Bienkowski, Maciej Pacut, Krzysztof Piecuch |
An Optimal Algorithm for Online Multiple Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 13:1-13:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Reza Refaei Afshar, Yingqian Zhang 0001, Murat Firat, Uzay Kaymak |
A State Aggregation Approach for Solving Knapsack Problem with Deep Reinforcement Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACML ![In: Proceedings of The 12th Asian Conference on Machine Learning, ACML 2020, 18-20 November 2020, Bangkok, Thailand., pp. 81-96, 2020, PMLR. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Ying Cao 0007, Bo Sun 0004, Danny H. K. Tsang |
Optimal Online Algorithms for One-Way Trading and Online Knapsack Problems: A Unified Competitive Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CDC ![In: 59th IEEE Conference on Decision and Control, CDC 2020, Jeju Island, South Korea, December 14-18, 2020, pp. 1064-1069, 2020, IEEE, 978-1-7281-7447-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Jingyi Sun, Aijing Li, Lei Zhang, Zhen Qin, Zichao Qin |
A MAB-Based Knapsack Algorithm for Coexistence of LTE/WiFi in Resource Allocation Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCT ![In: 20th IEEE International Conference on Communication Technology, ICCT 2020, Nanning, China, October 28-31, 2020, pp. 421-424, 2020, IEEE, 978-1-7281-8141-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Markus Lohrey, Georg Zetzsche |
Knapsack and the Power Word Problem in Solvable Baumslag-Solitar Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic., pp. 67:1-67:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-159-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Thiago Fialho de Queiroz Lafetá, Gina Maira Barbosa de Oliveira |
Applying Dynamic Evolutionary Optimization to the Multiobjective Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BRACIS ![In: Intelligent Systems - 9th Brazilian Conference, BRACIS 2020, Rio Grande, Brazil, October 20-23, 2020, Proceedings, Part I, pp. 49-63, 2020, Springer, 978-3-030-61376-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Raffaele Cerulli, Ciriaco D'Ambrosio, Andrea Raiconi, Gaetano Vitale |
The Knapsack Problem with Forfeits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCO ![In: Combinatorial Optimization - 6th International Symposium, ISCO 2020, Montreal, QC, Canada, May 4-6, 2020, Revised Selected Papers, pp. 263-272, 2020, Springer, 978-3-030-53261-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Nitin Yadav, Carsten Murawski, Sebastian Sardiña, Peter Bossaerts |
Is Hardness Inherent in Computational Problems? Performance of Human and Electronic Computers on Random Instances of the 0-1 Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECAI ![In: ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020 - Including 10th Conference on Prestigious Applications of Artificial Intelligence (PAIS 2020), pp. 498-505, 2020, IOS Press, 978-1-64368-100-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Nawal Benabbou, Cassandre Leroy, Thibaut Lust |
Regret-Based Elicitation for Solving Multi-Objective Knapsack Problems with Rank-Dependent Aggregators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECAI ![In: ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020 - Including 10th Conference on Prestigious Applications of Artificial Intelligence (PAIS 2020), pp. 419-426, 2020, IOS Press, 978-1-64368-100-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Hirad Assimi, Oscar Harper, Yue Xie, Aneta Neumann, Frank Neumann 0001 |
Evolutionary Bi-Objective Optimization for the Dynamic Chance-Constrained Knapsack Problem Based on Tail Bound Objectives. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECAI ![In: ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020 - Including 10th Conference on Prestigious Applications of Artificial Intelligence (PAIS 2020), pp. 307-314, 2020, IOS Press, 978-1-64368-100-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Jocelyn Poncelet, Pierre-Antoine Jean, Michel Vasquez, Jacky Montmain |
Hierarchical Reasoning and Knapsack Problem Modelling to Design the Ideal Assortment in Retail. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPMU (1) ![In: Information Processing and Management of Uncertainty in Knowledge-Based Systems - 18th International Conference, IPMU 2020, Lisbon, Portugal, June 15-19, 2020, Proceedings, Part I, pp. 201-214, 2020, Springer, 978-3-030-50145-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Yue Xie, Aneta Neumann, Frank Neumann 0001 |
Specific single- and multi-objective evolutionary algorithms for the chance-constrained knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: GECCO '20: Genetic and Evolutionary Computation Conference, Cancún Mexico, July 8-12, 2020, pp. 271-279, 2020, ACM, 978-1-4503-7128-5. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Suriya Phongmoo, Komgrit Leksakul, Pongsawat Premphet |
Artificial Bee Colony for Solving Multi-Objectives Three-Dimensional Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICGDA ![In: ICGDA 2020: 3rd International Conference on Geoinformatics and Data Analysis, Marseille, France, April 15-17, 2020, pp. 137-139, 2020, ACM, 978-1-4503-7741-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Yuri da Silva Villas Boas, Daniel Santana Rocha, Charles F. de Barros, Jean Everson Martina |
SRVB cryptosystem: another attempt to revive Knapsack-based public-key encryption schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICT ![In: 27th International Conference on Telecommunications, ICT 2020, Bali, Indonesia, October 5-7, 2020, pp. 1-6, 2020, IEEE, 978-1-7281-6587-5. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Wenxin Li 0004, Joohyun Lee, Ness B. Shroff |
A Faster FPTAS for Knapsack Problem with Cardinality Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms - 18th International Workshop, WAOA 2020, Virtual Event, September 9-10, 2020, Revised Selected Papers, pp. 16-29, 2020, Springer, 978-3-030-80878-5. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Mhand Hifi, Amir Mohamed-Youssouf, Toufik Saadi, Labib Yousef |
A Cooperative Swarm Optimization-Based Algorithm for the Quadratic Multiple Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoDIT ![In: 7th International Conference on Control, Decision and Information Technologies, CoDIT 2020, Prague, Czech Republic, June 29 - July 2, 2020, pp. 1168-1173, 2020, IEEE, 978-1-7281-5953-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Isma Dahmani, Meriem Ferroum, Mhand Hifi, Shohre Sadeghsa |
A Hybrid Swarm Optimization-Based Algorithm for the Set-Union Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoDIT ![In: 7th International Conference on Control, Decision and Information Technologies, CoDIT 2020, Prague, Czech Republic, June 29 - July 2, 2020, pp. 1162-1167, 2020, IEEE, 978-1-7281-5953-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Yoshikata Nakano, Akihiro Fujiwara |
An asynchronous P system with branch and bound for solving the knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CANDAR (Workshops) ![In: Eighth International Symposium on Computing and Networking Workshops, CANDAR 2020 Workshops, Naha, Japan, November 24-27, 2020, pp. 230-236, 2020, IEEE, 978-1-7281-9919-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Camilo Vásquez, José Lemus-Romani, Broderick Crawford, Ricardo Soto 0001, Gino Astorga, Wenceslao Palma, Sanjay Misra, Fernando Paredes |
Solving the 0/1 Knapsack Problem Using a Galactic Swarm Optimization with Data-Driven Binarization Approaches. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (6) ![In: Computational Science and Its Applications - ICCSA 2020 - 20th International Conference, Cagliari, Italy, July 1-4, 2020, Proceedings, Part VI, pp. 511-526, 2020, Springer, 978-3-030-58816-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Marek Galinski, Juraj Volko, Ivan Kotuliak |
Enhanced approach on solving Online Knapsack Problem to improve Load Balancing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TSP ![In: 43rd International Conference on Telecommunications and Signal Processing, TSP 2020, Milan, Italy, July 7-9, 2020, pp. 613-616, 2020, IEEE, 978-1-7281-6376-5. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi 0001, Rebecca Reiffenhäuser |
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NeurIPS ![In: Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, December 6-12, 2020, virtual., 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Kianté Brantley, Miroslav Dudík, Thodoris Lykouris, Sobhan Miryoosefi, Max Simchowitz, Aleksandrs Slivkins, Wen Sun |
Constrained episodic reinforcement learning in concave-convex and knapsack settings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NeurIPS ![In: Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, December 6-12, 2020, virtual., 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Lorena Jorquera, Gabriel Villavicencio, Leonardo Causa, Luis Lopez, Andrés Fernández |
A Binary Bat Algorithm Applied to Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSOC (2) ![In: Artificial Intelligence and Bioinspired Computational Methods - Proceedings of the 9th Computer Science On-line Conference 2020, Vol. 2, pp. 172-182, 2020, Springer, 978-3-030-51970-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Hernan Pinto, Alvaro Peña, Leonardo Causa, Matías Valenzuela, Gabriel Villavicencio |
A K-means Grasshopper Algorithm Applied to the Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSOC (2) ![In: Artificial Intelligence and Bioinspired Computational Methods - Proceedings of the 9th Computer Science On-line Conference 2020, Vol. 2, pp. 234-244, 2020, Springer, 978-3-030-51970-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Vani Suthamathi Saravanarajan, Rung-Ching Chen, Christine Dewi, Long-Sheng Chen |
Montecarlo Approach For Solving Unbound Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MISNC/IEMT ![In: MISNC 2020 & IEMT 2020: The 7th Multidisciplinary in International Social Networks Conference and The 3rd International Conference on Economics, Management and Technology, Kaohsiung, Taiwan, October, 2020, pp. 4:1-4:5, 2020, ACM, 978-1-4503-8945-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Tarequl Islam Sifat, Nirmal Prajapati, Sanjay V. Rajopadhye |
Revisiting Sparse Dynamic Programming for the 0/1 Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: ICPP 2020: 49th International Conference on Parallel Processing, Edmonton, AB, Canada, August 17-20, 2020, pp. 46:1-46:10, 2020, ACM, 978-1-4503-8816-0. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Usman Ali, Usman Qamar, Kanwal Wahab, Khawaja Sarmad Arif |
A Knapsack Problem Based Algorithm for Local Level Management in Smart Grid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EIDWT ![In: Advances in Internet, Data and Web Technologies, The 8th International Conference on Emerging Internet, Data and Web Technologies, EIDWT 2020, Kitakyushu, Japan. 24-26 February 2020., pp. 301-310, 2020, Springer, 978-3-030-39745-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
|
|