Search results for "knapsack"

Hits ?▲	Authors	Title	Venue	Year	Link
12	Mathieu Mari, Timothé Picavet, Michal Pilipczuk	A Parameterized Approximation Scheme for the Geometric Knapsack Problem with Wide Items.	IPEC	2023	DBLP DOI BibTeX RDF
12	Wael Korani	Binary Mother Tree Optimization Algorithm for 0/1 Knapsack Problem.	ICONIP (1)	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.	Neural Comput. Appl.	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.	Expert Syst. Appl.	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.	Asia Pac. J. Oper. Res.	2022	DBLP DOI BibTeX RDF
12	R. Pablo Arribillaga, Gustavo Bergantiños	Cooperative and axiomatic approaches to the knapsack allocation problem.	Ann. Oper. Res.	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.	Comput. Electron. Agric.	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.	J. Mach. Learn. Res.	2022	DBLP BibTeX RDF
12	Endric Daues, Ulf Friedrich	Computing Optimized Path Integrals for Knapsack Feasibility.	INFORMS J. Comput.	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.	Int. J. Emerg. Technol. Learn.	2022	DBLP DOI BibTeX RDF
12	Beytullah Yildiz	Reinforcement learning using fully connected, attention, and transformer models in knapsack problem solving.	Concurr. Comput. Pract. Exp.	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.	Math. Program. Comput.	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.	Oper. Res.	2022	DBLP DOI BibTeX RDF
12	Michele Monaci, Ciara Pike-Burke, Alberto Santini	Exact algorithms for the 0-1 Time-Bomb Knapsack Problem.	Comput. Oper. Res.	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.	J. Supercomput.	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.	Ad Hoc Networks	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.	Int. J. Uncertain. Fuzziness Knowl. Based Syst.	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.	Neural Process. Lett.	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.	J. Oper. Res. Soc.	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.	Int. Trans. Oper. Res.	2022	DBLP DOI BibTeX RDF
12	Yassine Adouani, Bassem Jarboui, Malek Masmoudi	A matheuristic for the 0-1 generalized quadratic multiple knapsack problem.	Optim. Lett.	2022	DBLP DOI BibTeX RDF
12	Hiroshi Fujiwara, Kanaho Hanji, Hiroaki Yamamoto	Online Removable Knapsack Problem for Integer-Sized Unweighted Items.	IEICE Trans. Fundam. Electron. Commun. Comput. Sci.	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.	Symmetry	2022	DBLP DOI BibTeX RDF
12	Yacine Laalaoui, Hedi M'Halla	An exact algorithm for large knapsack sharing problems.	INFOR Inf. Syst. Oper. Res.	2022	DBLP DOI BibTeX RDF
12	Nima Moradi, Vahid Kayvanfar, Majid Rafiee	An efficient population-based simulated annealing algorithm for 0-1 knapsack problem.	Eng. Comput.	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.	Eng. Comput.	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.	IEEE Trans. Cybern.	2022	DBLP DOI BibTeX RDF
12	Sergey Kovalev	Approximation issues of fractional knapsack with penalties: a note.	4OR	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.	Theor. Comput. Sci.	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.	Theor. Comput. Sci.	2022	DBLP DOI BibTeX RDF
12	Shaojie Tang 0001	Beyond pointwise submodularity: Non-monotone adaptive submodular maximization subject to knapsack and k-system constraints.	Theor. Comput. Sci.	2022	DBLP DOI BibTeX RDF
12	Zhongzheng Tang, Chenhao Wang 0001, Hau Chan	Monotone k-submodular secretary problems: Cardinality and knapsack constraints.	Theor. Comput. Sci.	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.	Comput. Electr. Eng.	2022	DBLP DOI BibTeX RDF
12	Trivikram Dokka, Adam N. Letchford, M. Hasan Mansoor	Revisiting surrogate relaxation for the multidimensional knapsack problem.	Oper. Res. Lett.	2022	DBLP DOI BibTeX RDF
12	Zhongzheng Tang, Chenhao Wang 0001, Hau Chan	On maximizing a monotone k-submodular function under a knapsack constraint.	Oper. Res. Lett.	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.	Computación y Sistemas	2022	DBLP BibTeX RDF
12	Evripidis Bampis, Bruno Escoffier, Alexandre Teiller	Multistage knapsack.	J. Comput. Syst. Sci.	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.	J. Comput. Syst. Sci.	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.	Mach. Learn.	2022	DBLP DOI BibTeX RDF
12	Fritz Bökler, Markus Chimani, Mirko H. Wagner	On the rectangular knapsack problem.	Math. Methods Oper. Res.	2022	DBLP DOI BibTeX RDF
12	Steffen Goebbels, Frank Gurski, Dominique Komander	The knapsack problem with special neighbor constraints.	Math. Methods Oper. Res.	2022	DBLP DOI BibTeX RDF
12	Ashish Jain, Manoj Kumar Bohra	Two improved metaheuristic techniques and their applications in automated cryptanalysis of knapsack cryptosystems.	Int. J. Bio Inspired Comput.	2022	DBLP DOI BibTeX RDF
12	Hamza Onoruoiza Salami, Abubakar Bala	An improved chemical reaction optimisation algorithm for the 0-1 knapsack problem.	Int. J. Bio Inspired Comput.	2022	DBLP DOI BibTeX RDF
12	Karl-Ludwig Besser, Eduard A. Jorswieck	QMKPy: A Python Testbed for the Quadratic Multiple Knapsack Problem.	J. Open Source Softw.	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.	J. Artif. Intell. Res.	2022	DBLP DOI BibTeX RDF
12	Christoph Buchheim, Dorothee Henke	The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective.	J. Glob. Optim.	2022	DBLP DOI BibTeX RDF
12	Haoran Zhu	Recognition of Facets for Knapsack Polytope is DP-complete.	CoRR	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.	CoRR	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.	CoRR	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.	CoRR	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.	CoRR	2022	DBLP DOI BibTeX RDF
12	Adel Nikfarjam, Anh Viet Do, Frank Neumann 0001	Analysis of Quality Diversity Algorithms for the Knapsack Problem.	CoRR	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.	CoRR	2022	DBLP DOI BibTeX RDF
12	Joan Boyar, Lene M. Favrholdt, Kim S. Larsen	Online Unit Profit Knapsack with Untrusted Predictions.	CoRR	2022	DBLP DOI BibTeX RDF
12	Sushmita Gupta, Pallavi Jain 0001, Sanjay Seetharaman	More Effort Towards Multiagent Knapsack.	CoRR	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.	CoRR	2022	DBLP BibTeX RDF
12	Congcong Wu, Xiangyun Gao, Xueyong Liu, Bowen Sun	Self-adjusting optimization algorithm for solving the setunion knapsack problem.	CoRR	2022	DBLP BibTeX RDF
12	Andreas Abels, Leon Ladewig, Kevin Schewior, Moritz Stinzendörfer	Knapsack Secretary Through Boosting.	CoRR	2022	DBLP DOI BibTeX RDF
12	Karl Bringmann, Alejandro Cassis	Faster Knapsack Algorithms via Bounded Monotone Min-Plus-Convolution.	CoRR	2022	DBLP DOI BibTeX RDF
12	Sheng Yang 0005, Samir Khuller, Sunav Choudhary, Subrata Mitra, Kanak Mahadik	Correlated Stochastic Knapsack with a Submodular Objective.	CoRR	2022	DBLP DOI BibTeX RDF
12	Karl-Ludwig Besser, Eduard A. Jorswieck	QMKPy: A Python Testbed for the Quadratic Multiple Knapsack Problem.	CoRR	2022	DBLP DOI BibTeX RDF
12	Max Klimm, Martin Knaack	Maximizing a Submodular Function with Bounded Curvature under an Unknown Knapsack Constraint.	CoRR	2022	DBLP DOI BibTeX RDF
12	Isaac Slavitt	Prioritizing municipal lead mitigation projects as a relaxed knapsack optimization: a method and case study.	CoRR	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.	CoRR	2022	DBLP DOI BibTeX RDF
12	Sunhyeon Kwon, Sungsoo Park	Solving Bilevel Knapsack Problem using Graph Neural Networks.	CoRR	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.	CoRR	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.	CoRR	2022	DBLP BibTeX RDF
12	Kai Jin, Danna Zhang, Canhui Zhang	Sum-of-Max Partition under a Knapsack Constraint.	CoRR	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.	Soft Comput.	2022	DBLP DOI BibTeX RDF
12	Sasan Harifi	A binary ancient-inspired Giza Pyramids Construction metaheuristic algorithm for solving 0-1 knapsack problem.	Soft Comput.	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.	Appl. Soft Comput.	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.	Appl. Soft Comput.	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.	Appl. Soft Comput.	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.	Eur. J. Oper. Res.	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.	Eur. J. Oper. Res.	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.	Eur. J. Oper. Res.	2022	DBLP DOI BibTeX RDF
12	Krzysztof Fleszar 0002	A branch-and-bound algorithm for the quadratic multiple knapsack problem.	Eur. J. Oper. Res.	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.	Eur. J. Oper. Res.	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.	Eur. J. Oper. Res.	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.	Eur. J. Oper. Res.	2022	DBLP DOI BibTeX RDF
12	Gleb Beliakov	Knapsack problems with dependencies through non-additive measures and Choquet integral.	Eur. J. Oper. Res.	2022	DBLP DOI BibTeX RDF
12	Wenxin Li 0004, Joohyun Lee, Ness B. Shroff	A faster FPTAS for knapsack problem with cardinality constraint.	Discret. Appl. Math.	2022	DBLP DOI BibTeX RDF
12	Takanori Maehara, So Nakashima, Yutaro Yamaguchi 0001	Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice.	Math. Program.	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.	Discret. Optim.	2022	DBLP DOI BibTeX RDF
12	Franklin Djeumou Fomeni, Konstantinos Kaparis, Adam N. Letchford	A cut-and-branch algorithm for the Quadratic Knapsack Problem.	Discret. Optim.	2022	DBLP DOI BibTeX RDF
12	Yanhong Feng, Gai-Ge Wang	A binary moth search algorithm based on self-learning for multidimensional knapsack problems.	Future Gener. Comput. Syst.	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.	IEICE Trans. Inf. Syst.	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.	Cybern. Syst.	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.	Appl. Intell.	2022	DBLP DOI BibTeX RDF
12	Christoph Buchheim, Dorothee Henke, Jannik Irmai	The Stochastic Bilevel Continuous Knapsack Problem with Uncertain Follower's Objective.	J. Optim. Theory Appl.	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.	IACR Cryptol. ePrint Arch.	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.	Comput. Ind. Eng.	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.	Comput. Ind. Eng.	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.	Algorithms	2022	DBLP DOI BibTeX RDF
12	Yan Zhang, Tengyu Wu, Xiaoyue Ding	Optimization Method of Knapsack Problem Based on BPSO-SA in Logistics Distribution.	J. Inf. Process. Syst.	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.	J. Comb. Optim.	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.	J. Comb. Optim.	2022	DBLP DOI BibTeX RDF
12	Karl-Ludwig Besser, Eduard A. Jorswieck	QMKPy: A Python Testbed for the Quadratic Multiple Knapsack Problem.		2022	DOI RDF
12	Pierre Montalbano, Simon de Givry, George Katsirelos	Multiple-choice Knapsack Constraint in Graphical Models.	CPAIOR	2022	DBLP DOI BibTeX RDF
12	Javier Albert, Dmitri Goldenberg	E-Commerce Promotions Personalization via Online Multiple-Choice Knapsack with Uplift Modeling.	CIKM	2022	DBLP DOI BibTeX RDF