Search results for "knapsack"

Hits ?▲	Authors	Title	Venue	Year	Link
12	Jun Hu, Qingfu Zhang 0001, Yong-Chang Jiao	A Novel Hybrid Tabu Search Algorithm With Binary Differential Operator for Knapsack Problems.	CIS	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.	ICML	2020	DBLP BibTeX RDF
12	Lu Han, Chunlin Hao, Chenchen Wu, Zhenning Zhang	Approximation Algorithms for the Lower-Bounded Knapsack Median Problem.	AAIM	2020	DBLP DOI BibTeX RDF
12	Hanyu Gu	Optimal Lagrangian Multipliers for the Multidimensional Knapsack Problem: a Bayesian Optimisation Approach.	SSCI	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.	AISTATS	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.	AISTATS	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.	PAAP	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.	PAAP	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).		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).		2020	RDF
12	Keumseok Kang, Kemal Altinkemer, Inkyoung Hur	Mobile coupons delivery problem: Postponable online multi-constraint knapsack.	Decis. Support Syst.	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.	Neural Comput. Appl.	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.	Expert Syst. Appl.	2019	DBLP DOI BibTeX RDF
12	Roman Denysiuk, António Gaspar-Cunha, Alexandre C. B. Delbem	Neuroevolution for solving multiobjective knapsack problems.	Expert Syst. Appl.	2019	DBLP DOI BibTeX RDF
12	Khaled M. Elbassioni, Areg Karapetyan, Trung Thanh Nguyen 0004	Approximation schemes for r-weighted Minimization Knapsack problems.	Ann. Oper. Res.	2019	DBLP DOI BibTeX RDF
12	Daniel Blado, Alejandro Toriello	Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes.	SIAM J. Optim.	2019	DBLP DOI BibTeX RDF
12	Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl	Interdiction Games and Monotonicity, with Application to Knapsack Problems.	INFORMS J. Comput.	2019	DBLP DOI BibTeX RDF
12	Fenlan Wang	A new exact algorithm for concave knapsack problems with integer variables.	Int. J. Comput. Math.	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.	Concurr. Comput. Pract. Exp.	2019	DBLP DOI BibTeX RDF
12	István Borgulya	An EDA for the 2D knapsack problem with guillotine constraint.	Central Eur. J. Oper. Res.	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.	EURO J. Comput. Optim.	2019	DBLP DOI BibTeX RDF
12	Harisankar Haridas, Sriram Kailasam, Janakiram Dharanipragada	Cloudy Knapsack Algorithm for Offloading Tasks from Large Scale Distributed Applications.	IEEE Trans. Cloud Comput.	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.	Algorithms Mol. Biol.	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.	J. Ambient Intell. Humaniz. Comput.	2019	DBLP DOI BibTeX RDF
12	Jiayang Liu, Jingguo Bi, Songyan Xu	An Improved Attack on the Basic Merkle-Hellman Knapsack Cryptosystem.	IEEE Access	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.	IEEE Access	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.	IEEE Access	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.	IEEE Access	2019	DBLP DOI BibTeX RDF
12	Xingwang Huang, Peijia Li, Pu Yunming	Amplitude Angle Modulated Bat Algorithm With Application to Zero-One Knapsack Problem.	IEEE Access	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.	IEEE Access	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.	IEEE Access	2019	DBLP DOI BibTeX RDF
12	Yanhong Feng, Jiao-Hong Yi, Gai-Ge Wang	Enhanced Moth Search Algorithm for the Set-Union Knapsack Problems.	IEEE Access	2019	DBLP DOI BibTeX RDF
12	Song Zhang, Sanyang Liu	A Discrete Improved Artificial Bee Colony Algorithm for 0-1 Knapsack Problem.	IEEE Access	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.	IEEE Access	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.	Evol. Intell.	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.	Comput. Oper. Res.	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.	J. Supercomput.	2019	DBLP DOI BibTeX RDF
12	Ashish Goel, Anilesh K. Krishnaswamy, Sukolsak Sakshuwong, Tanja Aitamurto	Knapsack Voting for Participatory Budgeting.	ACM Trans. Economics and Comput.	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.	Int. J. Wirel. Mob. Comput.	2019	DBLP DOI BibTeX RDF
12	Sandy Heydrich, Andreas Wiese	Faster Approximation Schemes for the Two-Dimensional Knapsack Problem.	ACM Trans. Algorithms	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.	Int. Trans. Oper. Res.	2019	DBLP DOI BibTeX RDF
12	Osvaldo Inarejos, Robinson Hoto, Nelson Maculan	An integer linear optimization model to the compartmentalized knapsack problem.	Int. Trans. Oper. Res.	2019	DBLP DOI BibTeX RDF
12	Yasushi Kawase, Hanna Sumita, Takuro Fukunaga	Submodular Maximization with Uncertain Knapsack Capacity.	SIAM J. Discret. Math.	2019	DBLP DOI BibTeX RDF
12	Yuichi Yoshida	Maximizing a Monotone Submodular Function with a Bounded Curvature under a Knapsack Constraint.	SIAM J. Discret. Math.	2019	DBLP DOI BibTeX RDF
12	Ulrich Pferschy, Gaia Nicosia, Andrea Pacifici	A Stackelberg knapsack game with weight control.	Theor. Comput. Sci.	2019	DBLP DOI BibTeX RDF
12	Frank Gurski, Carolin Rehs, Jochen Rethmann	Knapsack problems: A parameterized point of view.	Theor. Comput. Sci.	2019	DBLP DOI BibTeX RDF
12	Xin Han, Qinyang Chen, Kazuhisa Makino	Online knapsack problem under concave functions.	Theor. Comput. Sci.	2019	DBLP DOI BibTeX RDF
12	Anis Elgabli, Vaneet Aggarwal	Deadline and Buffer Constrained Knapsack Problem.	IEEE Trans. Circuits Syst. Video Technol.	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.	Inf.	2019	DBLP DOI BibTeX RDF
12	Jialin Li, Wei Li 0078	A new quantum evolutionary algorithm using dynamic rotation angle catastrophe for knapsack problem.	Int. J. Intell. Inf. Database Syst.	2019	DBLP DOI BibTeX RDF
12	Frank Gurski, Carolin Rehs	Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width.	Math. Methods Oper. Res.	2019	DBLP DOI BibTeX RDF
12	Shalin Shah	GKNAP: A Java and C++ package for solving the multidimensional knapsack problem.	J. Open Source Softw.	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 -.	CoRR	2019	DBLP BibTeX RDF
12	Xin Han, Yasushi Kawase, Kazuhisa Makino, Haruki Yokomaku	Online Knapsack Problems with a Resource Buffer.	CoRR	2019	DBLP BibTeX RDF
12	Shalin Shah	Genetic Algorithm for a class of Knapsack Problems.	CoRR	2019	DBLP BibTeX RDF
12	Yue Xie, Oscar Harper, Hirad Assimi, Aneta Neumann, Frank Neumann 0001	Evolutionary Algorithms for the Chance-Constrained Knapsack Problem.	CoRR	2019	DBLP BibTeX RDF
12	Evripidis Bampis, Bruno Escoffier, Alexandre Teiller	Multistage Knapsack.	CoRR	2019	DBLP BibTeX RDF
12	Fabrizio Grandoni 0001, Stefan Kratsch, Andreas Wiese	Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack.	CoRR	2019	DBLP BibTeX RDF
12	Henrique Becker, Luciana S. Buriol	An empirical analysis of exact algorithms for the unbounded knapsack problem.	CoRR	2019	DBLP BibTeX RDF
12	Ce Jin 0001	An Improved FPTAS for 0-1 Knapsack.	CoRR	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.	CoRR	2019	DBLP BibTeX RDF
12	Theofilos Triommatis, Aris Pagourtzis	Approximate #Knapsack Computations to Count Semi-Fair Allocations.	CoRR	2019	DBLP BibTeX RDF
12	Will Ma, David Simchi-Levi, Jinglong Zhao	A Competitive Analysis of Online Knapsack Problems with Unit Density.	CoRR	2019	DBLP BibTeX RDF
12	Yingdong Lu	A Stochastic Knapsack Game: Revenue Management in Competitions.	CoRR	2019	DBLP BibTeX RDF
12	Zhihao Jiang, Haoyu Zhao	An FPTAS for Stochastic Unbounded Min-Knapsack Problem.	CoRR	2019	DBLP BibTeX RDF
12	Pierre Dupuy de la Grand'rive, Jean-François Hullo	Knapsack Problem variants of QAOA for battery revenue optimisation.	CoRR	2019	DBLP BibTeX RDF
12	Wenxin Li 0004, Joohyun Lee, Ness B. Shroff	A Faster FPTAS for Knapsack Problem With Cardinality Constraint.	CoRR	2019	DBLP BibTeX RDF
12	Zequn Wei, Jin-Kao Hao	Iterated two-phase local search for the Set-Union Knapsack Problem.	CoRR	2019	DBLP BibTeX RDF
12	Dmitrii Avdiukhin, Grigory Yaroslavtsev, Samson Zhou	"Bring Your Own Greedy"+Max: Near-Optimal 1/2-Approximations for Submodular Knapsack.	CoRR	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.	CoRR	2019	DBLP BibTeX RDF
12	Christoph Buchheim, Dorothee Henke	The robust bilevel continuous knapsack problem.	CoRR	2019	DBLP BibTeX RDF
12	Shalin Shah	Genetic Algorithm for the 0/1 Multidimensional Knapsack Problem.	CoRR	2019	DBLP BibTeX RDF
12	Dmitrii Avdiukhin, Slobodan Mitrovic, Grigory Yaroslavtsev, Samson Zhou	Adversarially Robust Submodular Maximization under Knapsack Constraints.	CoRR	2019	DBLP BibTeX RDF
12	Ulrich Pferschy, Joachim Schauer, Clemens Thielen	The Product Knapsack Problem: Approximation and Complexity.	CoRR	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.	Memetic Comput.	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.	Soft Comput.	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.	Swarm Evol. Comput.	2019	DBLP DOI BibTeX RDF
12	Sergei I. Dotsenko	On a Cooperative Game in the Knapsack Problem.	Autom. Remote. Control.	2019	DBLP DOI BibTeX RDF
12	Kaiping Luo, Qiuhong Zhao	A binary grey wolf optimizer for the multidimensional knapsack problem.	Appl. Soft Comput.	2019	DBLP DOI BibTeX RDF
12	Kantour Nedjmeddine, Bouroubi Sadek, Chaabane Djamel	A parallel MOEA with criterion-based selection applied to the Knapsack Problem.	Appl. Soft Comput.	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.	Eur. J. Oper. Res.	2019	DBLP DOI BibTeX RDF
12	Enrico Malaguti, Michele Monaci, Paolo Paronuzzi, Ulrich Pferschy	Integer optimization with penalized fractional values: The Knapsack case.	Eur. J. Oper. Res.	2019	DBLP DOI BibTeX RDF
12	Henrique Becker, Luciana S. Buriol	An empirical analysis of exact algorithms for the unbounded knapsack problem.	Eur. J. Oper. Res.	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.	Eur. J. Oper. Res.	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.	ARIMA J.	2019	DBLP DOI BibTeX RDF
12	Sunil Chopra, Sangho Shim, Daniel E. Steffy	A concise characterization of strong knapsack facets.	Discret. Appl. Math.	2019	DBLP DOI BibTeX RDF
12	Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia	New exact approaches and approximation results for the Penalized Knapsack Problem.	Discret. Appl. Math.	2019	DBLP DOI BibTeX RDF
12	Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia	On approximating the Incremental Knapsack Problem.	Discret. Appl. Math.	2019	DBLP DOI BibTeX RDF
12	Zequn Wei, Jin-Kao Hao	Iterated two-phase local search for the Set-Union Knapsack Problem.	Future Gener. Comput. Syst.	2019	DBLP DOI BibTeX RDF
12	Fehmi Burcin Özsoydan, Adil Baykasoglu	A swarm intelligence-based algorithm for the set-union knapsack problem.	Future Gener. Comput. Syst.	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.	Nat. Lang. Eng.	2019	DBLP DOI BibTeX RDF
12	Fanchao Meng, Dianhui Chu, Keqiu Li, Xuequan Zhou	Multiple-class multidimensional knapsack optimisation problem and its solution approaches.	Knowl. Based Syst.	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.	Comput. Ind. Eng.	2019	DBLP DOI BibTeX RDF
12	Rahma Lahyani, Khalil Chebil, Mahdi Khemakhem, Leandro C. Coelho	Matheuristics for solving the Multiple Knapsack Problem with Setup.	Comput. Ind. Eng.	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.	Comput. Ind. Eng.	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.	Int. J. Mach. Learn. Cybern.	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.	Nat. Comput.	2019	DBLP DOI BibTeX RDF
12	Romeo Rizzi, Alexandru I. Tomescu	Faster FPTASes for counting and random generation of Knapsack solutions.	Inf. Comput.	2019	DBLP DOI BibTeX RDF
12	Kameng Nip, Zhenbo Wang	On the approximability of the two-phase knapsack problem.	J. Comb. Optim.	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.	CPAIOR	2019	DBLP DOI BibTeX RDF