Search results for "Knapsack"

Hits ?▲	Authors	Title	Venue	Year	Link
12	Jéssica Gabriela de Almeida Cunha, Vinícius Loti de Lima, Thiago Alves de Queiroz	Grids for cutting and packing problems: a study in the 2D knapsack problem.	4OR	2020	DBLP DOI BibTeX RDF
12	Dennis Fischer 0001, Gerhard J. Woeginger	A faster algorithm for the continuous bilevel knapsack problem.	Oper. Res. Lett.	2020	DBLP DOI BibTeX RDF
12	Christopher Hojny	Polynomial size IP formulations of knapsack may require exponentially large coefficients.	Oper. Res. Lett.	2020	DBLP DOI BibTeX RDF
12	Dylan Gaspar, Yun Lu 0003, Myung Soon Song, Francis J. Vasko	Simple population-based metaheuristics for the multiple demand multiple-choice multidimensional knapsack problem.	Int. J. Metaheuristics	2020	DBLP DOI BibTeX RDF
12	Reza Refaei Afshar, Yingqian Zhang 0001, Murat Firat, Uzay Kaymak	A State Aggregation Approach for Solving Knapsack Problem with Deep Reinforcement Learning.	CoRR	2020	DBLP BibTeX RDF
12	Yonathan Aflalo, Asaf Noy, Ming Lin, Itamar Friedman, Lihi Zelnik-Manor	Knapsack Pruning with Inner Distillation.	CoRR	2020	DBLP BibTeX RDF
12	Bo Sun 0004, Ali Zeynali, Tongxin Li, Mohammad Hassan Hajiesmaili, Adam Wierman, Danny H. K. Tsang	Competitive Algorithms for the Online Multiple Knapsack Problem with Application to Electric Vehicle Charging.	CoRR	2020	DBLP BibTeX RDF
12	Ivars Dzalbs, Tatiana Kalganova, Ian Dear	Imperialist Competitive Algorithm with Independence and Constrained Assimilation for Solving 0-1 Multidimensional Knapsack Problem.	CoRR	2020	DBLP BibTeX RDF
12	Michael Figelius, Moses Ganardi, Markus Lohrey, Georg Zetzsche	The complexity of knapsack problems in wreath products.	CoRR	2020	DBLP BibTeX RDF
12	Kianté Brantley, Miroslav Dudík, Thodoris Lykouris, Sobhan Miryoosefi, Max Simchowitz, Aleksandrs Slivkins, Wen Sun	Constrained episodic reinforcement learning in concave-convex and knapsack settings.	CoRR	2020	DBLP BibTeX RDF
12	Ali Zeynali, Bo Sun 0004, Mohammad Hassan Hajiesmaili, Adam Wierman	Data-driven Competitive Algorithms for Online Knapsack and Set Cover.	CoRR	2020	DBLP BibTeX RDF
12	Xingwen Zhang, Feng Qi 0005, Zhigang Hua, Shuang Yang	Solving Billion-Scale Knapsack Problems.	CoRR	2020	DBLP BibTeX RDF
12	Ali Aouad, Danny Segev	An Approximate Dynamic Programming Approach to The Incremental Knapsack Problem.	CoRR	2020	DBLP BibTeX RDF
12	Dmitry V. Gribanov	Properties of Δ-modular simplicies and "close" polyhedrons. O(Δ · polylog(Δ))-algorithm for knapsack, proximity and sparsity.	CoRR	2020	DBLP 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.	CoRR	2020	DBLP BibTeX RDF
12	Susanne Albers, Arindam Khan 0001, Leon Ladewig	Improved Online Algorithms for Knapsack and GAP in the Random Order Model.	CoRR	2020	DBLP BibTeX RDF
12	Arturo I. Merino, Andreas Wiese	On the Two-Dimensional Knapsack Problem for Convex Polygons.	CoRR	2020	DBLP BibTeX RDF
12	Luca E. Schäfer, Tobias Dietz, Maria Barbati, José Rui Figueira, Salvatore Greco, Stefan Ruzika	The {0, 1}-knapsack problem with qualitative levels.	CoRR	2020	DBLP BibTeX RDF
12	Yaron Fairstein, Ariel Kulik, Hadas Shachnai	tight approximations for modular and submodular optimization with d-resource multiple knapsack constraints.	CoRR	2020	DBLP BibTeX RDF
12	András Hajdu, György Terdik, Attila Tiba, Henrietta Tomán	A stochastic approach to handle knapsack problems in the creation of ensembles.	CoRR	2020	DBLP BibTeX RDF
12	Deval Patel, Arindam Khan 0001, Anand Louis	Group Fairness for Knapsack Problems.	CoRR	2020	DBLP BibTeX RDF
12	Ashish Goel, Anilesh K. Krishnaswamy, Sukolsak Sakshuwong, Tanja Aitamurto	Knapsack Voting for Participatory Budgeting.	CoRR	2020	DBLP BibTeX RDF
12	Thomas Kesselheim, Marco Molinaro 0001	Knapsack Secretary with Bursty Adversary.	CoRR	2020	DBLP BibTeX RDF
12	Waleed Bin Owais, Iyad W. J. Alkhazendar, Mohammad Saleh	Evaluating the impact of different types of crossover and selection methods on the convergence of 0/1 Knapsack using Genetic Algorithm.	CoRR	2020	DBLP BibTeX RDF
12	Francisco Castillo-Zunino, Pinar Keskinocak	Bi-Criteria Multiple Knapsack Problem with Grouped Items.	CoRR	2020	DBLP BibTeX RDF
12	Jing Tang 0004, Xueyan Tang, Andrew Lim 0001, Kai Han 0003, Chongshou Li, Junsong Yuan	Revisiting Modified Greedy Algorithm for Monotone Submodular Maximization with a Knapsack Constraint.	CoRR	2020	DBLP BibTeX RDF
12	Hans-Joachim Böckenhauer, Jan Dreier, Fabian Frei, Peter Rossmanith	Advice for Online Knapsack With Removable Items.	CoRR	2020	DBLP BibTeX RDF
12	Hans-Joachim Böckenhauer, Elisabet Burjons, Juraj Hromkovic, Henri Lotze, Peter Rossmanith	Online Simple Knapsack with Reservation Costs.	CoRR	2020	DBLP BibTeX RDF
12	Ying Cao 0007, Bo Sun 0004, Danny H. K. Tsang	Optimal Online Algorithms for One-Way Trading and Online Knapsack Problems: A Unified Competitive Analysis.	CoRR	2020	DBLP BibTeX RDF
12	Xiaoming Sun 0001, Jialin Zhang 0001, Zhijie Zhang	Tight Algorithms for the Submodular Multiple Knapsack Problem.	CoRR	2020	DBLP BibTeX RDF
12	Lauren Pusey-Nazzaro, Prasanna Date	Adiabatic Quantum Optimization Fails to Solve the Knapsack Problem.	CoRR	2020	DBLP BibTeX RDF
12	Martin Böhm 0001, Franziska Eberle, Nicole Megow, Lukas Nölke, Jens Schlöter, Bertrand Simon 0001, Andreas Wiese	Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time.	CoRR	2020	DBLP BibTeX RDF
12	Hirad Assimi, Oscar Harper, Yue Xie, Aneta Neumann, Frank Neumann 0001	Evolutionary Bi-objective Optimization for the Dynamic Chance-Constrained Knapsack Problem Based on Tail Bound Objectives.	CoRR	2020	DBLP BibTeX RDF
12	Yue Xie, Aneta Neumann, Frank Neumann 0001	Specific Single- and Multi-Objective Evolutionary Algorithms for the Chance-Constrained Knapsack Problem.	CoRR	2020	DBLP BibTeX RDF
12	Yuri Faenza, Danny Segev, Lingyi Zhang	Approximation Algorithms for The Generalized Incremental Knapsack Problem.	CoRR	2020	DBLP BibTeX RDF
12	Christoph Hertrich, Martin Skutella	Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size.	CoRR	2020	DBLP BibTeX RDF
12	Vahid Roostapour, Aneta Neumann, Frank Neumann 0001	Evolutionary Multi-Objective Optimization for the Dynamic Knapsack Problem.	CoRR	2020	DBLP 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.	CoRR	2020	DBLP BibTeX RDF
12	Yaron Fairstein, Ariel Kulik, Joseph Naor, Danny Raz, Hadas Shachnai	A (1-e-1-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem.	CoRR	2020	DBLP BibTeX RDF
12	Fernando A. Morales, Jairo A. Martínez	Expected Performance and Worst Case Scenario Analysis of the Divide-and-Conquer Method for the 0-1 Knapsack Problem.	CoRR	2020	DBLP BibTeX RDF
12	Denise D. Tönissen, Loe Schlicher	Using 3D-printing in disaster response: The two-stage stochastic 3D-printing knapsack problem.	CoRR	2020	DBLP BibTeX RDF
12	Marcin Bienkowski, Maciej Pacut, Krzysztof Piecuch	An Optimal Algorithm for Online Multiple Knapsack.	CoRR	2020	DBLP BibTeX RDF
12	Shi-hua Zhan, Lijin Wang, Ze-Jun Zhang, Yiwen Zhong	Noising methods with hybrid greedy repair operator for 0-1 knapsack problem.	Memetic Comput.	2020	DBLP DOI BibTeX RDF
12	Congcong Wu, Yichao He	Solving the set-union knapsack problem by a novel hybrid Jaya algorithm.	Soft Comput.	2020	DBLP DOI BibTeX RDF
12	Huihong Wu, Shuqu Qian, Yanmin Liu, Dong Wang, Benhua Guo	An immune-based response particle swarm optimizer for knapsack problems in dynamic environments.	Soft Comput.	2020	DBLP DOI BibTeX RDF
12	Layane Rodrigues de Souza Queiroz, Marina Andretta	Two effective methods for the irregular knapsack problem.	Appl. Soft Comput.	2020	DBLP DOI BibTeX RDF
12	Peter Goos, U. Syafitri, Bagus Sartono, Alan R. Vazquez	A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments.	Eur. J. Oper. Res.	2020	DBLP DOI BibTeX RDF
12	Thomas Setzer, Sebastian M. Blanc	Empirical orthogonal constraint generation for Multidimensional 0/1 Knapsack Problems.	Eur. J. Oper. Res.	2020	DBLP DOI BibTeX RDF
12	Marcia Helena Costa Fampa, D. Lubke, Fei Wang 0043, Henry Wolkowicz	Parametric convex quadratic relaxation of the quadratic knapsack problem.	Eur. J. Oper. Res.	2020	DBLP DOI BibTeX RDF
12	Thomas Setzer, Sebastian M. Blanc	Corrigendum to "Empirical Orthogonal Constraint Generation for Multidimensional 0/1 Knapsack Problems".	Eur. J. Oper. Res.	2020	DBLP DOI BibTeX RDF
12	Federico Della Croce, Rosario Scatamacchia	An exact approach for the bilevel knapsack problem with interdiction constraints and extensions.	Math. Program.	2020	DBLP DOI BibTeX RDF
12	Iskander Aliev, Martin Henk, Timm Oertel	Distances to lattice points in knapsack polyhedra.	Math. Program.	2020	DBLP DOI BibTeX RDF
12	Ya Li, Yichao He, Xuejing Liu, Xiaohu Guo, Zewen Li	A novel discrete whale optimization algorithm for solving knapsack problems.	Appl. Intell.	2020	DBLP DOI BibTeX RDF
12	Congcong Wu, Jianli Zhao, Yanhong Feng, Malrey Lee	"Solving discounted {0-1} knapsack problems by a discrete hybrid teaching-learning-based optimization algorithm".	Appl. Intell.	2020	DBLP DOI BibTeX RDF
12	Chiranjit Changdar, Rajat Kumar Pal, Ghanshaym Singha Mahapatra, Abhinandan Khan	A genetic algorithm based approach to solve multi-resource multi-objective knapsack problem for vegetable wholesalers in fuzzy environment.	Oper. Res.	2020	DBLP DOI BibTeX RDF
12	José García 0002, Eduardo Lalla-Ruiz, Stefan Voß 0001, Enrique López Droguett	Enhancing a machine learning binarization framework by perturbation operators: analysis on the multidimensional knapsack problem.	Int. J. Mach. Learn. Cybern.	2020	DBLP DOI BibTeX RDF
12	Fernando A. Morales, Jairo A. Martínez	Analysis of Divide-and-Conquer strategies for the 0-1 minimization knapsack problem.	J. Comb. Optim.	2020	DBLP DOI BibTeX RDF
12	Jakub Lojda, Jakub Podivinsky, Ondrej Cekan, Richard Panek, Martin Krcma, Zdenek Kotásek	Automatic Design of Reliable Systems Based on the Multiple-choice Knapsack Problem.	DDECS	2020	DBLP DOI BibTeX RDF
12	Yuri da Silva Villas Boas, Daniel Santana Rocha, Charles F. de Barros, Jean Everson Martina	F2MH Cryptosystem: Preliminary analysis of an original attempt to revive Knapsack-based public-key encryption schemes.	PDP	2020	DBLP DOI BibTeX RDF
12	Gerhard Hasslinger, Konstantinos Ntougias, Frank Hasslinger, Oliver Hohlfeld	General Knapsack Bounds of Web Caching Performance Regarding the Properties of each Cacheable Object.	Networking	2020	DBLP BibTeX RDF
12	Yan Wang, Min Wang, Jia Li, Xiang Xu	Comparison of genetic algorithm and dynamic programming solving knapsack problem.	ACAI	2020	DBLP DOI BibTeX RDF
12	Xingwen Zhang, Feng Qi 0005, Zhigang Hua, Shuang Yang	Solving Billion-Scale Knapsack Problems.	WWW	2020	DBLP DOI BibTeX RDF
12	Saúl Zapotecas Martínez, Adriana Menchaca-Méndez	On the Performance of Generational and Steady-State MOEA/D in the Multi-Objective 0/1 Knapsack Problem.	CEC	2020	DBLP DOI BibTeX RDF
12	Xavier Sánchez 0001, José Carlos Ortiz-Bayliss, Iván Amaya, Jorge M. Cruz-Duarte, Santiago Enrique Conant-Pablos, Hugo Terashima-Marín	A Preliminary Study on Feature-independent Hyper-heuristics for the 0/1 Knapsack Problem.	CEC	2020	DBLP DOI BibTeX RDF
12	Arij Mkaouar, Skander Htiouech, Habib Chabchoub	Solving the Multiple choice Multidimensional Knapsack problem with ABC algorithm.	CEC	2020	DBLP DOI BibTeX RDF
12	Jianping Dong, Haina Rong, Ferrante Neri, Qiang Yang, Ming Zhu, Gexiang Zhang	An Adaptive Memetic P System to Solve the 0/1 Knapsack Problem.	CEC	2020	DBLP DOI BibTeX RDF
12	Frumen Olivas, Iván Amaya, José Carlos Ortiz-Bayliss, Santiago E. Conant-Pablos, Hugo Terashima-Marín	A Fuzzy Hyper-Heuristic Approach for the 0-1 Knapsack Problem.	CEC	2020	DBLP DOI BibTeX RDF
12	Theofilos Triommatis, Aris Pagourtzis	Approximate #Knapsack Computations to Count Semi-fair Allocations.	TAMC	2020	DBLP DOI BibTeX RDF
12	Kanaho Hanji, Hiroshi Fujiwara, Hiroaki Yamamoto	Online Removable Knapsack Problems for Integer-Sized Items.	TAMC	2020	DBLP DOI BibTeX RDF
12	Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz, Hadas Shachnai	A (1-e-1-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem.	ESA	2020	DBLP DOI BibTeX RDF
12	Arturo I. Merino, Andreas Wiese	On the Two-Dimensional Knapsack Problem for Convex Polygons.	ICALP	2020	DBLP DOI BibTeX RDF
12	Thomas Kesselheim, Marco Molinaro 0001	Knapsack Secretary with Bursty Adversary.	ICALP	2020	DBLP DOI BibTeX RDF
12	Michael Figelius, Moses Ganardi, Markus Lohrey, Georg Zetzsche	The Complexity of Knapsack Problems in Wreath Products.	ICALP	2020	DBLP DOI BibTeX RDF
12	Marcin Bienkowski, Maciej Pacut, Krzysztof Piecuch	An Optimal Algorithm for Online Multiple Knapsack.	ICALP	2020	DBLP DOI BibTeX RDF
12	Reza Refaei Afshar, Yingqian Zhang 0001, Murat Firat, Uzay Kaymak	A State Aggregation Approach for Solving Knapsack Problem with Deep Reinforcement Learning.	ACML	2020	DBLP BibTeX RDF
12	Ying Cao 0007, Bo Sun 0004, Danny H. K. Tsang	Optimal Online Algorithms for One-Way Trading and Online Knapsack Problems: A Unified Competitive Analysis.	CDC	2020	DBLP DOI BibTeX RDF
12	Jingyi Sun, Aijing Li, Lei Zhang, Zhen Qin, Zichao Qin	A MAB-Based Knapsack Algorithm for Coexistence of LTE/WiFi in Resource Allocation Optimization.	ICCT	2020	DBLP DOI BibTeX RDF
12	Markus Lohrey, Georg Zetzsche	Knapsack and the Power Word Problem in Solvable Baumslag-Solitar Groups.	MFCS	2020	DBLP DOI BibTeX RDF
12	Thiago Fialho de Queiroz Lafetá, Gina Maira Barbosa de Oliveira	Applying Dynamic Evolutionary Optimization to the Multiobjective Knapsack Problem.	BRACIS	2020	DBLP DOI BibTeX RDF
12	Raffaele Cerulli, Ciriaco D'Ambrosio, Andrea Raiconi, Gaetano Vitale	The Knapsack Problem with Forfeits.	ISCO	2020	DBLP DOI BibTeX RDF
12	Nitin Yadav, Carsten Murawski, Sebastian Sardiña, Peter Bossaerts	Is Hardness Inherent in Computational Problems? Performance of Human and Electronic Computers on Random Instances of the 0-1 Knapsack Problem.	ECAI	2020	DBLP DOI BibTeX RDF
12	Nawal Benabbou, Cassandre Leroy, Thibaut Lust	Regret-Based Elicitation for Solving Multi-Objective Knapsack Problems with Rank-Dependent Aggregators.	ECAI	2020	DBLP DOI BibTeX RDF
12	Hirad Assimi, Oscar Harper, Yue Xie, Aneta Neumann, Frank Neumann 0001	Evolutionary Bi-Objective Optimization for the Dynamic Chance-Constrained Knapsack Problem Based on Tail Bound Objectives.	ECAI	2020	DBLP DOI BibTeX RDF
12	Jocelyn Poncelet, Pierre-Antoine Jean, Michel Vasquez, Jacky Montmain	Hierarchical Reasoning and Knapsack Problem Modelling to Design the Ideal Assortment in Retail.	IPMU (1)	2020	DBLP DOI BibTeX RDF
12	Yue Xie, Aneta Neumann, Frank Neumann 0001	Specific single- and multi-objective evolutionary algorithms for the chance-constrained knapsack problem.	GECCO	2020	DBLP DOI BibTeX RDF
12	Suriya Phongmoo, Komgrit Leksakul, Pongsawat Premphet	Artificial Bee Colony for Solving Multi-Objectives Three-Dimensional Knapsack Problem.	ICGDA	2020	DBLP DOI BibTeX RDF
12	Yuri da Silva Villas Boas, Daniel Santana Rocha, Charles F. de Barros, Jean Everson Martina	SRVB cryptosystem: another attempt to revive Knapsack-based public-key encryption schemes.	ICT	2020	DBLP DOI BibTeX RDF
12	Wenxin Li 0004, Joohyun Lee, Ness B. Shroff	A Faster FPTAS for Knapsack Problem with Cardinality Constraint.	WAOA	2020	DBLP DOI BibTeX RDF
12	Mhand Hifi, Amir Mohamed-Youssouf, Toufik Saadi, Labib Yousef	A Cooperative Swarm Optimization-Based Algorithm for the Quadratic Multiple Knapsack Problem.	CoDIT	2020	DBLP DOI BibTeX RDF
12	Isma Dahmani, Meriem Ferroum, Mhand Hifi, Shohre Sadeghsa	A Hybrid Swarm Optimization-Based Algorithm for the Set-Union Knapsack Problem.	CoDIT	2020	DBLP DOI BibTeX RDF
12	Yoshikata Nakano, Akihiro Fujiwara	An asynchronous P system with branch and bound for solving the knapsack problem.	CANDAR (Workshops)	2020	DBLP DOI BibTeX RDF
12	Camilo Vásquez, José Lemus-Romani, Broderick Crawford, Ricardo Soto 0001, Gino Astorga, Wenceslao Palma, Sanjay Misra, Fernando Paredes	Solving the 0/1 Knapsack Problem Using a Galactic Swarm Optimization with Data-Driven Binarization Approaches.	ICCSA (6)	2020	DBLP DOI BibTeX RDF
12	Marek Galinski, Juraj Volko, Ivan Kotuliak	Enhanced approach on solving Online Knapsack Problem to improve Load Balancing.	TSP	2020	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.	NeurIPS	2020	DBLP BibTeX RDF
12	Kianté Brantley, Miroslav Dudík, Thodoris Lykouris, Sobhan Miryoosefi, Max Simchowitz, Aleksandrs Slivkins, Wen Sun	Constrained episodic reinforcement learning in concave-convex and knapsack settings.	NeurIPS	2020	DBLP BibTeX RDF
12	Lorena Jorquera, Gabriel Villavicencio, Leonardo Causa, Luis Lopez, Andrés Fernández	A Binary Bat Algorithm Applied to Knapsack Problem.	CSOC (2)	2020	DBLP DOI BibTeX RDF
12	Hernan Pinto, Alvaro Peña, Leonardo Causa, Matías Valenzuela, Gabriel Villavicencio	A K-means Grasshopper Algorithm Applied to the Knapsack Problem.	CSOC (2)	2020	DBLP DOI BibTeX RDF
12	Vani Suthamathi Saravanarajan, Rung-Ching Chen, Christine Dewi, Long-Sheng Chen	Montecarlo Approach For Solving Unbound Knapsack Problem.	MISNC/IEMT	2020	DBLP DOI BibTeX RDF
12	Tarequl Islam Sifat, Nirmal Prajapati, Sanjay V. Rajopadhye	Revisiting Sparse Dynamic Programming for the 0/1 Knapsack Problem.	ICPP	2020	DBLP DOI BibTeX RDF
12	Usman Ali, Usman Qamar, Kanwal Wahab, Khawaja Sarmad Arif	A Knapsack Problem Based Algorithm for Local Level Management in Smart Grid.	EIDWT	2020	DBLP DOI BibTeX RDF