Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
12 | Mathieu Mari, Timothé Picavet, Michal Pilipczuk |
A Parameterized Approximation Scheme for the Geometric Knapsack Problem with Wide Items. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPEC ![In: 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, September 6-8, 2023, Amsterdam, The Netherlands, pp. 33:1-33:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-305-8. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Wael Korani |
Binary Mother Tree Optimization Algorithm for 0/1 Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICONIP (1) ![In: Neural Information Processing - 30th International Conference, ICONIP 2023, Changsha, China, November 20-23, 2023, Proceedings, Part I, pp. 201-213, 2023, Springer, 978-981-99-8078-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Samiran Acharyya, Chiranjit Changdar, Utpal Nandi |
A special 0-1 Knapsack problem for a small vegetable retailing system under fuzziness: a swarm optimization based approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Neural Comput. Appl. ![In: Neural Comput. Appl. 34(11), pp. 9175-9190, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Méziane Aïder, Oussama Gacem, Mhand Hifi |
A hybrid population-based algorithm for the bi-objective quadratic multiple knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expert Syst. Appl. ![In: Expert Syst. Appl. 191, pp. 116238, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Dung K. Ha 0001, Canh V. Pham, Huan X. Hoang |
Submodular Maximization Subject to a Knapsack Constraint Under Noise Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asia Pac. J. Oper. Res. ![In: Asia Pac. J. Oper. Res. 39(6), pp. 2250013:1-2250013:26, December 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | R. Pablo Arribillaga, Gustavo Bergantiños |
Cooperative and axiomatic approaches to the knapsack allocation problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 318(2), pp. 805-830, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Mujahid Hussain, Zhao Wang, Guanmin Huang, You Mo, Yuling Guo, Rehana Kaousar, Liusheng Duan, Weiming Tan |
Evaluation of droplet deposition and efficiency of 28-homobrassinolide sprayed with unmanned aerial spraying system and electric air-pressure knapsack sprayer over wheat field. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Electron. Agric. ![In: Comput. Electron. Agric. 202, pp. 107353, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | David G. Harris 0001, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh |
Dependent randomized rounding for clustering and partition systems with knapsack constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Mach. Learn. Res. ![In: J. Mach. Learn. Res. 23, pp. 81:1-81:41, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
12 | Endric Daues, Ulf Friedrich |
Computing Optimized Path Integrals for Knapsack Feasibility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFORMS J. Comput. ![In: INFORMS J. Comput. 34(4), pp. 2163-2176, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | G. Shruthi, Monica R. Mundada, S. Supreeth |
Resource Allocation Using Weighted Greedy Knapsack Based Algorithm in an Educational Fog Computing Environment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Emerg. Technol. Learn. ![In: Int. J. Emerg. Technol. Learn. 17(18), pp. 261-274, September 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Beytullah Yildiz |
Reinforcement learning using fully connected, attention, and transformer models in knapsack problem solving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Concurr. Comput. Pract. Exp. ![In: Concurr. Comput. Pract. Exp. 34(9), 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Henrique Becker, Olinto C. B. de Araújo, Luciana S. Buriol |
Enhanced formulation for the Guillotine 2D Cutting Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. Comput. ![In: Math. Program. Comput. 14(4), pp. 673-697, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Guodong Lyu, Mabel C. Chou, Chung-Piaw Teo, Zhichao Zheng 0001, Yuanguang Zhong |
Stochastic Knapsack Revisited: The Service Level Perspective. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. ![In: Oper. Res. 70(2), pp. 729-747, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Michele Monaci, Ciara Pike-Burke, Alberto Santini |
Exact algorithms for the 0-1 Time-Bomb Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 145, pp. 105848, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | En-Ming Huang, Jerry Chou 0001 |
Optimization of multi-class 0/1 knapsack problem on GPUs by improving memory access efficiency. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 78(11), pp. 13653-13679, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Mohamed Abdel-Basset, Reda Mohamed, Osama M. Elkomy |
Knapsack Cipher-based metaheuristic optimization algorithms for cryptanalysis in blockchain-enabled internet of things systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ad Hoc Networks ![In: Ad Hoc Networks 128, pp. 102798, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Chiranjit Changdar, Pravash Kumar Giri, Rajat Kumar Pal, Alok Haldar, Samiran Acharyya, Debasis Dhal, Moumita Khowas, Sudip Kumar Sahana |
Solving a Mathematical Model for Small Vegetable Sellers in India by a Stochastic Knapsack Problem: An Advanced Genetic Algorithm Based Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Uncertain. Fuzziness Knowl. Based Syst. ![In: Int. J. Uncertain. Fuzziness Knowl. Based Syst. 30(5), pp. 897-921, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Abdellah Rezoug, Mohamed Bahy Bader-El-Den, Dalila Boughaci |
Application of Supervised Machine Learning Methods on the Multidimensional Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Neural Process. Lett. ![In: Neural Process. Lett. 54(2), pp. 871-890, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Méziane Aïder, Oussama Gacem, Mhand Hifi |
Branch and solve strategies-based algorithm for the quadratic multiple knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Oper. Res. Soc. ![In: J. Oper. Res. Soc. 73(3), pp. 540-557, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Jianpeng Ding, Liuxin Chen, Ginger Y. Ke, Yuanbo Li, Lianmin Zhang |
Balancing the profit and capacity under uncertainties: a target-based distributionally robust knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. Trans. Oper. Res. ![In: Int. Trans. Oper. Res. 29(2), pp. 760-782, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Yassine Adouani, Bassem Jarboui, Malek Masmoudi |
A matheuristic for the 0-1 generalized quadratic multiple knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 16(1), pp. 37-58, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Hiroshi Fujiwara, Kanaho Hanji, Hiroaki Yamamoto |
Online Removable Knapsack Problem for Integer-Sized Unweighted Items. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Fundam. Electron. Commun. Comput. Sci. ![In: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(9), pp. 1195-1202, September 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Adel Sulaiman, Marium Sadiq, Yasir Mehmood, Muhammad Akram, Ghassan Ahmed Ali |
Fitness-Based Acceleration Coefficients Binary Particle Swarm Optimization (FACBPSO) to Solve the Discounted Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symmetry ![In: Symmetry 14(6), pp. 1208, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Yacine Laalaoui, Hedi M'Halla |
An exact algorithm for large knapsack sharing problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFOR Inf. Syst. Oper. Res. ![In: INFOR Inf. Syst. Oper. Res. 60(3), pp. 315-341, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Nima Moradi, Vahid Kayvanfar, Majid Rafiee |
An efficient population-based simulated annealing algorithm for 0-1 knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eng. Comput. ![In: Eng. Comput. 38(3), pp. 2771-2790, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Benyamin Abdollahzadeh, Saeid Barshandeh, Hatef Javadi, Nicola Epicoco |
An enhanced binary slime mould algorithm for solving the 0-1 knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eng. Comput. ![In: Eng. Comput. 38(4), pp. 3423-3444, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Zuocheng Li, Lixin Tang, Jiyin Liu |
A Memetic Algorithm Based on Probability Learning for Solving the Multidimensional Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Cybern. ![In: IEEE Trans. Cybern. 52(4), pp. 2284-2299, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Sergey Kovalev |
Approximation issues of fractional knapsack with penalties: a note. ![Search on Bibsonomy](Pics/bibsonomy.png) |
4OR ![In: 4OR 20(2), pp. 209-216, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Jingjing Tan, Fengmin Wang, Weina Ye, Xiaoqing Zhang, Yang Zhou 0018 |
Streaming algorithms for monotone non-submodular function maximization under a knapsack constraint on the integer lattice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 937, pp. 39-49, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Vahid Roostapour, Aneta Neumann, Frank Neumann 0001 |
Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 924, pp. 129-147, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
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) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 936, pp. 139-147, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Zhongzheng Tang, Chenhao Wang 0001, Hau Chan |
Monotone k-submodular secretary problems: Cardinality and knapsack constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 921, pp. 86-99, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Jingjing Tan, Dongmei Zhang 0002, Hongyang Zhang, Zhenning Zhang |
One-pass streaming algorithm for DR-submodular maximization with a knapsack constraint over the integer lattice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Electr. Eng. ![In: Comput. Electr. Eng. 99, pp. 107766, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Trivikram Dokka, Adam N. Letchford, M. Hasan Mansoor |
Revisiting surrogate relaxation for the multidimensional knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 50(6), pp. 674-678, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
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) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 50(1), pp. 28-31, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Enrique Ballinas, Oscar Montiel |
Hybrid Quantum Genetic Algorithm for the 0-1 Knapsack Problem in the IBM Qiskit Simulator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computación y Sistemas ![In: Computación y Sistemas 26(2), 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
12 | Evripidis Bampis, Bruno Escoffier, Alexandre Teiller |
Multistage knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 126, pp. 106-118, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz, Hadas Shachnai |
An almost optimal approximation algorithm for monotone submodular multiple knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 125, pp. 149-165, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | András Hajdu, György Terdik, Attila Tiba, Henrietta Tomán |
A stochastic approach to handle resource constraints as knapsack problems in ensemble pruning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. ![In: Mach. Learn. 111(4), pp. 1551-1595, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Fritz Bökler, Markus Chimani, Mirko H. Wagner |
On the rectangular knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Methods Oper. Res. ![In: Math. Methods Oper. Res. 96(1), pp. 149-160, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Steffen Goebbels, Frank Gurski, Dominique Komander |
The knapsack problem with special neighbor constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Methods Oper. Res. ![In: Math. Methods Oper. Res. 95(1), pp. 1-34, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Ashish Jain, Manoj Kumar Bohra |
Two improved metaheuristic techniques and their applications in automated cryptanalysis of knapsack cryptosystems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Bio Inspired Comput. ![In: Int. J. Bio Inspired Comput. 19(4), pp. 210-227, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Hamza Onoruoiza Salami, Abubakar Bala |
An improved chemical reaction optimisation algorithm for the 0-1 knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Bio Inspired Comput. ![In: Int. J. Bio Inspired Comput. 19(4), pp. 253-266, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Karl-Ludwig Besser, Eduard A. Jorswieck |
QMKPy: A Python Testbed for the Quadratic Multiple Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Open Source Softw. ![In: J. Open Source Softw. 7(79), pp. 4718, November 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
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) |
J. Artif. Intell. Res. ![In: J. Artif. Intell. Res. 74, pp. 661-690, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Christoph Buchheim, Dorothee Henke |
The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Glob. Optim. ![In: J. Glob. Optim. 83(4), pp. 803-824, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Haoran Zhu |
Recognition of Facets for Knapsack Polytope is DP-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2211.03311, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
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) |
CoRR ![In: CoRR abs/2209.11934, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Dmitry V. GRathoreribanov, Dmitriy S. Malyshev, I. A. Shumilov |
Structured (min, +)-Convolution And Its Applications For The Shortest Vector, Closest Vector, and Separable Nonlinear Knapsack Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2209.04812, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Hongbo Li 0005, Jitao Xu 0002, Minghao Yin |
Finding and Exploring Promising Search Space for the 0-1 Multidimensional Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2210.03918, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Jorik Jooken, Pieter Leyman, Patrick De Causmaecker |
Features for the 0-1 knapsack problem based on inclusionwise maximal solutions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2211.09665, 2022. 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) |
CoRR ![In: CoRR abs/2207.14037, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Wenli Zhu, Liangqing Luo |
Efficient and Effective Local Search for the Set-Union Knapsack Problem and Budgeted Maximum Coverage Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2207.00749, 2022. 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) |
CoRR ![In: CoRR abs/2203.00285, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Sushmita Gupta, Pallavi Jain 0001, Sanjay Seetharaman |
More Effort Towards Multiagent Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2208.02766, 2022. 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) |
CoRR ![In: CoRR abs/2202.11902, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
12 | Congcong Wu, Xiangyun Gao, Xueyong Liu, Bowen Sun |
Self-adjusting optimization algorithm for solving the setunion knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2202.05698, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
12 | Andreas Abels, Leon Ladewig, Kevin Schewior, Moritz Stinzendörfer |
Knapsack Secretary Through Boosting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2208.05396, 2022. 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) |
CoRR ![In: CoRR abs/2205.08493, 2022. 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) |
CoRR ![In: CoRR abs/2207.01551, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Karl-Ludwig Besser, Eduard A. Jorswieck |
QMKPy: A Python Testbed for the Quadratic Multiple Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2211.17222, 2022. 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) |
CoRR ![In: CoRR abs/2209.09668, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Isaac Slavitt |
Prioritizing municipal lead mitigation projects as a relaxed knapsack optimization: a method and case study. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2201.09372, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP 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) |
CoRR ![In: CoRR abs/2210.06659, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Sunhyeon Kwon, Sungsoo Park |
Solving Bilevel Knapsack Problem using Graph Neural Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2211.13436, 2022. 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) |
CoRR ![In: CoRR abs/2204.05597, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Adam Jozefiak, F. Bruce Shepherd, Noah Weninger |
A Knapsack Intersection Hierarchy Applied to All-or-Nothing Flow in Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2201.02914, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
12 | Kai Jin, Danna Zhang, Canhui Zhang |
Sum-of-Max Partition under a Knapsack Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2207.00768, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Giovanni Capobianco, Ciriaco D'Ambrosio, Luigi Pavone, Andrea Raiconi, Gaetano Vitale, Fabio Sebastiano |
A hybrid metaheuristic for the Knapsack Problem with Forfeits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 26(2), pp. 749-762, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Sasan Harifi |
A binary ancient-inspired Giza Pyramids Construction metaheuristic algorithm for solving 0-1 knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 26(22), pp. 12761-12778, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Christophe Wilbaut, Raca Todosijevic, Saïd Hanafi, Arnaud Fréville |
Variable neighborhood search for the discounted {0-1} knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Soft Comput. ![In: Appl. Soft Comput. 131, pp. 109821, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Shubham Gupta, Rong Su 0001, Shitu Singh |
Diversified sine-cosine algorithm based on differential evolution for multidimensional knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Soft Comput. ![In: Appl. Soft Comput. 130, pp. 109682, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Qiang Luo, Yunqing Rao, Xiaoqiang Guo, Bing Du |
A biased genetic algorithm hybridized with VNS for the two-dimensional knapsack packing problem with defects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Soft Comput. ![In: Appl. Soft Comput. 118, pp. 108479, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Mert Sahinkoç, Ümit Bilge |
A reference set based many-objective co-evolutionary algorithm with an application to the knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 300(2), pp. 405-417, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Jorik Jooken, Pieter Leyman, Patrick De Causmaecker |
A new class of hard problem instances for the 0-1 knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 301(3), pp. 841-854, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Leonardo Lamanna 0001, Renata Mansini, Roberto Zanotti |
A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 297(1), pp. 53-65, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Krzysztof Fleszar 0002 |
A branch-and-bound algorithm for the quadratic multiple knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 298(1), pp. 89-98, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Yu Yang 0014, Natashia Boland, Bistra Dilkina, Martin W. P. Savelsbergh |
Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 301(3), pp. 828-840, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Pierre Nancel-Penard, Nelson Morales, Fabien Cornillier |
A recursive time aggregation-disaggregation heuristic for the multidimensional and multiperiod precedence-constrained knapsack problem: An application to the open-pit mine block sequencing problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 303(3), pp. 1088-1099, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Qing Zhou, Jin-Kao Hao, Qinghua Wu 0002 |
A hybrid evolutionary search for the generalized quadratic multiple knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 296(3), pp. 788-803, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Gleb Beliakov |
Knapsack problems with dependencies through non-additive measures and Choquet integral. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 301(1), pp. 277-286, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
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) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 315, pp. 71-85, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Takanori Maehara, So Nakashima, Yutaro Yamaguchi 0001 |
Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 194(1), pp. 85-119, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Daniel Bienstock, Yuri Faenza, Igor Malinovic, Monaldo Mastrolilli, Ola Svensson, Mark Zuckerberg |
On inequalities with bounded coefficients and pitch for the min knapsack polytope. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Optim. ![In: Discret. Optim. 44(Part), pp. 100567, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Franklin Djeumou Fomeni, Konstantinos Kaparis, Adam N. Letchford |
A cut-and-branch algorithm for the Quadratic Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Optim. ![In: Discret. Optim. 44(Part), pp. 100579, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Yanhong Feng, Gai-Ge Wang |
A binary moth search algorithm based on self-learning for multidimensional knapsack problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Future Gener. Comput. Syst. ![In: Future Gener. Comput. Syst. 126, pp. 48-64, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Satoru Jimbo, Daiki Okonogi, Kota Ando, Thiem Van Chu, Jaehoon Yu, Masato Motomura, Kazushi Kawamura |
A Hybrid Integer Encoding Method for Obtaining High-Quality Solutions of Quadratic Knapsack Problems on Solid-State Annealers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Inf. Syst. ![In: IEICE Trans. Inf. Syst. 105-D(12), pp. 2019-2031, December 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Isma Dahmani, Meriem Ferroum, Mhand Hifi |
Effect of Backtracking Strategy in Population-Based Approach: The Case of the Set-Union Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cybern. Syst. ![In: Cybern. Syst. 53(1), pp. 168-185, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Zhe Shu, Zhiwei Ye, Xinlu Zong, Shiqin Liu, Daode Zhang, Chunzhi Wang, Mingwei Wang 0003 |
A modified hybrid rice optimization algorithm for solving 0-1 knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Intell. ![In: Appl. Intell. 52(5), pp. 5751-5769, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI 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) |
J. Optim. Theory Appl. ![In: J. Optim. Theory Appl. 194(2), pp. 521-542, 2022. 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) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2022, pp. 709, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
12 | Mohamed Abdel-Basset, Reda Mohamed, Osama M. Elkomy, Mohamed Abouhawwash |
Recent metaheuristic algorithms with genetic operators for high-dimensional knapsack instances: A comparative study. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Ind. Eng. ![In: Comput. Ind. Eng. 166, pp. 107974, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Samah Boukhari, Isma Dahmani, Mhand Hifi |
Effect of the local branching strategy on the descent method: The case of the generalized multiple knapsack with setup. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Ind. Eng. ![In: Comput. Ind. Eng. 165, pp. 107934, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Patcharin Buayen, Jeeraporn Werapun |
Efficient 0/1-Multiple-Knapsack Problem Solving by Hybrid DP Transformation and Robust Unbiased Filtering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithms ![In: Algorithms 15(10), pp. 366, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Yan Zhang, Tengyu Wu, Xiaoyue Ding |
Optimization Method of Knapsack Problem Based on BPSO-SA in Logistics Distribution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Inf. Process. Syst. ![In: J. Inf. Process. Syst. 18(5), pp. 665-676, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Zhenning Zhang, Bin Liu, Yishui Wang, Dachuan Xu, Dongmei Zhang 0002 |
Maximizing a monotone non-submodular function under a knapsack constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 43(5), pp. 1125-1148, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Richard J. Forrester, Lucas A. Waddell |
Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 44(1), pp. 498-517, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Karl-Ludwig Besser, Eduard A. Jorswieck |
QMKPy: A Python Testbed for the Quadratic Multiple Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2022 |
DOI RDF |
|
12 | Pierre Montalbano, Simon de Givry, George Katsirelos |
Multiple-choice Knapsack Constraint in Graphical Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPAIOR ![In: Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 19th International Conference, CPAIOR 2022, Los Angeles, CA, USA, June 20-23, 2022, Proceedings, pp. 282-299, 2022, Springer, 978-3-031-08010-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI 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) |
CIKM ![In: Proceedings of the 31st ACM International Conference on Information & Knowledge Management, Atlanta, GA, USA, October 17-21, 2022, pp. 2863-2872, 2022, ACM, 978-1-4503-9236-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|