Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
12 | Jun Hu, Qingfu Zhang 0001, Yong-Chang Jiao |
A Novel Hybrid Tabu Search Algorithm With Binary Differential Operator for Knapsack Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIS ![In: 16th International Conference on Computational Intelligence and Security, CIS 2020, Nanning, China, November 27-30, 2020, pp. 259-263, 2020, IEEE, 978-1-6654-0445-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI 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) |
ICML ![In: Proceedings of the 37th International Conference on Machine Learning, ICML 2020, 13-18 July 2020, Virtual Event., pp. 4060-4070, 2020, PMLR. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Lu Han, Chunlin Hao, Chenchen Wu, Zhenning Zhang |
Approximation Algorithms for the Lower-Bounded Knapsack Median Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Aspects in Information and Management - 14th International Conference, AAIM 2020, Jinhua, China, August 10-12, 2020, Proceedings, pp. 119-130, 2020, Springer, 978-3-030-57601-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Hanyu Gu |
Optimal Lagrangian Multipliers for the Multidimensional Knapsack Problem: a Bayesian Optimisation Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSCI ![In: 2020 IEEE Symposium Series on Computational Intelligence, SSCI 2020, Canberra, Australia, December 1-4, 2020, pp. 3149-3155, 2020, IEEE, 978-1-7281-2547-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Grigory Yaroslavtsev, Samson Zhou, Dmitrii Avdiukhin |
"Bring Your Own Greedy"+Max: Near-Optimal 1/2-Approximations for Submodular Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AISTATS ![In: The 23rd International Conference on Artificial Intelligence and Statistics, AISTATS 2020, 26-28 August 2020, Online [Palermo, Sicily, Italy], pp. 3263-3274, 2020, PMLR. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP 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) |
AISTATS ![In: The 23rd International Conference on Artificial Intelligence and Statistics, AISTATS 2020, 26-28 August 2020, Online [Palermo, Sicily, Italy], pp. 2273-2283, 2020, PMLR. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
12 | Jiachen Ju, Min Li 0028, Jianxin Liu, Qian Liu, Yang Zhou 0018 |
Nonsubmodular Maximization with Knapsack Constraint via Multilinear Extension. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAAP ![In: Parallel Architectures, Algorithms and Programming - 11th International Symposium, PAAP 2020, Shenzhen, China, December 28-30, 2020, Proceedings, pp. 81-92, 2020, Springer, 978-981-16-0009-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Jingjing Tan, Dongmei Zhang 0002, Hongyang Zhang, Zhenning Zhang |
Streaming Algorithms for Monotone DR-Submodular Maximization Under a Knapsack Constraint on the Integer Lattice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAAP ![In: Parallel Architectures, Algorithms and Programming - 11th International Symposium, PAAP 2020, Shenzhen, China, December 28-30, 2020, Proceedings, pp. 58-67, 2020, Springer, 978-981-16-0009-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Yassine Adouani |
Cooperative Approaches between some Metaheuristics and Integer programming for solving Generalized Multiple Knapsack Problem with Setup and its variants. (Approches coopératives entre certaines métaheuristiques et la programmation en nombres entiers pour résoudre le problème généralisé de sacs à dos multiples avec la configuration et ses variantes). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2020 |
RDF |
|
12 | Soukaina Laabadi |
Metaheuristic approaches for solving packing problems: 0/1 multidimensional knapsack problem and two-dimensional bin packing problem as examples. (Des approches métaheuristiques pour résoudre les problèmes des chargement: Le problème de sac à dos multidimensionnel binaire et le problème du bin packing bidimensionnel). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2020 |
RDF |
|
12 | Keumseok Kang, Kemal Altinkemer, Inkyoung Hur |
Mobile coupons delivery problem: Postponable online multi-constraint knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Decis. Support Syst. ![In: Decis. Support Syst. 116, pp. 13-25, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Mohamed Abdel-Basset, Doaa El-Shahat, Ibrahim M. El-Henawy |
Solving 0-1 knapsack problem by binary flower pollination algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Neural Comput. Appl. ![In: Neural Comput. Appl. 31(9), pp. 5477-5495, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Geng Lin, Jian Guan 0007, Zuoyong Li, Hui-Bin Feng |
A hybrid binary particle swarm optimization with tabu search for the set-union knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expert Syst. Appl. ![In: Expert Syst. Appl. 135, pp. 201-211, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Roman Denysiuk, António Gaspar-Cunha, Alexandre C. B. Delbem |
Neuroevolution for solving multiobjective knapsack problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expert Syst. Appl. ![In: Expert Syst. Appl. 116, pp. 65-77, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Khaled M. Elbassioni, Areg Karapetyan, Trung Thanh Nguyen 0004 |
Approximation schemes for r-weighted Minimization Knapsack problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 279(1-2), pp. 367-386, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Daniel Blado, Alejandro Toriello |
Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Optim. ![In: SIAM J. Optim. 29(1), pp. 1-30, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl |
Interdiction Games and Monotonicity, with Application to Knapsack Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFORMS J. Comput. ![In: INFORMS J. Comput. 31(2), pp. 390-410, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Fenlan Wang |
A new exact algorithm for concave knapsack problems with integer variables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Math. ![In: Int. J. Comput. Math. 96(1), pp. 126-134, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Jingcheng Shen, Kentaro Shigeoka, Fumihiko Ino, Kenichi Hagihara |
GPU-based branch-and-bound method to solve large 0-1 knapsack problems with data-centric strategies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Concurr. Comput. Pract. Exp. ![In: Concurr. Comput. Pract. Exp. 31(4), 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | István Borgulya |
An EDA for the 2D knapsack problem with guillotine constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Central Eur. J. Oper. Res. ![In: Central Eur. J. Oper. Res. 27(2), pp. 329-356, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Christina Büsing, Sebastian Goderbauer, Arie M. C. A. Koster, Manuel Kutschka |
Formulations and algorithms for the recoverable Γ-robust knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EURO J. Comput. Optim. ![In: EURO J. Comput. Optim. 7(1), pp. 15-45, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Harisankar Haridas, Sriram Kailasam, Janakiram Dharanipragada |
Cloudy Knapsack Algorithm for Offloading Tasks from Large Scale Distributed Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Cloud Comput. ![In: IEEE Trans. Cloud Comput. 7(4), pp. 949-963, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Martin S. Engler, Bertrand Caron, Lourens E. Veen, Daan P. Geerke, Alan E. Mark, Gunnar W. Klau |
Automated partial atomic charge assignment for drug-like molecules: a fast knapsack approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithms Mol. Biol. ![In: Algorithms Mol. Biol. 14(1), pp. 1:1-1:10, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Asif Khan 0006, Nadeem Javaid, Adnan Ahmad, Mariam Akbar, Zahoor Ali Khan, Manzoor Ilahi |
A priority-induced demand side management system to mitigate rebound peaks using multiple knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Ambient Intell. Humaniz. Comput. ![In: J. Ambient Intell. Humaniz. Comput. 10(4), pp. 1655-1678, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Jiayang Liu, Jingguo Bi, Songyan Xu |
An Improved Attack on the Basic Merkle-Hellman Knapsack Cryptosystem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 7, pp. 59388-59393, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Xue-Jing Liu, Yi-Chao He |
Estimation of Distribution Algorithm Based on Lévy Flight for Solving the Set-Union Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 7, pp. 132217-132227, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Lian Ye, Jinhang Zheng, Ping Guo 0003, Mario J. Pérez-Jiménez |
Solving the 0-1 Knapsack Problem by Using Tissue P System With Cell Division. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 7, pp. 66055-66067, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Absalom E. Ezugwu, Verosha Pillay, Divyan Hirasen, Kershen Sivanarain, Melvin Govender |
A Comparative Study of Meta-Heuristic Optimization Algorithms for 0 - 1 Knapsack Problem: Some Initial Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 7, pp. 43979-44001, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Xingwang Huang, Peijia Li, Pu Yunming |
Amplitude Angle Modulated Bat Algorithm With Application to Zero-One Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 7, pp. 27957-27969, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Ashis Talukder, Md. Golam Rabiul Alam, Nguyen Hoang Tran, Dusit Niyato, Choong Seon Hong |
Knapsack-Based Reverse Influence Maximization for Target Marketing in Social Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 7, pp. 44182-44198, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Yan Huang 0021, Peng Wang 0033, Jianping Li 0002, Xiuhong Chen, Tao Li |
A Binary Multi-Scale Quantum Harmonic Oscillator Algorithm for 0-1 Knapsack Problem With Genetic Operator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 7, pp. 137251-137265, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Yanhong Feng, Jiao-Hong Yi, Gai-Ge Wang |
Enhanced Moth Search Algorithm for the Set-Union Knapsack Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 7, pp. 173774-173785, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Song Zhang, Sanyang Liu |
A Discrete Improved Artificial Bee Colony Algorithm for 0-1 Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 7, pp. 104982-104991, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Igor Deplano, Danial Yazdani, Trung Thanh Nguyen 0002 |
The Offline Group Seat Reservation Knapsack Problem With Profit on Seats. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 7, pp. 152358-152367, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Imen Ben Mansour, Inès Alaya, Moncef Tagina |
A gradual weight-based ant colony approach for solving the multiobjective multidimensional knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Evol. Intell. ![In: Evol. Intell. 12(2), pp. 253-272, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Abraham P. Punnen, Pooja Pandey, Michael Friesen |
Representations of quadratic combinatorial optimization problems: A case study using quadratic set covering and quadratic knapsack problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 112, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Saloua El Motaki, Ali Yahyaouy, Hamid Gualous, Jalal Sabor |
Comparative study between exact and metaheuristic approaches for virtual machine placement process as knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 75(10), pp. 6239-6259, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Ashish Goel, Anilesh K. Krishnaswamy, Sukolsak Sakshuwong, Tanja Aitamurto |
Knapsack Voting for Participatory Budgeting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Economics and Comput. ![In: ACM Trans. Economics and Comput. 7(2), pp. 8:1-8:27, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Yang Jun Gao, Feng-Ming Zhang, Yu Zhao, Chao Li |
A novel quantum-inspired binary wolf pack algorithm for difficult knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Wirel. Mob. Comput. ![In: Int. J. Wirel. Mob. Comput. 16(3), pp. 222-232, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Sandy Heydrich, Andreas Wiese |
Faster Approximation Schemes for the Two-Dimensional Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 15(4), pp. 47:1-47:28, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | John J. Quiroga-Orozco, José M. Valério de Carvalho, Robinson S. V. Hoto |
A strong integer linear optimization model to the compartmentalized knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. Trans. Oper. Res. ![In: Int. Trans. Oper. Res. 26(5), pp. 1633-1654, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Osvaldo Inarejos, Robinson Hoto, Nelson Maculan |
An integer linear optimization model to the compartmentalized knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. Trans. Oper. Res. ![In: Int. Trans. Oper. Res. 26(5), pp. 1698-1717, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Yasushi Kawase, Hanna Sumita, Takuro Fukunaga |
Submodular Maximization with Uncertain Knapsack Capacity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 33(3), pp. 1121-1145, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Yuichi Yoshida |
Maximizing a Monotone Submodular Function with a Bounded Curvature under a Knapsack Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 33(3), pp. 1452-1471, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Ulrich Pferschy, Gaia Nicosia, Andrea Pacifici |
A Stackelberg knapsack game with weight control. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 799, pp. 149-159, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Frank Gurski, Carolin Rehs, Jochen Rethmann |
Knapsack problems: A parameterized point of view. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 775, pp. 93-108, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Xin Han, Qinyang Chen, Kazuhisa Makino |
Online knapsack problem under concave functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 786, pp. 88-95, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Anis Elgabli, Vaneet Aggarwal |
Deadline and Buffer Constrained Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Circuits Syst. Video Technol. ![In: IEEE Trans. Circuits Syst. Video Technol. 29(5), pp. 1564-1568, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Yuan Ping, Baocang Wang, Shengli Tian, Jingxian Zhou, Hui Ma |
PKCHD: Towards a Probabilistic Knapsack Public-Key Cryptosystem with High Density. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. ![In: Inf. 10(2), pp. 75, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Jialin Li, Wei Li 0078 |
A new quantum evolutionary algorithm using dynamic rotation angle catastrophe for knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Intell. Inf. Database Syst. ![In: Int. J. Intell. Inf. Database Syst. 12(1/2), pp. 109-120, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Frank Gurski, Carolin Rehs |
Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Methods Oper. Res. ![In: Math. Methods Oper. Res. 89(3), pp. 411-432, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Shalin Shah |
GKNAP: A Java and C++ package for solving the multidimensional knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Open Source Softw. ![In: J. Open Source Softw. 4(42), pp. 1756, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Takanori Maehara, So Nakashima, Yutaro Yamaguchi 0001 |
Multiple Knapsack-Constrained Monotone DR-Submodular Maximization on Distributive Lattice - Continuous Greedy Algorithm on Median Complex -. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1907.04279, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
12 | Xin Han, Yasushi Kawase, Kazuhisa Makino, Haruki Yokomaku |
Online Knapsack Problems with a Resource Buffer. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1909.10016, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
12 | Shalin Shah |
Genetic Algorithm for a class of Knapsack Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1903.03494, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
12 | Yue Xie, Oscar Harper, Hirad Assimi, Aneta Neumann, Frank Neumann 0001 |
Evolutionary Algorithms for the Chance-Constrained Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1902.04767, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
12 | Evripidis Bampis, Bruno Escoffier, Alexandre Teiller |
Multistage Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1901.11260, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
12 | Fabrizio Grandoni 0001, Stefan Kratsch, Andreas Wiese |
Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1906.10982, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
12 | Henrique Becker, Luciana S. Buriol |
An empirical analysis of exact algorithms for the unbounded knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1903.08936, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
12 | Ce Jin 0001 |
An Improved FPTAS for 0-1 Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1904.09562, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
12 | Duanshun Li, Jing Liu 0024, Noseong Park, Dongeun Lee 0001, Giridhar Ramachandran, Ali Seyedmazloom, Kookjin Lee, Chen Feng 0002, Vadim Sokolov, Rajesh Ganesan |
Solving Large-Scale 0-1 Knapsack Problems and its Application to Point Cloud Resampling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1906.05929, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
12 | Theofilos Triommatis, Aris Pagourtzis |
Approximate #Knapsack Computations to Count Semi-Fair Allocations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1912.12430, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
12 | Will Ma, David Simchi-Levi, Jinglong Zhao |
A Competitive Analysis of Online Knapsack Problems with Unit Density. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1907.08735, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
12 | Yingdong Lu |
A Stochastic Knapsack Game: Revenue Management in Competitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1909.04609, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
12 | Zhihao Jiang, Haoyu Zhao |
An FPTAS for Stochastic Unbounded Min-Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1903.00547, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
12 | Pierre Dupuy de la Grand'rive, Jean-François Hullo |
Knapsack Problem variants of QAOA for battery revenue optimisation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1908.02210, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP 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) |
CoRR ![In: CoRR abs/1902.00919, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
12 | Zequn Wei, Jin-Kao Hao |
Iterated two-phase local search for the Set-Union Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1903.04966, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
12 | Dmitrii Avdiukhin, Grigory Yaroslavtsev, Samson Zhou |
"Bring Your Own Greedy"+Max: Near-Optimal 1/2-Approximations for Submodular Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1910.05646, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
12 | Fernando A. Morales, Jairo A. Martínez |
On the Implementation and Assessment of several Divide & Conquer Matheuristic Strategies for the solution of the Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1901.01215, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
12 | Christoph Buchheim, Dorothee Henke |
The robust bilevel continuous knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1903.02810, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
12 | Shalin Shah |
Genetic Algorithm for the 0/1 Multidimensional Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1908.08022, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
12 | Dmitrii Avdiukhin, Slobodan Mitrovic, Grigory Yaroslavtsev, Samson Zhou |
Adversarially Robust Submodular Maximization under Knapsack Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1905.02367, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
12 | Ulrich Pferschy, Joachim Schauer, Clemens Thielen |
The Product Knapsack Problem: Approximation and Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1901.00695, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
12 | Liang Feng 0001, Abhishek Gupta 0001, Yew-Soon Ong |
Compressed representation for higher-level meme space evolution: a case study on big knapsack problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Memetic Comput. ![In: Memetic Comput. 11(1), pp. 3-17, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Luis Fernando Plata-González, Iván Amaya, José Carlos Ortiz-Bayliss, Santiago Enrique Conant-Pablos, Hugo Terashima-Marín, Carlos A. Coello Coello |
Evolutionary-based tailoring of synthetic instances for the Knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 23(23), pp. 12711-12728, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Yichao He, Jinghong Wang, Xinlu Zhang, Huanzhe Li, Xuejing Liu |
Encoding transformation-based differential evolution algorithm for solving knapsack problem with single continuous variable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Swarm Evol. Comput. ![In: Swarm Evol. Comput. 50, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Sergei I. Dotsenko |
On a Cooperative Game in the Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Autom. Remote. Control. ![In: Autom. Remote. Control. 80(9), pp. 1734-1744, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Kaiping Luo, Qiuhong Zhao |
A binary grey wolf optimizer for the multidimensional knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Soft Comput. ![In: Appl. Soft Comput. 83, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Kantour Nedjmeddine, Bouroubi Sadek, Chaabane Djamel |
A parallel MOEA with criterion-based selection applied to the Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Soft Comput. ![In: Appl. Soft Comput. 80, pp. 358-373, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Xiangjing Lai, Jin-Kao Hao, Dong Yue 0001 |
Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 274(1), pp. 35-48, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Enrico Malaguti, Michele Monaci, Paolo Paronuzzi, Ulrich Pferschy |
Integer optimization with penalized fractional values: The Knapsack case. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 273(3), pp. 874-888, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Henrique Becker, Luciana S. Buriol |
An empirical analysis of exact algorithms for the unbounded knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 277(1), pp. 84-99, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Mauro Dell'Amico, Maxence Delorme, Manuel Iori, Silvano Martello |
Mathematical models and decomposition methods for the multiple knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 274(3), pp. 886-899, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Vianney Kengne Tchendji, Yannick Florian Yankam |
Dynamic resource allocations in virtual networks through a knapsack problem's dynamic programming solution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ARIMA J. ![In: ARIMA J. 31, pp. 1, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Sunil Chopra, Sangho Shim, Daniel E. Steffy |
A concise characterization of strong knapsack facets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 253, pp. 136-152, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia |
New exact approaches and approximation results for the Penalized Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 253, pp. 122-135, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia |
On approximating the Incremental Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 264, pp. 26-42, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Zequn Wei, Jin-Kao Hao |
Iterated two-phase local search for the Set-Union Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Future Gener. Comput. Syst. ![In: Future Gener. Comput. Syst. 101, pp. 1005-1017, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Fehmi Burcin Özsoydan, Adil Baykasoglu |
A swarm intelligence-based algorithm for the set-union knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Future Gener. Comput. Syst. ![In: Future Gener. Comput. Syst. 93, pp. 560-569, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Ali Naserasadi, Hamid Khosravi, Faramarz Sadeghi |
Extractive multi-document summarization based on textual entailment and sentence compression via knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Nat. Lang. Eng. ![In: Nat. Lang. Eng. 25(1), pp. 121-146, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Fanchao Meng, Dianhui Chu, Keqiu Li, Xuequan Zhou |
Multiple-class multidimensional knapsack optimisation problem and its solution approaches. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Knowl. Based Syst. ![In: Knowl. Based Syst. 166, pp. 1-17, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Rong-juan Luo, Shoufeng Ji, Bao-Lin Zhu |
A Pareto evolutionary algorithm based on incremental learning for a kind of multi-objective multidimensional knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Ind. Eng. ![In: Comput. Ind. Eng. 135, pp. 537-559, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Rahma Lahyani, Khalil Chebil, Mahdi Khemakhem, Leandro C. Coelho |
Matheuristics for solving the Multiple Knapsack Problem with Setup. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Ind. Eng. ![In: Comput. Ind. Eng. 129, pp. 76-89, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Mohamed Abdel-Basset, Doaa El-Shahat, Hossam Faris, Seyedali Mirjalili |
A binary multi-verse optimizer for 0-1 multidimensional knapsack problems with application in interactive multimedia systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Ind. Eng. ![In: Comput. Ind. Eng. 132, pp. 187-206, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Mohamed Abdel-Basset, Doaa El-Shahat, Arun Kumar Sangaiah |
A modified nature inspired meta-heuristic whale optimization algorithm for solving 0-1 knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Mach. Learn. Cybern. ![In: Int. J. Mach. Learn. Cybern. 10(3), pp. 495-514, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Shuqu Qian, Yanmin Liu, Yongqiang Ye, Guofeng Xu |
An enhanced genetic algorithm for constrained knapsack problems in dynamic environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Nat. Comput. ![In: Nat. Comput. 18(4), pp. 913-932, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Romeo Rizzi, Alexandru I. Tomescu |
Faster FPTASes for counting and random generation of Knapsack solutions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 267, pp. 135-144, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Kameng Nip, Zhenbo Wang |
On the approximability of the two-phase knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 38(4), pp. 1155-1179, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
12 | Emir Demirovic, Peter J. Stuckey, James Bailey 0001, Jeffrey Chan, Chris Leckie, Kotagiri Ramamohanarao, Tias Guns |
An Investigation into Prediction + Optimisation for the Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPAIOR ![In: Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 16th International Conference, CPAIOR 2019, Thessaloniki, Greece, June 4-7, 2019, Proceedings, pp. 241-257, 2019, Springer, 978-3-030-19211-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|