Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
12 | Gülnur Yildizdan, Emine Bas |
A Novel Binary Artificial Jellyfish Search Algorithm for Solving 0-1 Knapsack Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Neural Process. Lett. ![In: Neural Process. Lett. 55(7), pp. 8605-8671, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Anthony Dellinger, Yun Lu, Myung Soon Song, Francis J. Vasko |
Simple strategies that generate bounded solutions for the multiple-choice multi-dimensional knapsack problem: a guide for OR practitioners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. Trans. Oper. Res. ![In: Int. Trans. Oper. Res. 30(6), pp. 4061-4077, November 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
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) |
Int. Trans. Oper. Res. ![In: Int. Trans. Oper. Res. 30(6), pp. 3719-3737, November 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Jianping Li, Lijian Cai, Junran Lichen, Pengxiang Pan |
Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 17(8), pp. 1939-1956, November 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Yazeed Yasin Ghadi, Tamara Al Shloul, Zahid Iqbal Nezami, Hamid Ali, Muhammad Asif 0002, Hanan Aljuaid, Shahbaz Ahmad |
An efficient optimizer for the 0/1 knapsack problem using group counseling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PeerJ Comput. Sci. ![In: PeerJ Comput. Sci. 9, pp. e1315, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Alberto Locatelli |
Optimization methods for knapsack and tool switching problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
4OR ![In: 4OR 21(4), pp. 715-716, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Evgeny Gurevsky 0001, Dmitry Kopelevich, Sergey Kovalev, Mikhail Y. Kovalyov |
Integer knapsack problems with profit functions of the same value range. ![Search on Bibsonomy](Pics/bibsonomy.png) |
4OR ![In: 4OR 21(3), pp. 405-419, September 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Nir Halman, Mikhail Y. Kovalyov, Alain Quilliot |
Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
4OR ![In: 4OR 21(2), pp. 235-246, June 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Xinliang Tian, Dantong Ouyang, Yiyuan Wang, Huisi Zhou, Luyu Jiang, Liming Zhang 0005 |
Combinatorial optimization and local search: A case study of the discount knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Electr. Eng. ![In: Comput. Electr. Eng. 105, pp. 108551, January 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Kai Jin, Danna Zhang, Canhui Zhang |
Sum-of-Max partition under a Knapsack constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Electr. Eng. ![In: Comput. Electr. Eng. 105, pp. 108521, January 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Adam Jozefiak, F. Bruce Shepherd, Noah Weninger |
A knapsack intersection hierarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 51(1), pp. 72-78, January 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Xin Du, Jiawei Zhou, Youcong Ni, Wentao Liu, Ruliang Xiao, Xiuli Wu |
A novel binary multi-swarms fruit fly optimisation algorithm for the 0-1 multidimensional knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Bio Inspired Comput. ![In: Int. J. Bio Inspired Comput. 21(1), pp. 1-10, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Yongquan Zhou, Yan Shi, Yuanfei Wei, Qifang Luo, Zhonghua Tang |
Nature-inspired algorithms for 0-1 knapsack problem: A survey. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Neurocomputing ![In: Neurocomputing 554, pp. 126630, October 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Suning Gong, Qingqin Nong, Shuyu Bao, Qizhi Fang, Ding-Zhu Du |
A fast and deterministic algorithm for Knapsack-constrained monotone DR-submodular maximization over an integer lattice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Glob. Optim. ![In: J. Glob. Optim. 85(1), pp. 15-38, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Wei-Kun Chen, Liang Chen, Yu-Hong Dai |
Lifting for the integer knapsack cover polyhedron. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Glob. Optim. ![In: J. Glob. Optim. 86(1), pp. 205-249, May 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Kuo-Chun Tseng, Wei-Chieh Lai, I-Chia Chen, Yun-Hsiang Hsiao, Jr-Yu Chiue, Wei-Chun Huang |
Amplitude-Ensemble Quantum-Inspired Tabu Search Algorithm for Solving 0/1 Knapsack Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2311.12867, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Jamico Schade, Makrand Sinha, Stefan Weltge |
Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2308.16711, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Yakir Gorski, Shai Avidan |
Securing Neural Networks with Knapsack Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2304.10442, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Hao Xiao, Qian Liu, Yang Zhou, Min Li |
Approximation algorithms for k-submodular maximization subject to a knapsack constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2306.14520, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | George S. Rizos, Konstantinos A. Draziotis |
Cryptographic Primitives based on Compact Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2303.08973, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Karl Bringmann, Alejandro Cassis |
Faster 0-1-Knapsack via Near-Convex Min-Plus-Convolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.01593, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Mitchell Keegan, Mahdi Abolghasemi |
Approximating Solutions to the Knapsack Problem using the Lagrangian Dual Framework. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2312.03413, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Canh V. Pham, Tan D. Tran, Dung K. T. Ha 0001, My T. Thai |
Linear Query Approximation Algorithms for Non-monotone Submodular Maximization under Knapsack Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.10292, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Tomer Cohen, Ariel Kulik, Hadas Shachnai |
Improved Approximation for Two-dimensional Vector Multiple Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2307.02137, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Toru Yoshinaga, Yasushi Kawase |
Size-stochastic Knapsack Online Contention Resolution Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.08622, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Yu-Ran Gu, Chao Bian 0002, Chao Qian 0001 |
Submodular Maximization under the Intersection of Matroid and Knapsack Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2307.09487, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Dung T. K. Ha, Canh V. Pham, Tan D. Tran, Huan X. Hoang |
Robust Approximation Algorithms for Non-monotone k-Submodular Maximization under a Knapsack Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2309.12025, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Qizheng He, Zhean Xu |
Simple and Faster Algorithms for Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2308.11307, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Federico D'Onofrio, Yuri Faenza, Lingyi Zhang |
The Incremental Knapsack Problem with Monotone Submodular All-or-Nothing Profits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2304.12967, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Karl Bringmann |
Knapsack with Small Items in Near-Quadratic Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2308.03075, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Miao Bai, Carlos Cardonha |
Cardinality-Constrained Continuous Knapsack Problem with Concave Piecewise-Linear Utilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2302.03781, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Ce Jin 0001 |
Solving Knapsack with Small Items via L0-Proximity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2307.09454, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Ce Jin 0001 |
0-1 Knapsack in Nearly Quadratic Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2308.04093, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Adam Lechowicz, Rik Sengupta, Bo Sun 0004, Shahin Kamali, Mohammad H. Hajiesmaili |
Time Fairness in Online Knapsack Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.13293, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Lin Chen 0009, Jiayi Lian, Yuchen Mao, Guochuan Zhang |
Faster Algorithms for Bounded Knapsack and Bounded Subset Sum Via Fine-Grained Proximity Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2307.12582, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Jonathan Tonglet, Manon Reusens, Philipp Borchert, Bart Baesens |
SEER : A Knapsack approach to Exemplar Selection for In-Context HybridQA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2310.06675, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Mingyang Deng, Ce Jin 0001, Xiao Mao |
Approximating Knapsack and Partition via Dense Subset Sums. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2301.09333, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Kokila Perera, Aneta Neumann, Frank Neumann 0001 |
Evolutionary Multi-Objective Algorithms for the Knapsack Problems with Stochastic Profits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2303.01695, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Palash Dey, Sudeshna Kolay, Sipra Singh |
Knapsack: Connectedness, Path, and Shortest-Path. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2307.12547, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Xuanfeng Li, Shengcai Liu, Jin Wang, Xiao Chen, Yew-Soon Ong, Ke Tang 0001 |
Data-Driven Chance-Constrained Multiple-Choice Knapsack Problem: Model, Algorithms, and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2306.14690, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Lin Chen 0009, Jiayi Lian, Yuchen Mao, Guochuan Zhang |
A Nearly Quadratic-Time FPTAS for Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2308.07821, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Michal Pilipczuk, Mathieu Mari, Timothé Picavet |
A parameterized approximation scheme for the 2D-Knapsack problem with wide items. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2307.10672, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Xiao Mao |
(1-ε)-Approximation of Knapsack in Nearly Quadratic Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2308.07004, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Klaus Heeger, Danny Hermelin, Matthias Mnich, Dvir Shabtay |
No Polynomial Kernels for Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2308.12593, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Ilan Doron Arad, Ariel Kulik, Hadas Shachnai |
An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2308.12622, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Lixing Lyu, Wang Chi Cheung |
Non-Stationary Bandits with Knapsack Problems with Advice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2302.04182, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Enrique Ballinas, Oscar Montiel |
Hybrid quantum genetic algorithm with adaptive rotation angle for the 0-1 Knapsack problem in the IBM Qiskit simulator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 27(18), pp. 13321-13346, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Laio Oriel Seman, Cezar Antônio Rigo, Eduardo Camponogara, Eduardo Augusto Bezerra, Leandro dos Santos Coelho |
Explainable column-generation-based genetic algorithm for knapsack-like energy aware nanosatellite task scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Soft Comput. ![In: Appl. Soft Comput. 144, pp. 110475, September 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Enrico Malaguti, Michele Monaci, Paolo Paronuzzi, Ulrich Pferschy |
Corrigendum to: 'Integer optimization with penalized fractional values: The Knapsack case' [European Journal of Operational Research (2019) 874-888]. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 307(2), pp. 990, June 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
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) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 311(1), pp. 36-55, November 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Alessandro Baldo 0001, Matteo Boffa, Lorenzo Cascioli, Edoardo Fadda, Chiara Lanza, Arianna Ravera |
The polynomial robust knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 305(3), pp. 1424-1434, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Zequn Wei, Jin-Kao Hao, Jintong Ren, Fred W. Glover |
Responsive strategic oscillation for solving the disjunctively constrained knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 309(3), pp. 993-1009, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Christophe Wilbaut, Raca Todosijevic, Saïd Hanafi, Arnaud Fréville |
Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 304(3), pp. 901-911, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Laura Galli, Silvano Martello, Carlos Rey 0001, Paolo Toth |
Lagrangian matheuristics for the Quadratic Multiple Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 335, pp. 36-51, August 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Franklin Djeumou Fomeni |
A lifted-space dynamic programming algorithm for the Quadratic Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 335, pp. 52-68, August 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Yuri Faenza, Danny Segev, Lingyi Zhang |
Approximation algorithms for the generalized incremental knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 198(1), pp. 27-83, March 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu |
Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 197(2), pp. 847-875, February 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Jan Boeckmann, Clemens Thielen, Ulrich Pferschy |
Approximating single- and multi-objective nonlinear sum and product knapsack problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Optim. ![In: Discret. Optim. 48(Part 1), pp. 100771, May 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Emine Bas |
Binary Aquila Optimizer for 0-1 knapsack problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eng. Appl. Artif. Intell. ![In: Eng. Appl. Artif. Intell. 118, pp. 105592, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Fehmi Burcin Ozsoydan, Ilker Gölcük |
A reinforcement learning based computational intelligence approach for binary optimization problems: The case of the set-union knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eng. Appl. Artif. Intell. ![In: Eng. Appl. Artif. Intell. 118, pp. 105688, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Bilal Ervural, Hüseyin Hakli |
A binary reptile search algorithm based on transfer functions with a new stochastic repair method for 0-1 knapsack problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Ind. Eng. ![In: Comput. Ind. Eng. 178, pp. 109080, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Mohammad Subhi Al-Batah, Mohammed Riyad Al-Eiadeh |
An improved discreet Jaya optimisation algorithm with mutation operator and opposition-based learning to solve the 0-1 knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Math. Oper. Res. ![In: Int. J. Math. Oper. Res. 26(2), pp. 143-169, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Mohamed Abdel-Basset, Reda Mohamed, Ibrahim M. Hezam, Karam M. Sallam |
Performance Optimization and Comprehensive Analysis of Binary Nutcracker Optimization Algorithm: A Case Study of Feature Selection and Merkle-Hellman Knapsack Cryptosystem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Complex. ![In: Complex. 2023, pp. 3489461:1-3489461:33, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Kemin Yu, Min Li, Yang Zhou 0018, Qian Liu |
On maximizing monotone or non-monotone k-submodular functions with the intersection of knapsack and matroid constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 45(3), pp. 93, April 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Zihan Chen, Bin Liu 0009, Hongmin W. Du |
Streaming submodular maximization under d-knapsack constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 45(1), pp. 15, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Byoungil Choi, Jihye Jung, Taehoon Lee, Joonyup Eun, In-Chan Choi |
Instance Datasets for Binary Linear and Quadratic Knapsack Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2023 |
DOI RDF |
|
12 | Tomer Cohen, Ariel Kulik, Hadas Shachnai |
Improved Approximation for Two-Dimensional Vector Multiple Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 20:1-20:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Noah Weninger, Ricardo Fukasawa |
A Fast Combinatorial Algorithm for the Bilevel Knapsack Problem with Interdiction Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization - 24th International Conference, IPCO 2023, Madison, WI, USA, June 21-23, 2023, Proceedings, pp. 438-452, 2023, Springer, 978-3-031-32725-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Tan D. Tran, Canh V. Pham, Dung Ha |
Maximizing a $k$-Submodular Maximization Function under an Individual Knapsack Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoICT ![In: Proceedings of the 12th International Symposium on Information and Communication Technology, SOICT 2023, Ho Chi Minh, Vietnam, December 7-8, 2023, pp. 56-62, 2023, ACM. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Mingyang Deng, Ce Jin 0001, Xiao Mao |
Approximating Knapsack and Partition via Dense Subset Sums. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 2961-2979, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Velichka Traneva, Petar R. Petrov, Stoyan Tranev |
An Elliptic Intuitionistic Fuzzy Portfolio Selection Problem based on Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FedCSIS (Communication Papers) ![In: Communication Papers of the 18th Conference on Computer Science and Intelligence Systems, FedCSIS 2023, Warsaw, Poland, September 17-20, 2023., pp. 329-336, 2023, 978-83-969601-3-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Junaid ur Rehman, Hayder Al-Hraishawi, Symeon Chatzinotas |
Quantum Approximate Optimization Algorithm for Knapsack Resource Allocation Problems in Communication Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICC ![In: IEEE International Conference on Communications, ICC 2023, Rome, Italy, May 28 - June 1, 2023, pp. 2674-2679, 2023, IEEE, 978-1-5386-7462-8. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Karl Bringmann, Alejandro Cassis |
Faster 0-1-Knapsack via Near-Convex Min-Plus-Convolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 31st Annual European Symposium on Algorithms, ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands, pp. 24:1-24:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-295-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Xiaoming Sun 0001, Jialin Zhang 0001, Zhijie Zhang |
Simple Deterministic Approximation for Submodular Multiple Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 31st Annual European Symposium on Algorithms, ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands, pp. 98:1-98:15, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-295-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Wenhao Sun, Kai Han 0003, Shuang Cui |
Deletion-Robust Submodular Maximization under a Knapsack Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HPCC/DSS/SmartCity/DependSys ![In: IEEE International Conference on High Performance Computing & Communications, Data Science & Systems, Smart City & Dependability in Sensor, Cloud & Big Data Systems & Application, HPCC/DSS/SmartCity/DependSys 2023, Melbourne, Australia, December 17-21, 2023, pp. 482-489, 2023, IEEE, 979-8-3503-3001-4. The full citation details ...](Pics/full.jpeg) |
2023 |
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) |
SIGMETRICS (Abstracts) ![In: Abstract Proceedings of the 2023 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS 2023, Orlando, FL, USA, June 19-23, 2023, pp. 59-60, 2023, ACM. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Elisabet Burjons, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith |
The Online Simple Knapsack Problem with Reservation and Removability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: 48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, August 28 to September 1, 2023, Bordeaux, France, pp. 29:1-29:12, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-292-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Shuang Cui, Kai Han 0003, Jing Tang 0004, He Huang 0001, Xueying Li, Aakas Zhiyuli |
Practical Parallel Algorithms for Submodular Maximization Subject to a Knapsack Constraint with Nearly Optimal Adaptivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAAI ![In: Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023, pp. 7261-7269, 2023, AAAI Press, 978-1-57735-880-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Yu-Ran Gu, Chao Bian 0002, Chao Qian 0001 |
Submodular Maximization under the Intersection of Matroid and Knapsack Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAAI ![In: Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023, pp. 3959-3967, 2023, AAAI Press, 978-1-57735-880-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Zhongzheng Tang, Jingwen Chen, Chenhao Wang 0001 |
An Improved Analysis of the Greedy+Singleton Algorithm for k-Submodular Knapsack Maximization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJTCS-FAW ![In: Frontiers of Algorithmics - 17th International Joint Conference, IJTCS-FAW 2023 Macau, China, August 14-18, 2023, Proceedings, pp. 15-28, 2023, Springer, 978-3-031-39343-3. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Jianjun Cao, Chumei Gu, Baowei Wang, Zhen Yuan, Nianfeng Weng, Yuxin Xu |
Beam-GBAS for Multidimensional Knapsack Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICSI (1) ![In: Advances in Swarm Intelligence - 14th International Conference, ICSI 2023, Shenzhen, China, July 14-18, 2023, Proceedings, Part I, pp. 345-355, 2023, Springer, 978-3-031-36621-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Zhongzheng Tang, Chenhao Wang 0001 |
Improved Analysis of Greedy Algorithm on k-Submodular Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECAI ![In: ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland - Including 12th Conference on Prestigious Applications of Intelligent Systems (PAIS 2023), pp. 2338-2345, 2023, IOS Press, 978-1-64368-436-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Lehilton L. C. Pedrosa, Mauro R. C. da Silva, Rafael C. S. Schouery |
Positional Knapsack Problem: NP-hardness and approximation scheme (Brief Announcement). ![Search on Bibsonomy](Pics/bibsonomy.png) |
LAGOS ![In: Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, LAGOS 2023, Huatulco, Mexico, September 18-22, 2023., pp. 400-402, 2023, Elsevier. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Arnaud Liefooghe, Katherine Mary Malan |
Adaptive Landscape-aware Constraint Handling with Application to Binary Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO Companion ![In: Companion Proceedings of the Conference on Genetic and Evolutionary Computation, GECCO 2023, Companion Volume, Lisbon, Portugal, July 15-19, 2023, pp. 2064-2071, 2023, ACM. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Alejandro Marrero, Eduardo Segredo, Emma Hart, Jakob Bossek, Aneta Neumann |
Generating diverse and discriminatory knapsack instances by searching for novelty in variable dimensions of feature-space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2023, Lisbon, Portugal, July 15-19, 2023, pp. 312-320, 2023, ACM. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Jesutofunmi Ajayi, Antonio Di Maio, Torsten Braun, Dimitrios Xenakis |
An Online Multi-dimensional Knapsack Approach for Slice Admission Control. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCNC ![In: 20th IEEE Consumer Communications & Networking Conference, CCNC 2023, Las Vegas, NV, USA, January 8-11, 2023, pp. 152-157, 2023, IEEE, 978-1-6654-9734-3. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Tariq Bontekoe, Frank Phillipson, Ward van der Schoot |
Translating Constraints into QUBOs for the Quadratic Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCS (5) ![In: Computational Science - ICCS 2023 - 23rd International Conference, Prague, Czech Republic, July 3-5, 2023, Proceedings, Part V, pp. 90-107, 2023, Springer, 978-3-031-36029-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Bharat Agarwal, Mohammed Amine Togou, Marco Ruffini, Gabriel-Miro Muntean |
A Low Complexity ML-Assisted Multi-knapsack-based Approach for User Association and Resource Allocation in 5G HetNets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BMSB ![In: IEEE International Symposium on Broadband Multimedia Systems and Broadcasting, BMSB 2023, Beijing, China, June 14-16, 2023, pp. 1-6, 2023, IEEE, 979-8-3503-2152-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Vítor Gomes Chagas, Elisa Dell'Arriva, Flávio Keidi Miyazawa |
Approximation Schemes Under Resource Augmentation for Knapsack and Packing Problems of Hyperspheres and Other Shapes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms - 21st International Workshop, WAOA 2023, Amsterdam, The Netherlands, September 7-8, 2023, Proceedings, pp. 145-159, 2023, Springer, 978-3-031-49814-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Peter Rossmanith, Moritz Stocker, David Wehner |
Online Knapsack with Removal and Recourse. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms - 34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7-10, 2023, Proceedings, pp. 123-135, 2023, Springer, 978-3-031-34346-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Jonathan Tonglet, Manon Reusens, Philipp Borchert, Bart Baesens |
SEER : A Knapsack approach to Exemplar Selection for In-Context HybridQA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EMNLP ![In: Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing, EMNLP 2023, Singapore, December 6-10, 2023, pp. 13569-13583, 2023, Association for Computational Linguistics, 979-8-89176-060-8. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Wenzhe Zhang, Shufang Gong, Bin Liu 0009 |
Efficient Algorithms for k-Submodular Function Maximization with p-System and d-Knapsack Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA (1) ![In: Combinatorial Optimization and Applications - 17th International Conference, COCOA 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings, Part I, pp. 265-276, 2023, Springer, 978-3-031-49610-3. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Zhongzheng Tang, Jingwen Chen, Chenhao Wang 0001, Tian Wang 0001, Weijia Jia 0001 |
Greedy+Max: An Efficient Approximation Algorithm for k-Submodular Knapsack Maximization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA (1) ![In: Combinatorial Optimization and Applications - 17th International Conference, COCOA 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings, Part I, pp. 287-299, 2023, Springer, 978-3-031-49610-3. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Oksana Pichugina, Olha Matsiy, Yuriy Skob |
Performance Comparison of Unbounded Knapsack Problem Formulations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLINS (3) ![In: Proceedings of the 7th International Conference on Computational Linguistics and Intelligent Systems. Volume III: Intelligent Systems Workshop, Kharkiv, Ukraine, April 20-21, 2023., pp. 263-272, 2023, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
12 | Dung K. T. Ha 0001, Canh V. Pham, Tan D. Tran, Huan X. Hoang |
Robust Approximation Algorithms for Non-Monotone k-Submodular Maximization Under a Knapsack Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KSE ![In: 15th International Conference on Knowledge and Systems Engineering, KSE 2023, Hanoi, Vietnam, October 18-20, 2023, pp. 1-6, 2023, IEEE, 979-8-3503-2974-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Szymon Stradowski, Lech Madeyski |
Can we Knapsack Software Defect Prediction? Nokia 5G Case. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICSE Companion ![In: 45th IEEE/ACM International Conference on Software Engineering: ICSE 2023 Companion Proceedings, Melbourne, Australia, May 14-20, 2023, pp. 365-369, 2023, IEEE, 979-8-3503-2263-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Yi Liu, Guoli Yang, Qibin Zheng, Xiang Li, Kun Liu, Qiang Wang, Wei Qin |
Ant-Antlion Optimizer with Similarity Information for Multidimensional Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DMBD (1) ![In: Data Mining and Big Data - 8th International Conference, DMBD 2023, Sanya, China, December 9-12, 2023, Proceedings, Part I, pp. 243-255, 2023, Springer, 978-981-97-0836-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Sushmita Gupta, Pallavi Jain 0001, Sanjay Seetharaman |
More Effort Towards Multiagent Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2023: Theory and Practice of Computer Science - 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023, Nový Smokovec, Slovakia, January 15-18, 2023, Proceedings, pp. 47-62, 2023, Springer, 978-3-031-23100-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Canh V. Pham, Tan D. Tran, Dung K. T. Ha 0001, My T. Thai |
Linear Query Approximation Algorithms for Non-monotone Submodular Maximization under Knapsack Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023, 19th-25th August 2023, Macao, SAR, China, pp. 4127-4135, 2023, ijcai.org. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Mitchell Keegan, Mahdi Abolghasemi |
Approximating Solutions to the Knapsack Problem Using the Lagrangian Dual Framework. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AI (1) ![In: AI 2023: Advances in Artificial Intelligence - 36th Australasian Joint Conference on Artificial Intelligence, AI 2023, Brisbane, QLD, Australia, November 28 - December 1, 2023, Proceedings, Part I, pp. 455-467, 2023, Springer, 978-981-99-8387-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|