Search results for "knapsack"

Hits ?▲	Authors	Title	Venue	Year	Link
12	Mobolaji Williams	Large N limit of the knapsack problem.	CoRR	2021	DBLP BibTeX RDF
12	Jakob Bossek, Aneta Neumann, Frank Neumann 0001	Exact Counting and Sampling of Optima for the Knapsack Problem.	CoRR	2021	DBLP BibTeX RDF
12	Christoph Buchheim, Dorothee Henke, Jannik Irmai	The stochastic bilevel continuous knapsack problem with uncertain follower's objective.	CoRR	2021	DBLP BibTeX RDF
12	Zuguang Gao, John R. Birge, Varun Gupta 0004	Approximation Schemes for Multiperiod Binary Knapsack Problems.	CoRR	2021	DBLP BibTeX RDF
12	Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi 0001, Alberto Marchetti-Spaccamela, Rebecca Reiffenhäuser	Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity.	CoRR	2021	DBLP BibTeX RDF
12	Sean A. Mochocki, Gary B. Lamont, Robert C. Leishman, Kyle Kauffman	Multi-objective database queries in combined knapsack and set covering problem domains.	J. Big Data	2021	DBLP DOI BibTeX RDF
12	Jiawei Yuan, Yifan Li	Solving binary multi-objective knapsack problems with novel greedy strategy.	Memetic Comput.	2021	DBLP DOI BibTeX RDF
12	Isma Dahmani, Meriem Ferroum, Mhand Hifi	An iterative rounding strategy-based algorithm for the set-union knapsack problem.	Soft Comput.	2021	DBLP DOI BibTeX RDF
12	Yichao He, Xiang Hao, Wenbin Li, Qinglei Zhai	Binary team game algorithm based on modulo operation for knapsack problem with a single continuous variable.	Appl. Soft Comput.	2021	DBLP DOI BibTeX RDF
12	José García 0002, Carlos Maureira	A KNN quantum cuckoo search algorithm applied to the multidimensional knapsack problem.	Appl. Soft Comput.	2021	DBLP DOI BibTeX RDF
12	Zequn Wei, Jin-Kao Hao	Multistart solution-based tabu search for the Set-Union Knapsack Problem.	Appl. Soft Comput.	2021	DBLP DOI BibTeX RDF
12	Luca E. Schäfer, Tobias Dietz, Maria Barbati, José Rui Figueira, Salvatore Greco, Stefan Ruzika	The binary knapsack problem with qualitative levels.	Eur. J. Oper. Res.	2021	DBLP DOI BibTeX RDF
12	Simona Mancini, Michele Ciavotta, Carlo Meloni	The Multiple Multidimensional Knapsack with Family-Split Penalties.	Eur. J. Oper. Res.	2021	DBLP DOI BibTeX RDF
12	Ulrich Pferschy, Gaia Nicosia, Andrea Pacifici, Joachim Schauer	On the Stackelberg knapsack game.	Eur. J. Oper. Res.	2021	DBLP DOI BibTeX RDF
12	François Clautiaux, Boris Detienne, G. Guillot	An iterative dynamic programming approach for the temporal knapsack problem.	Eur. J. Oper. Res.	2021	DBLP DOI BibTeX RDF
12	Laura Galli, Silvano Martello, Carlos Rey 0001, Paolo Toth	Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem.	Eur. J. Oper. Res.	2021	DBLP DOI BibTeX RDF
12	Stefano Coniglio, Fabio Furini, Pablo San Segundo	A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts.	Eur. J. Oper. Res.	2021	DBLP DOI BibTeX RDF
12	Man Ding, Congying Han, Tiande Guo	High generalization performance structured self-attention model for knapsack problem.	Discret. Math. Algorithms Appl.	2021	DBLP DOI BibTeX RDF
12	Qiang Xu	0-1 Knapsack problem driven resource scheduling in caching-enabled network: A case study on sports video.	Internet Technol. Lett.	2021	DBLP DOI BibTeX RDF
12	Yichao He, Xizhao Wang	Group theory-based optimization algorithm for solving knapsack problems.	Knowl. Based Syst.	2021	DBLP DOI BibTeX RDF
12	Francisco Castillo-Zunino, Pinar Keskinocak	Bi-criteria multiple knapsack problem with grouped items.	J. Heuristics	2021	DBLP DOI BibTeX RDF
12	Lin Wang, Ronghua Shi, Jian Dong	A Hybridization of Dragonfly Algorithm Optimization and Angle Modulation Mechanism for 0-1 Knapsack Problems.	Entropy	2021	DBLP DOI BibTeX RDF
12	Frumen Olivas, Iván Amaya, José Carlos Ortiz-Bayliss, Santiago E. Conant-Pablos, Hugo Terashima-Marín	Enhancing Hyperheuristics for the Knapsack Problem through Fuzzy Logic.	Comput. Intell. Neurosci.	2021	DBLP DOI BibTeX RDF
12	Md. Zulfikar Alom, Bikash Chandra Singh, Zeyar Aung, Mohammad Abdul Azim	Knapsack graph-based privacy checking for smart environments.	Comput. Secur.	2021	DBLP DOI BibTeX RDF
12	Thekra Al Douri, Mhand Hifi, Vassilis Zissimopoulos	An iterative algorithm for the Max-Min knapsack problem with multiple scenarios.	Oper. Res.	2021	DBLP DOI BibTeX RDF
12	Mohamed Abdel-Basset, Reda Mohamed, Seyedali Mirjalili	A Binary Equilibrium Optimization Algorithm for 0-1 Knapsack Problems.	Comput. Ind. Eng.	2021	DBLP DOI BibTeX RDF
12	Ali Amiri 0001, Reza Barkhi	A Lagrangean based solution algorithm for the multiple knapsack problem with setups.	Comput. Ind. Eng.	2021	DBLP DOI BibTeX RDF
12	Mohamed Abdel-Basset, Reda Mohamed, Karam M. Sallam, Ripon K. Chakrabortty, Michael J. Ryan	BSMA: A novel metaheuristic algorithm for multi-dimensional knapsack problems: Method and comprehensive analysis.	Comput. Ind. Eng.	2021	DBLP DOI BibTeX RDF
12	Mohamed Abdel-Basset, Reda Mohamed, Ripon Kumar Chakrabortty, Michael J. Ryan, Seyedali Mirjalili	New binary marine predators optimization algorithms for 0-1 knapsack problems.	Comput. Ind. Eng.	2021	DBLP DOI BibTeX RDF
12	Zewen Li, Yichao He, Ya Li, Xiaohu Guo	A hybrid grey wolf optimizer for solving the product knapsack problem.	Int. J. Mach. Learn. Cybern.	2021	DBLP DOI BibTeX RDF
12	Enrico Bartolini, Dominik Goeke, Michael Schneider 0004, Mengdie Ye	The Robust Traveling Salesman Problem with Time Windows Under Knapsack-Constrained Travel Time Uncertainty.	Transp. Sci.	2021	DBLP DOI BibTeX RDF
12	Shaojie Tang 0001	Beyond Pointwise Submodularity: Non-monotone Adaptive Submodular Maximization Subject to Knapsack and k-System Constraints.	MCO	2021	DBLP DOI BibTeX RDF
12	Sameh Al-Shihabi	Optimizing a Binary Integer Program by Identifying Its Optimal Core Problem - A New Optimization Concept Applied to the Multidimensional Knapsack Problem.	MCO	2021	DBLP DOI BibTeX RDF
12	Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu	Multi-cover Inequalities for Totally-Ordered Multiple Knapsack Sets.	IPCO	2021	DBLP DOI BibTeX RDF
12	Hanyu Gu, Alireza Etminaniesfahani, Amir Salehipour	A Bayesian Optimisation Approach for Multidimensional Knapsack Problem.	OLA	2021	DBLP DOI BibTeX RDF
12	Samah Boukhari, Isma Dahmani, Mhand Hifi	Computational Power of a Hybrid Algorithm for Solving the Multiple Knapsack Problem with Setup.	SAI (1)	2021	DBLP DOI BibTeX RDF
12	Stefka Fidanova, Maria Ganzha, Olympia Roeva	InterCriteria Analyzis of Hybrid Ant Colony Optimization Algorithm for Multiple Knapsack Problem.	FedCSIS	2021	DBLP DOI BibTeX RDF
12	Bharat Agarwal, Mohammed Amine Togou, Marco Ruffini, Gabriel-Miro Muntean	PIRS3A: A Low Complexity Multi-knapsack-based Approach for User Association and Resource Allocation in HetNets.	ICC Workshops	2021	DBLP DOI BibTeX RDF
12	Yaron Fairstein, Ariel Kulik, Hadas Shachnai	Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping.	ESA	2021	DBLP DOI BibTeX RDF
12	Adam Polak 0001, Lars Rohwedder, Karol Wegrzycki	Knapsack and Subset Sum with Small Items.	ICALP	2021	DBLP DOI BibTeX RDF
12	Tianshuai Zhu, Kai Han 0003, Enpei Zhang, Benwei Wu	A Dynamic Algorithm for Submodular Maximization with a Knapsack Constraint.	HPCC/DSS/SmartCity/DependSys	2021	DBLP DOI BibTeX RDF
12	Arindam Khan 0001, Arnab Maiti, Amatya Sharma, Andreas Wiese	On Guillotine Separable Packings for the Two-Dimensional Geometric Knapsack Problem.	SoCG	2021	DBLP DOI BibTeX RDF
12	Waldo Gálvez, Fabrizio Grandoni 0001, Arindam Khan 0001, Diego Ramírez-Romero, Andreas Wiese	Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More.	SoCG	2021	DBLP DOI BibTeX RDF
12	Teddy Nurcahyadi, Christian Blum 0001	Negative Learning in Ant Colony Optimization: Application to the Multi Dimensional Knapsack Problem.	ISMSI	2021	DBLP DOI BibTeX RDF
12	Kai Han 0003, Shuang Cui, Tianshuai Zhu, Enpei Zhang, Benwei Wu, Zhizhuo Yin, Tong Xu 0001, Shaojie Tang 0001, He Huang 0001	Approximation Algorithms for Submodular Data Summarization with a Knapsack Constraint.	SIGMETRICS (Abstracts)	2021	DBLP DOI 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.	SIGMETRICS (Abstracts)	2021	DBLP DOI 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.	SIGMETRICS (Abstracts)	2021	DBLP DOI BibTeX RDF
12	Akansha Singh, P. Meghana Reddy, Shweta Jain 0002, Sujit Gujar	Designing Bounded Min-Knapsack Bandits Algorithm for Sustainable Demand Response.	PRICAI (1)	2021	DBLP DOI BibTeX RDF
12	Jakob Bossek, Aneta Neumann, Frank Neumann 0001	Exact Counting and Sampling of Optima for the Knapsack Problem.	LION	2021	DBLP DOI BibTeX RDF
12	Dmitriy V. Gribanov	An FPTAS for the Δ-Modular Multidimensional Knapsack Problem.	MOTOR	2021	DBLP DOI BibTeX RDF
12	Ali Zeynali, Bo Sun 0004, Mohammad Hassan Hajiesmaili, Adam Wierman	Data-driven Competitive Algorithms for Online Knapsack and Set Cover.	AAAI	2021	DBLP DOI BibTeX RDF
12	Christoph Hertrich, Martin Skutella	Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size.	AAAI	2021	DBLP DOI BibTeX RDF
12	Lin Wang, Ronghua Shi, Wenyu Li, Xia Yuan, Jian Dong	An Improved Dragonfly Algorithm Based on Angle Modulation Mechanism for Solving 0-1 Knapsack Problems.	ICSI (1)	2021	DBLP DOI BibTeX RDF
12	Zuguang Gao, John R. Birge, Varun Gupta 0004	Approximation Schemes for Multiperiod Binary Knapsack Problems.	CSR	2021	DBLP DOI BibTeX RDF
12	Chi-Yo Huang, Ying-Ting Kuo, Liang-Chieh Wang, Yi-Hao Hsiao, Chia-Lee Yang	Technology Roadmapping for the GAA-FETs Based on the Methods of Patent Mining, Fuzzy Knapsack Problem, and Fuzzy Competence Set Expansion.	iFUZZY	2021	DBLP DOI BibTeX RDF
12	Jakob Bossek, Aneta Neumann, Frank Neumann 0001	Breeding diverse packings for the knapsack problem by means of diversity-tailored evolutionary algorithms.	GECCO	2021	DBLP DOI BibTeX RDF
12	Xinhua Yang, Yufan Zhou, Ailing Shen, Juan Lin 0001, Yiwen Zhong	A hybrid ant colony optimization algorithm for the knapsack problem with a single continuous variable.	GECCO	2021	DBLP DOI BibTeX RDF
12	Yue Xie, Aneta Neumann, Frank Neumann 0001, Andrew M. Sutton	Runtime analysis of RLS and the (1+1) EA for the chance-constrained knapsack problem with correlated uniform weights.	GECCO	2021	DBLP DOI BibTeX RDF
12	Wim van Dam, Karim Eldefrawy, Nicholas Genise, Natalie Parham	Quantum Optimization Heuristics with an Application to Knapsack Problems.	QCE	2021	DBLP DOI BibTeX RDF
12	Menglu Yu, Chuan Wu 0001, Bo Ji 0001, Jia Liu 0002	A Sum-of-Ratios Multi-Dimensional-Knapsack Decomposition for DNN Resource Scheduling.	INFOCOM	2021	DBLP DOI BibTeX RDF
12	Jingjing Tan, Yicheng Xu, Dongmei Zhang 0002, Xiaoqing Zhang	Maximizing the Sum of a Supermodular Function and a Monotone DR-submodular Function Subject to a Knapsack Constraint on the Integer Lattice.	CSoNet	2021	DBLP DOI BibTeX RDF
12	Wenrong Jiang	Research on the Recommendation Algorithm Based on 0-1 Knapsack Problem.	CONF-CDS	2021	DBLP DOI BibTeX RDF
12	Hans-Joachim Böckenhauer, Elisabet Burjons, Juraj Hromkovic, Henri Lotze, Peter Rossmanith	Online Simple Knapsack with Reservation Costs.	STACS	2021	DBLP DOI BibTeX RDF
12	Pascal Bergsträßer, Moses Ganardi, Georg Zetzsche	A Characterization of Wreath Products Where Knapsack Is Decidable.	STACS	2021	DBLP DOI BibTeX RDF
12	Jeff Giliberti, Andreas Karrenbauer	Improved Online Algorithm for Fractional Knapsack in the Random Order Model.	WAOA	2021	DBLP DOI BibTeX RDF
12	Yann Disser, Max Klimm, David Weckbecker	Fractionally Subadditive Maximization Under an Incremental Knapsack Constraint.	WAOA	2021	DBLP DOI BibTeX RDF
12	Soh Kumabe, Takanori Maehara	Prophet Secretary for k-Knapsack and l-Matroid Intersection via Continuous Exchange Property.	IWOCA	2021	DBLP DOI BibTeX RDF
12	Sungjin Im, Ravi Kumar 0001, Mahshid Montazer Qaem, Manish Purohit	Online Knapsack with Frequency Predictions.	NeurIPS	2021	DBLP BibTeX RDF
12	Jingjing Tan, Fengmin Wang, Xiaoqing Zhang, Yang Zhou 0018	Maximization of Monotone Non-submodular Functions with a Knapsack Constraint over the Integer Lattice.	COCOA	2021	DBLP DOI BibTeX RDF
12	Alaidine Ben Ayed, Ismaïl Biskri, Jean-Guy Meunier	Arabic text summarization via Knapsack balancing of effective retention.	ACLING	2021	DBLP DOI BibTeX RDF
12	Steffen Goebbels, Frank Gurski, Dominique Komander	The Knapsack Problem with Special Neighbor Constraints on Directed Co-graphs.	OR	2021	DBLP DOI BibTeX RDF
12	Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz	General Knapsack Problems in a Dynamic Setting.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
12	Song He, Wei Li	An Adaptive Search Algorithm with Scatter and Tabu Strategy for Multidimensional Knapsack Problem.	ISICA	2021	DBLP DOI BibTeX RDF
12	Franziska Eberle, Nicole Megow, Lukas Nölke, Bertrand Simon 0001, Andreas Wiese	Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time.	FSTTCS	2021	DBLP DOI BibTeX RDF
12	Duanshun Li, Jing Liu 0024, Dongeun Lee 0001, Ali Seyedmazloom, Giridhar Kaushik, Kookjin Lee, Noseong Park	A Novel Method to Solve Neural Knapsack Problems.	ICML	2021	DBLP BibTeX RDF
12	Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi 0001, Alberto Marchetti-Spaccamela, Rebecca Reiffenhäuser	Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity.	ICML	2021	DBLP BibTeX RDF
12	Bin Liu 0009, Zihan Chen, Hongmin W. Du	Streaming Algorithms for Maximizing DR-Submodular Functions with d-Knapsack Constraints.	AAIM	2021	DBLP DOI BibTeX RDF
12	Omid Sadeghi, Maryam Fazel	Differentially Private Monotone Submodular Maximization Under Matroid and Knapsack Constraints.	AISTATS	2021	DBLP BibTeX RDF
12	Deval Patel, Arindam Khan 0001, Anand Louis	Group Fairness for Knapsack Problems. (PDF / PS)	AAMAS	2021	DBLP BibTeX RDF
12	Pallavi Jain 0001, Krzysztof Sornat, Nimrod Talmon	Preserving Consistency for Liquid Knapsack Voting. (PDF / PS)	AAMAS	2021	DBLP BibTeX RDF
12	Yang Qiu, Haomiao Li, Xiao Wang, Omar Dib	On the adoption of Metaheuristics for Solving 0-1 Knapsack Problems.	PAAP	2021	DBLP DOI BibTeX RDF
12	Rémi Bricout	Comment utiliser des algorithmes quantiques pour remplir son sac à dos et décoder des syndromes. (How to use quantum algorithms to solve the knapsack problem and the syndrome decoding problem).		2021	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.	Proc. ACM Meas. Anal. Comput. Syst.	2020	DBLP DOI BibTeX RDF
12	Nicolás Acevedo, Carlos Rey 0001, Carlos Contreras Bolton, Víctor Parada	Automatic design of specialized algorithms for the binary knapsack problem.	Expert Syst. Appl.	2020	DBLP DOI BibTeX RDF
12	Isaías I. Huerta, Daniel A. Neira, Daniel A. Ortega, Vicente Varas, Julio Godoy, Roberto Javier Asín Achá	Anytime automatic algorithm selection for knapsack.	Expert Syst. Appl.	2020	DBLP DOI BibTeX RDF
12	Isma Dahmani, Mhand Hifi, Toufik Saadi, Labib Yousef	A swarm optimization-based search algorithm for the quadratic knapsack problem with conflict Graphs.	Expert Syst. Appl.	2020	DBLP DOI BibTeX RDF
12	Ali Amiri 0001	A Lagrangean based solution algorithm for the knapsack problem with setups.	Expert Syst. Appl.	2020	DBLP DOI BibTeX RDF
12	Xiangjing Lai, Jin-Kao Hao, Zhang-Hua Fu, Dong Yue 0001	Diversity-preserving quantum particle swarm optimization for the multidimensional knapsack problem.	Expert Syst. Appl.	2020	DBLP DOI BibTeX RDF
12	Christopher Hojny, Tristan Gally, Oliver Habeck, Hendrik Lüthen, Frederic Matter, Marc E. Pfetsch, Andreas Schmitt	Knapsack polytopes: a survey.	Ann. Oper. Res.	2020	DBLP DOI BibTeX RDF
12	Renata Mansini, Roberto Zanotti	A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem.	INFORMS J. Comput.	2020	DBLP DOI BibTeX RDF
12	Georgios Amanatidis, Georgios Birmpas, Evangelos Markakis	A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint.	Inf. Process. Lett.	2020	DBLP DOI BibTeX RDF
12	Ahmet Bacak, Ali Köksal Hocaoglu	A novel resampling algorithm based on the knapsack problem.	Signal Process.	2020	DBLP DOI BibTeX RDF
12	Husheng Wu, Jun-jie Xue, Renbin Xiao, Jinqiang Hu	Uncertain bilevel knapsack problem based on an improved binary wolf pack algorithm.	Frontiers Inf. Technol. Electron. Eng.	2020	DBLP DOI BibTeX RDF
12	Abir Chaabani, Lamjed Ben Said	A co-evolutionary decomposition-based algorithm for the bi-level knapsack optimisation problem.	Int. J. Comput. Intell. Stud.	2020	DBLP DOI BibTeX RDF
12	Zhengtian Wu, Baoping Jiang, Hamid Reza Karimi	A logarithmic descent direction algorithm for the quadratic knapsack problem.	Appl. Math. Comput.	2020	DBLP DOI BibTeX RDF
12	Robinson S. V. Hoto, Luiz Carlos Matioli, Paulo Sérgio Marques dos Santos	A penalty algorithm for solving convex separable knapsack problems.	Appl. Math. Comput.	2020	DBLP DOI BibTeX RDF
12	Yanjun Jiang, Yishui Wang, Dachuan Xu, Ruiqi Yang, Yong Zhang 0001	Streaming algorithm for maximizing a monotone non-submodular function under d-knapsack constraint.	Optim. Lett.	2020	DBLP DOI BibTeX RDF
12	Seulgi Joung, Kyungsik Lee	Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity.	Optim. Lett.	2020	DBLP DOI BibTeX RDF
12	Wenjun Hou, Marek A. Perkowski	Quantum-based algorithm and circuit design for bounded Knapsack optimization problem.	Quantum Inf. Comput.	2020	DBLP DOI BibTeX RDF
12	Chien-Chung Huang, Naonori Kakimura, Yuichi Yoshida	Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint.	Algorithmica	2020	DBLP DOI BibTeX RDF