Search results for "knapsacks"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
95	Phong Q. Nguyen, Jacques Stern	Adapting Density Attacks to Low-Weight Knapsacks.	ASIACRYPT	2005	DBLP DOI BibTeX RDF	Lattices, Knapsack, Public-Key Cryptanalysis, Subset Sum
95	F. Jorissen, Joos Vandewalle, René Govaerts	Extension of Brickell's Algorithm for Breaking High Density Knapsacks.	EUROCRYPT	1987	DBLP DOI BibTeX RDF
59	Quentin Louveaux, Robert Weismantel	Polyhedral properties for the intersection of two knapsacks.	Math. Program.	2008	DBLP DOI BibTeX RDF
59	Bo Qin, Qianhong Wu, Willy Susilo, Yi Mu 0001, Yumin Wang	Zero-Knowledge Proof of Generalized Compact Knapsacks (or A Novel Identification/Signature Scheme).	ATC	2006	DBLP DOI BibTeX RDF
55	Zhenbo Wang, Wenxun Xing	A successive approximation algorithm for the multiple knapsack problem.	J. Comb. Optim.	2009	DBLP DOI BibTeX RDF	Approximation algorithm, Worst-case analysis, Multiple knapsack problem
55	Tugba Saraç, Aydin Sipahioglu	A Genetic Algorithm for the Quadratic Multiple Knapsack Problem.	BVAI	2007	DBLP DOI BibTeX RDF	Quadratic Multiple Knapsack Problem, Genetic Algorithm, Combinatorial Optimization
55	Amanda Hiley, Bryant A. Julstrom	The quadratic multiple knapsack problem and three heuristic approaches to it.	GECCO	2006	DBLP DOI BibTeX RDF	quadratic multiple knapsack problem, genetic algorithm, knapsack problems, greedy heuristic, hill-climber
45	Xiaocheng Li, Chunlin Sun, Yinyu Ye 0001	The Symmetry between Arms and Knapsacks: A Primal-Dual Approach for Bandits with Knapsacks.	CoRR	2021	DBLP BibTeX RDF
45	Xiaocheng Li, Chunlin Sun, Yinyu Ye 0001	The Symmetry between Arms and Knapsacks: A Primal-Dual Approach for Bandits with Knapsacks.	ICML	2021	DBLP BibTeX RDF
41	Daniele Micciancio	Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions.	Comput. Complex.	2007	DBLP DOI BibTeX RDF	11H06, Subject classification. 68Q17, 94B15
41	Yeow Meng Chee, Antoine Joux, Jacques Stern	The Cryptanalysis of a New Public-Key Cryptosystem Based on Modular Knapsacks.	CRYPTO	1991	DBLP DOI BibTeX RDF
41	Valtteri Niemi	A New Trapdoor in Knapsacks.	EUROCRYPT	1990	DBLP DOI BibTeX RDF
41	Ernest F. Brickell	Breaking Iterated Knapsacks.	CRYPTO	1984	DBLP DOI BibTeX RDF
36	Urszula Boryczka	Ants and Multiple Knapsack Problem.	CISIM	2007	DBLP DOI BibTeX RDF	combinatorial optimization, ant colony optimization, multiple knapsack problem
36	Aameek Singh, Madhukar R. Korupolu, Bhuvan Bamba	Integrated resource allocation in heterogeneous SAN data centers.	PODC	2007	DBLP DOI BibTeX RDF	SAN resource management, integrated allocation
36	Alper Atamtürk	Cover and Pack Inequalities for (Mixed) Integer Programming.	Ann. Oper. Res.	2005	DBLP DOI BibTeX RDF	knapsack polyhedra, superadditive functions, integer programming, lifting
36	Ravindra K. Ahuja, Claudio Barbieri da Cunha	Very Large-Scale Neighborhood Search for the K-Constraint Multiple Knapsack Problem.	J. Heuristics	2005	DBLP DOI BibTeX RDF	neighborhood search algorithms, heuristics, knapsack problem
36	John M. Wilson 0001	An Algorithm for the Generalized Assignment Problem with Special Ordered Sets.	J. Heuristics	2005	DBLP DOI BibTeX RDF	generalized assignment, special ordered sets, heuristics, assignment
36	Hadas Shachnai, Tami Tamir	Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placement.	RANDOM-APPROX	2003	DBLP DOI BibTeX RDF
36	Jacques Patarin	How to Find and Avoid Collisions for the Knapsack Hash Function.	EUROCRYPT	1993	DBLP DOI BibTeX RDF
33	Jon Lee 0001, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko	Non-monotone submodular maximization under matroid and knapsack constraints.	STOC	2009	DBLP DOI BibTeX RDF	approximation algorithms, matroids, knapsacks, submodular functions
33	Mhand Hifi, Hedi M'Halla, Slim Sadfi	Sensitivity of the Optimum to Perturbations of the Profit or Weight of an Item in the Binary Knapsack Problem.	J. Comb. Optim.	2005	DBLP DOI BibTeX RDF	optimality, combinatorial optimization, sensitivity analysis, knapsacks
22	Simona Mancini, Carlo Meloni, Michele Ciavotta	A decomposition approach for multidimensional knapsacks with family-split penalties.	Int. Trans. Oper. Res.	2024	DBLP DOI BibTeX RDF
22	Giannis Fikioris, Éva Tardos	Approximately Stationary Bandits with Knapsacks.	CoRR	2023	DBLP DOI BibTeX RDF
22	Wanteng Ma, Dong Xia, Jiashuo Jiang	High-dimensional Linear Bandits with Knapsacks.	CoRR	2023	DBLP DOI BibTeX RDF
22	Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Federico Fusco	Bandits with Replenishable Knapsacks: the Best of both Worlds.	CoRR	2023	DBLP DOI BibTeX RDF
22	Evgenii Chzhen, Christophe Giraud 0002, Zhen Li, Gilles Stoltz	Small Total-Cost Constraints in Contextual Bandits with Knapsacks, with Application to Fairness.	CoRR	2023	DBLP DOI BibTeX RDF
22	Yichuan Deng 0002, Michalis Mamakos, Zhao Song 0002	Clustered Linear Contextual Bandits with Knapsacks.	CoRR	2023	DBLP DOI BibTeX RDF
22	Evgenii Chzhen, Christophe Giraud 0002, Zhen Li, Gilles Stoltz	Small Total-Cost Constraints in Contextual Bandits with Knapsacks, with Application to Fairness.	NeurIPS	2023	DBLP BibTeX RDF
22	Giannis Fikioris, Éva Tardos	Approximately Stationary Bandits with Knapsacks.	COLT	2023	DBLP BibTeX RDF
22	Daniel E. Macedo, Marcus M. Bezerra, Danilo F. S. Santos, Angelo Perkusich	Orchestrating Fog Computing Resources Based on the Multi-dimensional Multiple Knapsacks Problem.	AINA (2)	2023	DBLP DOI BibTeX RDF
22	Lixing Lyu, Wang Chi Cheung	Bandits with Knapsacks: Advice on Time-Varying Demands.	ICML	2023	DBLP BibTeX RDF
22	Shaoang Li, Lan Zhang 0002, Yingqi Yu, Xiangyang Li 0001	Optimal Arms Identification with Knapsacks.	ICML	2023	DBLP BibTeX RDF
22	Yuxuan Han, Jialin Zeng, Yang Wang, Yang Xiang, Jiheng Zhang	Optimal Contextual Bandits with Knapsacks under Realizability via Regression Oracles.	AISTATS	2023	DBLP BibTeX RDF
22	Nicole Immorlica, Karthik Abinav Sankararaman, Robert E. Schapire, Aleksandrs Slivkins	Adversarial Bandits with Knapsacks.	J. ACM	2022	DBLP DOI BibTeX RDF
22	Zhen Li, Gilles Stoltz	Contextual Bandits with Knapsacks for a Conversion Model.	CoRR	2022	DBLP DOI BibTeX RDF
22	Raunak Kumar, Robert Kleinberg	Non-monotonic Resource Utilization in the Bandits with Knapsacks Problem.	CoRR	2022	DBLP DOI BibTeX RDF
22	Shang Liu, Jiashuo Jiang, Xiaocheng Li	Non-stationary Bandits with Knapsacks.	CoRR	2022	DBLP DOI BibTeX RDF
22	Yuxuan Han, Jialin Zeng, Yang Wang 0020, Yang Xiang, Jiheng Zhang	Optimal Contextual Bandits with Knapsacks under Realizibility via Regression Oracles.	CoRR	2022	DBLP DOI BibTeX RDF
22	Rui Ai 0002, Zhaohua Chen 0001, Xiaotie Deng, Yuqi Pan, Chang Wang 0004, Mingwei Yang 0002	On the Re-Solving Heuristic for (Binary) Contextual Bandits with Knapsacks.	CoRR	2022	DBLP DOI BibTeX RDF
22	Matteo Castiglioni, Andrea Celli, Christian Kroer	Online Learning with Knapsacks: the Best of Both Worlds.	CoRR	2022	DBLP BibTeX RDF
22	Aleksandrs Slivkins, Dylan J. Foster	Efficient Contextual Bandits with Knapsacks via Regression.	CoRR	2022	DBLP DOI BibTeX RDF
22	Joo Woo, Kwangsu Lee, Jong Hwan Park	GCKSign: Simple and Efficient Signatures from Generalized Compact Knapsacks.	IACR Cryptol. ePrint Arch.	2022	DBLP BibTeX RDF
22	Hangfan Li, Xiaoxiong Zhong, Yun Ji, Xinghan Wang, Sheng Zhang	Batch based Multi-Arm Bandits with Knapsacks for Tasks Allocation in MEC.	ICCC	2022	DBLP DOI BibTeX RDF
22	Zhen Li, Gilles Stoltz	Contextual Bandits with Knapsacks for a Conversion Model.	NeurIPS	2022	DBLP BibTeX RDF
22	Shang Liu, Jiashuo Jiang, Xiaocheng Li	Non-stationary Bandits with Knapsacks.	NeurIPS	2022	DBLP BibTeX RDF
22	Qingsong Liu, Weihang Xu, Siwei Wang 0002, Zhixuan Fang	Combinatorial Bandits with Linear Constraints: Beyond Knapsacks and Fairness.	NeurIPS	2022	DBLP BibTeX RDF
22	Raunak Kumar, Robert Kleinberg	Non-monotonic Resource Utilization in the Bandits with Knapsacks Problem.	NeurIPS	2022	DBLP BibTeX RDF
22	Vidyashankar Sivakumar, Shiliang Zuo, Arindam Banerjee 0001	Smoothed Adversarial Linear Contextual Bandits with Knapsacks.	ICML	2022	DBLP BibTeX RDF
22	Matteo Castiglioni, Andrea Celli, Christian Kroer	Online Learning with Knapsacks: the Best of Both Worlds.	ICML	2022	DBLP BibTeX RDF
22	Abdellah Aznag, Vineet Goyal, Noémie Périvier	MNL-Bandit with Knapsacks.	CoRR	2021	DBLP BibTeX RDF
22	Abdellah Aznag, Vineet Goyal, Noémie Périvier	MNL-Bandit with Knapsacks.	EC	2021	DBLP DOI BibTeX RDF
22	Karthik Abinav Sankararaman, Aleksandrs Slivkins	Bandits with Knapsacks beyond the Worst Case.	NeurIPS	2021	DBLP BibTeX RDF
22	Wenbo Ren, Jia Liu 0002, Ness B. Shroff	On Logarithmic Regret for Bandits with Knapsacks.	CISS	2021	DBLP DOI BibTeX RDF
22	Karthik Abinav Sankararaman, Aleksandrs Slivkins	Advances in Bandits with Knapsacks.	CoRR	2020	DBLP BibTeX RDF
22	Thomas Kesselheim, Sahil Singla 0001	Online Learning with Vector Costs and Bandits with Knapsacks.	CoRR	2020	DBLP BibTeX RDF
22	Vanja Doskoc, Tobias Friedrich 0001, Andreas Göbel 0001, Aneta Neumann, Frank Neumann 0001, Francesco Quinzan	Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings.	ECAI	2020	DBLP DOI BibTeX RDF
22	Thomas Kesselheim, Sahil Singla 0001	Online Learning with Vector Costs and Bandits with Knapsacks.	COLT	2020	DBLP BibTeX RDF
22	Vanja Doskoc, Tobias Friedrich 0001, Andreas Göbel 0001, Frank Neumann 0001, Aneta Neumann, Francesco Quinzan	Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings.	CoRR	2019	DBLP BibTeX RDF
22	Nicole Immorlica, Karthik Abinav Sankararaman, Robert E. Schapire, Aleksandrs Slivkins	Adversarial Bandits with Knapsacks.	FOCS	2019	DBLP DOI BibTeX RDF
22	Yuan Ping, Baocang Wang, Shengli Tian, Yuehua Yang, Genyuan Du	Deterministic lattice reduction on knapsacks with collision-free properties.	IET Inf. Secur.	2018	DBLP DOI BibTeX RDF
22	Lin Chen 0009, Guochuan Zhang	Packing Groups of Items into Multiple Knapsacks.	ACM Trans. Algorithms	2018	DBLP DOI BibTeX RDF
22	Theo Karaboghossian, Michele Zito 0001	Easy knapsacks and the complexity of energy allocation problems in the smart grid.	Optim. Lett.	2018	DBLP DOI BibTeX RDF
22	Ashwinkumar Badanidiyuru, Robert Kleinberg, Aleksandrs Slivkins	Bandits with Knapsacks.	J. ACM	2018	DBLP DOI BibTeX RDF
22	Nicole Immorlica, Karthik Abinav Sankararaman, Robert E. Schapire, Aleksandrs Slivkins	Adversarial Bandits with Knapsacks.	CoRR	2018	DBLP BibTeX RDF
22	Hau Chan, Long Tran-Thanh, Bryan Wilder, Eric Rice, Phebe Vayanos, Milind Tambe	Utilizing Housing Resources for Homeless Youth Through the Lens of Multiple Multi-Dimensional Knapsacks.	AIES	2018	DBLP DOI BibTeX RDF
22	Karthik Abinav Sankararaman, Aleksandrs Slivkins	Combinatorial Semi-Bandits with Knapsacks.	AISTATS	2018	DBLP BibTeX RDF
22	Karthik Abinav Sankararaman, Aleksandrs Slivkins	Semi-Bandits with Knapsacks.	CoRR	2017	DBLP BibTeX RDF
22	Akshay Gupte	Convex hulls of superincreasing knapsacks and lexicographic orderings.	Discret. Appl. Math.	2016	DBLP DOI BibTeX RDF
22	Lin Chen 0009, Guochuan Zhang	Packing Groups of Items into Multiple Knapsacks.	STACS	2016	DBLP DOI BibTeX RDF
22	Shipra Agrawal 0001, Nikhil R. Devanur	Linear Contextual Bandits with Knapsacks.	NIPS	2016	DBLP BibTeX RDF
22	Shipra Agrawal 0001, Nikhil R. Devanur, Lihong Li 0001	An efficient algorithm for contextual bandits with knapsacks, and an extension to concave objectives.	COLT	2016	DBLP BibTeX RDF
22	Arthur Flajolet, Patrick Jaillet	Low regret bounds for Bandits with Knapsacks.	CoRR	2015	DBLP BibTeX RDF
22	Qinglong Wang, Xiangmo Zhao	随机背包公钥密码的分析与改进 (Analysis and Improvement of Public Key Cryptosystem Using Random Knapsacks).	计算机科学	2015	DBLP DOI BibTeX RDF
22	Avinash Bhardwaj	Binary Conic Quadratic Knapsacks.		2015	RDF
22	Shipra Agrawal 0001, Nikhil R. Devanur	Bandits with concave rewards and convex knapsacks.	CoRR	2014	DBLP BibTeX RDF
22	Haitao Yu 0006, Fuji Ren	Search Result Diversification via Filling Up Multiple Knapsacks.	CIKM	2014	DBLP DOI BibTeX RDF
22	Shipra Agrawal 0001, Nikhil R. Devanur	Bandits with concave rewards and convex knapsacks.	EC	2014	DBLP DOI BibTeX RDF
22	Yao-Zhang Huang, Ching-Tsung Hsueh, Yi-Ju Chiang, Yen-Chieh Ouyang	A New Cryptosystem Based on Three Knapsacks with Plaintext Encoding.	ICS	2014	DBLP DOI BibTeX RDF
22	Ashwinkumar Badanidiyuru, Robert Kleinberg, Aleksandrs Slivkins	Bandits with Knapsacks	CoRR	2013	DBLP BibTeX RDF
22	Ashwinkumar Badanidiyuru, Robert Kleinberg, Aleksandrs Slivkins	Bandits with Knapsacks.	FOCS	2013	DBLP DOI BibTeX RDF
22	Tong Li, Shenghui Su	Analysis of Success Rate of Attacking Knapsacks from JUNA Cryptosystem by LLL Lattice Basis Reduction.	CIS	2013	DBLP DOI BibTeX RDF
22	Itai Dinur, Orr Dunkelman, Nathan Keller, Adi Shamir	Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems.	IACR Cryptol. ePrint Arch.	2012	DBLP BibTeX RDF
22	Iskander Aliev, Martin Henk	LLL-reduction for integer knapsacks.	J. Comb. Optim.	2012	DBLP DOI BibTeX RDF
22	Valeriy O. Osipyan	Building of alphabetic data protection cryptosystems on the base of equal power knapsacks with Diophantine problems.	SIN	2012	DBLP DOI BibTeX RDF
22	Yuji Nagashima, Noboru Kunihiro	Faster Algorithm for Solving Hard Knapsacks for Moderate Message Length.	ACISP	2012	DBLP DOI BibTeX RDF
22	Orr Dunkelman	From Multiple Encryption to Knapsacks - Efficient Dissection of Composite Problems.	INDOCRYPT	2012	DBLP DOI BibTeX RDF
22	Itai Dinur, Orr Dunkelman, Nathan Keller, Adi Shamir	Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems.	CRYPTO	2012	DBLP DOI BibTeX RDF
22	Christina Büsing, Arie M. C. A. Koster, Manuel Kutschka	Recoverable robust knapsacks: the discrete scenario case.	Optim. Lett.	2011	DBLP DOI BibTeX RDF
22	Anupam Gupta 0001, Ravishankar Krishnaswamy, Marco Molinaro 0001, R. Ravi 0001	Approximation Algorithms for Correlated Knapsacks and Non-Martingale Bandits	CoRR	2011	DBLP BibTeX RDF
22	Anja Becker 0001, Jean-Sébastien Coron, Antoine Joux	Improved Generic Algorithms for Hard Knapsacks.	IACR Cryptol. ePrint Arch.	2011	DBLP BibTeX RDF
22	Daniele Micciancio, Petros Mol	Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions.	IACR Cryptol. ePrint Arch.	2011	DBLP BibTeX RDF
22	Anupam Gupta 0001, Ravishankar Krishnaswamy, Marco Molinaro 0001, R. Ravi 0001	Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits.	FOCS	2011	DBLP DOI BibTeX RDF
22	Anja Becker 0001, Jean-Sébastien Coron, Antoine Joux	Improved Generic Algorithms for Hard Knapsacks.	EUROCRYPT	2011	DBLP DOI BibTeX RDF
22	Christina Büsing, Arie M. C. A. Koster, Manuel Kutschka	Recoverable Robust Knapsacks: Γ-Scenarios.	INOC	2011	DBLP DOI BibTeX RDF
22	Daniele Micciancio, Petros Mol	Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions.	CRYPTO	2011	DBLP DOI BibTeX RDF
22	Iskander Aliev, Martin Henk	Feasibility of Integer Knapsacks.	SIAM J. Optim.	2010	DBLP DOI BibTeX RDF
22	Yingdong Lu, Mark S. Squillante	On approximations for multiple multidimensional stochastic knapsacks.	SIGMETRICS Perform. Evaluation Rev.	2010	DBLP DOI BibTeX RDF
22	Nick Howgrave-Graham, Antoine Joux	New generic algorithms for hard knapsacks.	IACR Cryptol. ePrint Arch.	2010	DBLP BibTeX RDF
22	Nick Howgrave-Graham, Antoine Joux	New Generic Algorithms for Hard Knapsacks.	EUROCRYPT	2010	DBLP DOI BibTeX RDF