Search results for "knapsack"

Hits ?▲	Authors	Title	Venue	Year	Link
12	Alejandro Marrero, Eduardo Segredo, Coromoto León, Emma Hart	A Novelty-Search Approach to Filling an Instance-Space with Diverse and Discriminatory Instances for the Knapsack Problem.	PPSN (1)	2022	DBLP DOI BibTeX RDF
12	Adel Nikfarjam, Anh Viet Do, Frank Neumann 0001	Analysis of Quality Diversity Algorithms for the Knapsack Problem.	PPSN (2)	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.	PPSN (1)	2022	DBLP DOI BibTeX RDF
12	Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu	On the Complexity of Separation from the Knapsack Polytope.	IPCO	2022	DBLP DOI BibTeX RDF
12	Canh V. Pham, Dung K. T. Ha 0001, Huan X. Hoang, Tan D. Tran	Fast Streaming Algorithms for k-Submodular Maximization under a Knapsack Constraint.	DSAA	2022	DBLP DOI BibTeX RDF
12	Jiashuo Jiang, Will Ma, Jiawei Zhang 0006	Tight Guarantees for Multi-unit Prophet Inequalities and Online Stochastic Knapsack.	SODA	2022	DBLP DOI BibTeX RDF
12	Kosuke Aratani, Masakazu Muramatsu	A Variant of Knapsack Problem Efficient for Benders Decomposition.	IIAI-AAI-Winter	2022	DBLP DOI BibTeX RDF
12	Enpei Zhang, Kai Han 0003, Benwei Wu	An Algorithmic View of Streaming Submodular Data Summarization with A Knapsack Constraint.	DSIT	2022	DBLP DOI BibTeX RDF
12	Amy Peerlinck, John Sheppard 0001	Multi-Objective Factored Evolutionary Optimization and the Multi-Objective Knapsack Problem.	CEC	2022	DBLP DOI BibTeX RDF
12	Victoria Miranda-Burgos, Nicolás Rojas-Morales	Opposition-Inspired Strategies for Tabu Search approaches proposed for Knapsack Problems.	CEC	2022	DBLP DOI BibTeX RDF
12	Zhicheng Liu, Jing Jin, Donglei Du, Xiaoyan Zhang 0001	Two-Stage Submodular Maximization Under Knapsack and Matroid Constraints.	TAMC	2022	DBLP DOI BibTeX RDF
12	Soh Kumabe, Yuichi Yoshida	Average Sensitivity of the Knapsack Problem.	ESA	2022	DBLP DOI BibTeX RDF
12	Sheng Yang 0005, Samir Khuller, Sunav Choudhary, Subrata Mitra, Kanak Mahadik	Correlated Stochastic Knapsack with a Submodular Objective.	ESA	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.	ICALP	2022	DBLP DOI BibTeX RDF
12	Karl Bringmann, Alejandro Cassis	Faster Knapsack Algorithms via Bounded Monotone Min-Plus-Convolution.	ICALP	2022	DBLP DOI BibTeX RDF
12	Ziqiang Luo, Xueping Guo, Bin Wen, Junkuo Cao	An Evolution Algorithm Based on Cloud Model for 0-1 Knapsack Problem.	ISCID	2022	DBLP DOI BibTeX RDF
12	Lin Yang, Ali Zeynali, Mohammad H. Hajiesmaili, Ramesh K. Sitaraman, Don Towsley	Competitive Algorithms for Online Multidimensional Knapsack Problems.	SIGMETRICS (Abstracts)	2022	DBLP DOI BibTeX RDF
12	Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu	New Classes of Facets for Complementarity Knapsack Problems.	ISCO	2022	DBLP DOI BibTeX RDF
12	Yanlian Du, Zejing Feng, Yijun Shen	A Mixed-Factor Evolutionary Algorithm for Multi-objective Knapsack Problem.	ICIC (1)	2022	DBLP DOI BibTeX RDF
12	Md. Meheruzzaman Sarker, Md. Jakirul Islam, Md. Zakir Hossain	A Clustering Based Niching Method for Effectively Solving the 0-1 Knapsack Problem.	MIET (2)	2022	DBLP DOI BibTeX RDF
12	Imen Ben Mansour	Optimizing Multi-objective Knapsack Problem using a Hybrid Ant Colony Approach within Multi Directional Framework.	ICAART (2)	2022	DBLP DOI BibTeX RDF
12	Andreas Abels, Leon Ladewig, Kevin Schewior, Moritz Stinzendörfer	Knapsack Secretary Through Boosting.	WAOA	2022	DBLP DOI BibTeX RDF
12	Benwei Wu, Kai Han 0003	Fast Algorithm for Big Data Summarization with Knapsack and Partition Matroid Constraints.	INISTA	2022	DBLP DOI BibTeX RDF
12	Fatiha Bendali, Jean Mailfert, Eloise Mole Kamga, Alain Quilliot, Hélène Toussaint	A Synchronized Knapsack Problem.	CoDIT	2022	DBLP DOI BibTeX RDF
12	Takuya Miyamoto, Akihiro Fujiwara	Robust optimization algorithms for multi-objective knapsack problem.	CANDARW	2022	DBLP DOI BibTeX RDF
12	Joan Boyar, Lene M. Favrholdt, Kim S. Larsen	Online Unit Profit Knapsack with Untrusted Predictions.	SWAT	2022	DBLP DOI BibTeX RDF
12	Maying Shen, Hongxu Yin, Pavlo Molchanov 0001, Lei Mao, Jianna Liu, José M. Álvarez 0004	Structural Pruning via Latency-Saliency Knapsack.	NeurIPS	2022	DBLP BibTeX RDF
12	Qi Qiu, Junyi He, Tao Zhu 0001	DE with A new population initialization method for the dynamic multidimensional knapsack problems.	ICDIS	2022	DBLP DOI BibTeX RDF
12	Max Klimm, Martin Knaack	Maximizing a Submodular Function with Bounded Curvature Under an Unknown Knapsack Constraint.	APPROX/RANDOM	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.	CRYPTO (2)	2022	DBLP DOI BibTeX RDF
12	Velichka Traneva, Petar R. Petrov, Stoyan Tranev	Intuitionistic Fuzzy Knapsack Problem Trough the Index Matrices Prism.	NMA	2022	DBLP DOI BibTeX RDF
12	Jingwen Chen, Zhongzheng Tang, Chenhao Wang 0001	Monotone k-Submodular Knapsack Maximization: An Analysis of the Greedy+Singleton Algorithm.	AAIM	2022	DBLP DOI BibTeX RDF
12	Kemin Yu, Min Li 0028, Yang Zhou 0018, Qian Liu	Guarantees for Maximization of k-Submodular Functions with a Knapsack and a Matroid Constraint.	AAIM	2022	DBLP DOI BibTeX RDF
12	Zhen Song, Wenjian Luo, Xin Lin, Zeneng She, Qingfu Zhang 0001	On Multiobjective Knapsack Problems with Multiple Decision Makers.	SSCI	2022	DBLP DOI BibTeX RDF
12	Pallavi Jain 0001, Krzysztof Sornat, Nimrod Talmon	Preserving Consistency for Liquid Knapsack Voting.	EUMAS	2022	DBLP DOI BibTeX RDF
12	Abdeldjalil Ikhelef, Mohand Yazid Saidi, Shuopeng Li, Ken Chen	A Knapsack-based Optimization Algorithm for VNF Placement and Chaining Problem.	LCN	2022	DBLP DOI BibTeX RDF
12	Binh Thanh Dang, Bach Hoai Nguyen, Peter Andreae	Operation-based Greedy Algorithm for Discounted Knapsack Problem.	AI	2022	DBLP DOI BibTeX RDF
12	Andrzej Chmielowiec, Leszek Klich, Weronika Wos, Adam Blachowicz	Global Spare Parts Exploitation Costs Optymization and Its Reduction to Rectangular Knapsack Problem.	ICEIS (1)	2022	DBLP DOI BibTeX RDF
12	Jacopo Pierotti	Models and heuristics for hard routing and knapsack problems.		2022	RDF
12	Lin Yang, Ali Zeynali, Mohammad H. Hajiesmaili, Ramesh K. Sitaraman, Don Towsley	Competitive Algorithms for Online Multidimensional Knapsack Problems.	Proc. ACM Meas. Anal. Comput. Syst.	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.	Proc. ACM Meas. Anal. Comput. Syst.	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.	Proc. ACM Meas. Anal. Comput. Syst.	2021	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.	Proc. ACM Meas. Anal. Comput. Syst.	2021	DBLP DOI BibTeX RDF
12	Zequn Wei, Jin-Kao Hao	Kernel based tabu search for the Set-union Knapsack Problem.	Expert Syst. Appl.	2021	DBLP DOI BibTeX RDF
12	Jiaxin Li, Yan Lan, Feng Chen 0004, Xin Han, Jacek Blazewicz	A Fast Algorithm for Knapsack Problem with Conflict Graph.	Asia Pac. J. Oper. Res.	2021	DBLP DOI BibTeX RDF
12	Yijing Wang, Donglei Du, Yanjun Jiang, Xianzhao Zhang	Non-Submodular Maximization with Matroid and Knapsack Constraints.	Asia Pac. J. Oper. Res.	2021	DBLP DOI BibTeX RDF
12	Ranjith J, Mahantesh K	Blockchain-based Knapsack System for Security and Privacy Preserving to Medical Data.	SN Comput. Sci.	2021	DBLP DOI BibTeX RDF
12	Isma Dahmani, Mhand Hifi	A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs.	Ann. Oper. Res.	2021	DBLP DOI BibTeX RDF
12	Gabriel L. Zenarosa, Oleg A. Prokopyev, Eduardo L. Pasiliao	On exact solution approaches for bilevel quadratic 0-1 knapsack problem.	Ann. Oper. Res.	2021	DBLP DOI BibTeX RDF
12	Shijin Wang 0002, Wenli Cui, Feng Chu 0001, Jianbo Yu	The interval min-max regret knapsack packing-delivery problem.	Int. J. Prod. Res.	2021	DBLP DOI BibTeX RDF
12	Ran Wang 0001, Zichao Zhang	Set Theory-Based Operator Design in Evolutionary Algorithms for Solving Knapsack Problems.	IEEE Trans. Evol. Comput.	2021	DBLP DOI BibTeX RDF
12	Yasemin Merzifonluoglu, Joseph Geunes	The Risk-Averse Static Stochastic Knapsack Problem.	INFORMS J. Comput.	2021	DBLP DOI BibTeX RDF
12	Yu Yang 0014, Natashia Boland, Martin W. P. Savelsbergh	Multivariable Branching: A 0-1 Knapsack Problem Case Study.	INFORMS J. Comput.	2021	DBLP DOI BibTeX RDF
12	Daniel Blado, Alejandro Toriello	A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes.	Math. Program. Comput.	2021	DBLP DOI BibTeX RDF
12	Iván Derpich, Carlos Herrera 0001, Felipe D. Sepúlveda, Hugo Ubilla	Complexity indices for the multidimensional knapsack problem.	Central Eur. J. Oper. Res.	2021	DBLP DOI BibTeX RDF
12	Ismail M. Ali, Daryl Essam, Kathryn Kasmarik	Novel binary differential evolution algorithm for knapsack problems.	Inf. Sci.	2021	DBLP DOI BibTeX RDF
12	Artur Alves Pessoa, Michael Poss, Ruslan Sadykov, François Vanderbeck	Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty.	Oper. Res.	2021	DBLP DOI BibTeX RDF
12	Kate Smith-Miles, Jeffrey Christiansen, Mario Andrés Muñoz	Revisiting where are the hard knapsack problems? via Instance Space Analysis.	Comput. Oper. Res.	2021	DBLP DOI BibTeX RDF
12	Denise D. Tönissen, Loe Schlicher	Using 3D-printing in disaster response: The two-stage stochastic 3D-printing knapsack problem.	Comput. Oper. Res.	2021	DBLP DOI BibTeX RDF
12	Paolo Detti	A new upper bound for the multiple knapsack problem.	Comput. Oper. Res.	2021	DBLP DOI BibTeX RDF
12	Zequn Wei, Jin-Kao Hao	A threshold search based memetic algorithm for the disjunctively constrained knapsack problem.	Comput. Oper. Res.	2021	DBLP DOI BibTeX RDF
12	Waldo Gálvez, Fabrizio Grandoni 0001, Salvatore Ingala, Sandy Heydrich, Arindam Khan 0001, Andreas Wiese	Approximating Geometric Knapsack via L-packings.	ACM Trans. Algorithms	2021	DBLP DOI BibTeX RDF
12	Zhenzhou Wang, Xinyuan Li, Pingping Yu, Ning Cao 0002, Russell Higgs	Research on electric vehicle charging scheduling algorithms based on a 'fractional knapsack'.	Int. J. Embed. Syst.	2021	DBLP DOI BibTeX RDF
12	Khadoudja Ghanem, Abdesslem Layeb	Feature Selection and Knapsack Problem Resolution Based on a Discrete Backtracking Optimization Algorithm.	Int. J. Appl. Evol. Comput.	2021	DBLP DOI BibTeX RDF
12	Igor Deplano, Charly Lersteau, Trung Thanh Nguyen 0002	A mixed-integer linear model for the multiple heterogeneous knapsack problem with realistic container loading constraints and bins' priority.	Int. Trans. Oper. Res.	2021	DBLP DOI BibTeX RDF
12	Ulrich Pferschy, Joachim Schauer, Clemens Thielen	Approximating the product knapsack problem.	Optim. Lett.	2021	DBLP DOI BibTeX RDF
12	Jean Paulo Martins, Bruno Cesar Ribas	A randomized heuristic repair for the multidimensional knapsack problem.	Optim. Lett.	2021	DBLP DOI BibTeX RDF
12	Matthieu Parizy, Nozomu Togawa	Analysis and Acceleration of the Quadratic Knapsack Problem on an Ising Machine.	IEICE Trans. Fundam. Electron. Commun. Comput. Sci.	2021	DBLP DOI BibTeX RDF
12	Tianming Zhao 0002, Weisheng Si, Wei Li 0058, Albert Y. Zomaya	Optimizing the Maximum Vertex Coverage Attacks Under Knapsack Constraint.	IEEE/ACM Trans. Netw.	2021	DBLP DOI BibTeX RDF
12	Yichao He, Xinlu Zhang, Wenbin Li, Jinghong Wang, Ning Li	An efficient binary differential evolution algorithm for the multidimensional knapsack problem.	Eng. Comput.	2021	DBLP DOI BibTeX RDF
12	Asaju La'aro Bolaji, Friday Zinzendoff Okwonu, Peter Bamidele Shola, Babatunde Sulaiman Balogun, Obinna Damian Adubisi	A Modified Binary Pigeon-Inspired Algorithm for Solving the Multi-dimensional Knapsack Problem.	J. Intell. Syst.	2021	DBLP DOI BibTeX RDF
12	Susanne Albers, Arindam Khan 0001, Leon Ladewig	Improved Online Algorithms for Knapsack and GAP in the Random Order Model.	Algorithmica	2021	DBLP DOI BibTeX RDF
12	Chien-Chung Huang, Naonori Kakimura	Improved Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint.	Algorithmica	2021	DBLP DOI BibTeX RDF
12	Thiago Alcântara Luiz, Haroldo Gambini Santos, Eduardo Uchoa	Cover by disjoint cliques cuts for the knapsack problem with conflicting items.	Oper. Res. Lett.	2021	DBLP DOI BibTeX RDF
12	Sahar Abdollahi, Arash Deldari, Hamid Asadi, Ahmadreza Montazerolghaem, Sayyed Majid Mazinani	Flow-Aware Forwarding in SDN Datacenters Using a Knapsack-PSO-Based Solution.	IEEE Trans. Netw. Serv. Manag.	2021	DBLP DOI BibTeX RDF
12	David Yang Gao	Canonical Duality Theory and Algorithm for Solving Bilevel Knapsack Problems With Applications.	IEEE Trans. Syst. Man Cybern. Syst.	2021	DBLP DOI BibTeX RDF
12	Mingwu Zhang, Yu Chen 0056, Zhe Xia, Jiangyi Du, Willy Susilo	PPO-DFK: A Privacy-Preserving Optimization of Distributed Fractional Knapsack With Application in Secure Footballer Configurations.	IEEE Syst. J.	2021	DBLP DOI BibTeX RDF
12	Yupeng Zhou, Mengyu Zhao, Mingjie Fan, Yiyuan Wang, Jianan Wang	An efficient local search for large-scale set-union knapsack problem.	Data Technol. Appl.	2021	DBLP DOI BibTeX RDF
12	Elias Munapo, Santosh Kumar	Reducing the complexity of the knapsack linear integer problem by reformulation techniques.	Int. J. Syst. Assur. Eng. Manag.	2021	DBLP DOI BibTeX RDF
12	Zhongzheng Tang, Chenhao Wang 0001, Hau Chan	On maximizing a monotone k-submodular function under a knapsack constraint.	CoRR	2021	DBLP BibTeX RDF
12	Jakob Bossek, Aneta Neumann, Frank Neumann 0001	Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms.	CoRR	2021	DBLP BibTeX RDF
12	Jeff Giliberti, Andreas Karrenbauer	Improved Online Algorithm for Fractional Knapsack in the Random Order Model.	CoRR	2021	DBLP BibTeX RDF
12	Ariel Kulik, Roy Schwartz 0002, Hadas Shachnai	A Faster Tight Approximation for Submodular Maximization Subject to a Knapsack Constraint.	CoRR	2021	DBLP BibTeX RDF
12	Mihai Oltean, Crina Grosan, Mihaela Oltean	Evolving Digital Circuits for the Knapsack Problem.	CoRR	2021	DBLP 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.	CoRR	2021	DBLP BibTeX RDF
12	Jiashuo Jiang, Will Ma, Jiawei Zhang 0006	Tight Guarantees for Multi-unit Prophet Inequalities and Online Stochastic Knapsack.	CoRR	2021	DBLP BibTeX RDF
12	Michael Beyer, Steven Mills	Preemptive Two-stage Goal-Programming Formulation of a Strict Version of the Unbounded Knapsack Problem with Bounded Weights.	CoRR	2021	DBLP BibTeX RDF
12	Zequn Wei, Jin-Kao Hao	A threshold search based memetic algorithm for the disjunctively constrained knapsack problem.	CoRR	2021	DBLP 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.	CoRR	2021	DBLP BibTeX RDF
12	Javier Albert, Dmitri Goldenberg	E-Commerce Promotions Personalization via Online Multiple-Choice Knapsack with Uplift Modeling.	CoRR	2021	DBLP BibTeX RDF
12	Sahar Abdollahi, Arash Deldari, Hamid Asadi, Ahmadreza Montazerolghaem, Sayyed Majid Mazinani	Flow aware Forwarding in SDN Datacenters Using a Knapsack PSO Based Solution.	CoRR	2021	DBLP BibTeX RDF
12	Oren Neumann, Claudius Gros	Investment vs. reward in a competitive knapsack problem.	CoRR	2021	DBLP BibTeX RDF
12	Dmitry V. Gribanov	An FPTAS for the Δ-modular multidimensional knapsack problem.	CoRR	2021	DBLP BibTeX RDF
12	Arindam Khan 0001, Eklavya Sharma, K. V. N. Sreenivas	Approximation Algorithms for Generalized Multidimensional Knapsack.	CoRR	2021	DBLP BibTeX RDF
12	Shaojie Tang 0001	Beyond Pointwise Submodularity: Non-Monotone Adaptive Submodular Maximization subject to a Knapsack Constraint.	CoRR	2021	DBLP BibTeX RDF
12	Adam Polak 0001, Lars Rohwedder, Karol Wegrzycki	Knapsack and Subset Sum with Small Items.	CoRR	2021	DBLP BibTeX RDF
12	Yann Disser, Max Klimm, David Weckbecker	Fractionally Subadditive Maximization under an Incremental Knapsack Constraint.	CoRR	2021	DBLP 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.	CoRR	2021	DBLP BibTeX RDF
12	Yaron Fairstein, Ariel Kulik, Joseph Naor, Danny Raz	General Knapsack Problems in a Dynamic Setting.	CoRR	2021	DBLP BibTeX RDF
12	Arindam Khan 0001, Arnab Maiti, Amatya Sharma, Andreas Wiese	On Guillotine Separable Packings for the Two-dimensional Geometric Knapsack Problem.	CoRR	2021	DBLP BibTeX RDF