| 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.  |
Neural Process. Lett.  |
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. |
Int. Trans. Oper. Res. |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Isaac Slavitt |
Prioritizing municipal lead mitigation projects as a relaxed knapsack optimization: a method and case study. |
Int. Trans. Oper. Res. |
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. |
Optim. Lett. |
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. |
PeerJ Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Alberto Locatelli |
Optimization methods for knapsack and tool switching problems. |
4OR |
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. |
4OR |
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. |
4OR |
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. |
Comput. Electr. Eng. |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Kai Jin, Danna Zhang, Canhui Zhang |
Sum-of-Max partition under a Knapsack constraint. |
Comput. Electr. Eng. |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Adam Jozefiak, F. Bruce Shepherd, Noah Weninger |
A knapsack intersection hierarchy. |
Oper. Res. Lett. |
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. |
Int. J. Bio Inspired Comput. |
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. |
Neurocomputing |
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. |
J. Glob. Optim. |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Wei-Kun Chen, Liang Chen, Yu-Hong Dai |
Lifting for the integer knapsack cover polyhedron. |
J. Glob. Optim. |
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. |
CoRR |
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. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Yakir Gorski, Shai Avidan |
Securing Neural Networks with Knapsack Optimization. |
CoRR |
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. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | George S. Rizos, Konstantinos A. Draziotis |
Cryptographic Primitives based on Compact Knapsack Problem. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Karl Bringmann, Alejandro Cassis |
Faster 0-1-Knapsack via Near-Convex Min-Plus-Convolution. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Mitchell Keegan, Mahdi Abolghasemi |
Approximating Solutions to the Knapsack Problem using the Lagrangian Dual Framework. |
CoRR |
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. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Tomer Cohen, Ariel Kulik, Hadas Shachnai |
Improved Approximation for Two-dimensional Vector Multiple Knapsack. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Toru Yoshinaga, Yasushi Kawase |
Size-stochastic Knapsack Online Contention Resolution Schemes. |
CoRR |
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. |
CoRR |
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. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Qizheng He, Zhean Xu |
Simple and Faster Algorithms for Knapsack. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Federico D'Onofrio, Yuri Faenza, Lingyi Zhang |
The Incremental Knapsack Problem with Monotone Submodular All-or-Nothing Profits. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Karl Bringmann |
Knapsack with Small Items in Near-Quadratic Time. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Miao Bai, Carlos Cardonha |
Cardinality-Constrained Continuous Knapsack Problem with Concave Piecewise-Linear Utilities. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Ce Jin 0001 |
Solving Knapsack with Small Items via L0-Proximity. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Ce Jin 0001 |
0-1 Knapsack in Nearly Quadratic Time. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Adam Lechowicz, Rik Sengupta, Bo Sun 0004, Shahin Kamali, Mohammad H. Hajiesmaili |
Time Fairness in Online Knapsack Problems. |
CoRR |
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. |
CoRR |
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. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Mingyang Deng, Ce Jin 0001, Xiao Mao |
Approximating Knapsack and Partition via Dense Subset Sums. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Kokila Perera, Aneta Neumann, Frank Neumann 0001 |
Evolutionary Multi-Objective Algorithms for the Knapsack Problems with Stochastic Profits. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Palash Dey, Sudeshna Kolay, Sipra Singh |
Knapsack: Connectedness, Path, and Shortest-Path. |
CoRR |
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. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Lin Chen 0009, Jiayi Lian, Yuchen Mao, Guochuan Zhang |
A Nearly Quadratic-Time FPTAS for Knapsack. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Michal Pilipczuk, Mathieu Mari, Timothé Picavet |
A parameterized approximation scheme for the 2D-Knapsack problem with wide items. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Xiao Mao |
(1-ε)-Approximation of Knapsack in Nearly Quadratic Time. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Klaus Heeger, Danny Hermelin, Matthias Mnich, Dvir Shabtay |
No Polynomial Kernels for Knapsack. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Ilan Doron Arad, Ariel Kulik, Hadas Shachnai |
An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Lixing Lyu, Wang Chi Cheung |
Non-Stationary Bandits with Knapsack Problems with Advice. |
CoRR |
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. |
Soft Comput. |
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. |
Appl. Soft Comput. |
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]. |
Eur. J. Oper. Res. |
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. |
Eur. J. Oper. Res. |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Alessandro Baldo 0001, Matteo Boffa, Lorenzo Cascioli, Edoardo Fadda, Chiara Lanza, Arianna Ravera |
The polynomial robust knapsack problem. |
Eur. J. Oper. Res. |
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. |
Eur. J. Oper. Res. |
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. |
Eur. J. Oper. Res. |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Laura Galli, Silvano Martello, Carlos Rey 0001, Paolo Toth |
Lagrangian matheuristics for the Quadratic Multiple Knapsack Problem. |
Discret. Appl. Math. |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Franklin Djeumou Fomeni |
A lifted-space dynamic programming algorithm for the Quadratic Knapsack Problem. |
Discret. Appl. Math. |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Yuri Faenza, Danny Segev, Lingyi Zhang |
Approximation algorithms for the generalized incremental knapsack problem. |
Math. Program. |
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. |
Math. Program. |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Jan Boeckmann, Clemens Thielen, Ulrich Pferschy |
Approximating single- and multi-objective nonlinear sum and product knapsack problems. |
Discret. Optim. |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Emine Bas |
Binary Aquila Optimizer for 0-1 knapsack problems. |
Eng. Appl. Artif. Intell. |
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. |
Eng. Appl. Artif. Intell. |
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. |
Comput. Ind. Eng. |
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. |
Int. J. Math. Oper. Res. |
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. |
Complex. |
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. |
J. Comb. Optim. |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Zihan Chen, Bin Liu 0009, Hongmin W. Du |
Streaming submodular maximization under d-knapsack constraints. |
J. Comb. Optim. |
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. |
|
2023 |
DOI RDF |
|
| 12 | Tomer Cohen, Ariel Kulik, Hadas Shachnai |
Improved Approximation for Two-Dimensional Vector Multiple Knapsack. |
ISAAC |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Noah Weninger, Ricardo Fukasawa |
A Fast Combinatorial Algorithm for the Bilevel Knapsack Problem with Interdiction Constraints. |
IPCO |
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. |
SoICT |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Mingyang Deng, Ce Jin 0001, Xiao Mao |
Approximating Knapsack and Partition via Dense Subset Sums. |
SODA |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Velichka Traneva, Petar R. Petrov, Stoyan Tranev |
An Elliptic Intuitionistic Fuzzy Portfolio Selection Problem based on Knapsack Problem. |
FedCSIS (Communication Papers) |
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. |
ICC |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Karl Bringmann, Alejandro Cassis |
Faster 0-1-Knapsack via Near-Convex Min-Plus-Convolution. |
ESA |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Xiaoming Sun 0001, Jialin Zhang 0001, Zhijie Zhang |
Simple Deterministic Approximation for Submodular Multiple Knapsack Problem. |
ESA |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Wenhao Sun, Kai Han 0003, Shuang Cui |
Deletion-Robust Submodular Maximization under a Knapsack Constraint. |
HPCC/DSS/SmartCity/DependSys |
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. |
SIGMETRICS (Abstracts) |
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. |
MFCS |
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. |
AAAI |
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. |
AAAI |
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. |
IJTCS-FAW |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Jianjun Cao, Chumei Gu, Baowei Wang, Zhen Yuan, Nianfeng Weng, Yuxin Xu |
Beam-GBAS for Multidimensional Knapsack Problems. |
ICSI (1) |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Zhongzheng Tang, Chenhao Wang 0001 |
Improved Analysis of Greedy Algorithm on k-Submodular Knapsack. |
ECAI |
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). |
LAGOS |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Arnaud Liefooghe, Katherine Mary Malan |
Adaptive Landscape-aware Constraint Handling with Application to Binary Knapsack Problem. |
GECCO Companion |
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. |
GECCO |
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. |
CCNC |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Tariq Bontekoe, Frank Phillipson, Ward van der Schoot |
Translating Constraints into QUBOs for the Quadratic Knapsack Problem. |
ICCS (5) |
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. |
BMSB |
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. |
WAOA |
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. |
IWOCA |
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. |
EMNLP |
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. |
COCOA (1) |
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. |
COCOA (1) |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Oksana Pichugina, Olha Matsiy, Yuriy Skob |
Performance Comparison of Unbounded Knapsack Problem Formulations. |
COLINS (3) |
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. |
KSE |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Szymon Stradowski, Lech Madeyski |
Can we Knapsack Software Defect Prediction? Nokia 5G Case. |
ICSE Companion |
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. |
DMBD (1) |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Sushmita Gupta, Pallavi Jain 0001, Sanjay Seetharaman |
More Effort Towards Multiagent Knapsack. |
SOFSEM |
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. |
IJCAI |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Mitchell Keegan, Mahdi Abolghasemi |
Approximating Solutions to the Knapsack Problem Using the Lagrangian Dual Framework. |
AI (1) |
2023 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license