Search results for "knapsack"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
18	Gregory B. Sorkin	Some Notes on Random Satisfiability.	SAGA	2001	DBLP DOI BibTeX RDF
18	Lucian Ilie, Arto Salomaa	On the Expressiveness of Subset-Sum Representations.	Acta Informatica	2000	DBLP DOI BibTeX RDF
18	Pankaj Batra	Modeling and efficient optimization for object-based scalability and some related problems.	IEEE Trans. Image Process.	2000	DBLP DOI BibTeX RDF
18	Nor Jaidi Tuah, Mohan Kumar, Svetha Venkatesh	A Performance Model of Speculative Prefetching in Distributed Information Systems.	IPPS/SPDP	1999	DBLP DOI BibTeX RDF
18	Phong Q. Nguyen, Jacques Stern	Cryptanalysis of a Fast Public Key Cryptosystem Presented at SAC '97.	Selected Areas in Cryptography	1998	DBLP DOI BibTeX RDF
18	Laureano F. Escudero, Silvano Martello, Paolo Toth	A Framework for Tightening 0-1 Programs Based on Extensions of Pure 0-1 KP and SS Problems.	IPCO	1995	DBLP DOI BibTeX RDF
18	Glenn A. Orton	A Multiple-Iterated Trapdoor for Dense Compact Knapsacks.	EUROCRYPT	1994	DBLP DOI BibTeX RDF
18	J. C. Lagarias 0001, Andrew M. Odlyzko	Solving Low-Density Subset Sum Problems	J. ACM	1985	DBLP DOI BibTeX RDF
18	Shimon Even, Yacov Yacobi	Cryptocomplexity and NP-Completeness.	ICALP	1980	DBLP DOI BibTeX RDF
18	Lena Chang, James F. Korsh	Canonical Coin Changing and Greedy Solutions.	J. ACM	1976	DBLP DOI BibTeX RDF
15	Ole-Christoffer Granmo, B. John Oommen	Solving Stochastic Nonlinear Resource Allocation Problems Using a Hierarchy of Twofold Resource Allocation Automata.	IEEE Trans. Computers	2010	DBLP DOI BibTeX RDF	Nonlinear knapsack problems, resource allocation, stochastic optimization, learning automata, hierarchical learning
15	Wu Jigang, Thambipillai Srikanthan, Guang Chen	Algorithmic Aspects of Hardware/Software Partitioning: 1D Search Algorithms.	IEEE Trans. Computers	2010	DBLP DOI BibTeX RDF	algorithm, complexity, heuristic, knapsack problem, Hardware/software partitioning
15	Nattavut Wiriyasermkul, Veera Boonjing, Pisit Chanvarasuth	A Meiosis Genetic Algorithm.	ITNG	2010	DBLP DOI BibTeX RDF	Meiosis Genetic Algorithm, Genetic Algorithm, Knapsack Problem
15	Maxwell Walton, Gary Gréwal, Gerarda A. Darlington	Parallel FPGA-based implementation of scatter search.	GECCO	2010	DBLP DOI BibTeX RDF	0-1 knapsack problem, field programmable gate arrays, pipelining, hardware acceleration, data parallelism, scatter search
15	András Prékopa, Csaba I. Fábián	Cutting-Stock Problem.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Cutting pattern, Knapsack problem, Column generation, Cutting-stock problem
15	Hans van Maaren	Simplicial Pivoting Algorithms for Integer Programming.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Simplicial algorithms, Horn formulas, Integer programming, Knapsack problem
15	Stephen A. Vavasis	Complexity Theory: Quadratic Programming.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Trust region problem, Strongly polynomial time, Simplicial constraints, Box constraints, Ellipsoid method, Approximation algorithms, Complexity, NP-complete, NP-hard, Quadratic programming, Polynomial time, Knapsack problem, Interior point methods, Local minimization
15	Kalyan Kuppuswamy, Daniel C. Lee 0001	An analytic approach to efficiently computing call blocking probabilities for multiclass WDM networks.	IEEE/ACM Trans. Netw.	2009	DBLP DOI BibTeX RDF	knapsack approximation, multiclass fixed-point approximation, optical WDM networks, performance evaluation, blocking probability, loss networks
15	Matteo Fischetti, Michele Monaci	Light Robustness.	Robust and Online Large-Scale Optimization	2009	DBLP DOI BibTeX RDF	Multi-dimensional Knapsack, Train Timetabling, Integer Linear Programming, Stochastic Programming, Robust optimization
15	Xiaofang Zhang, Huamao Shan, Ju Qian	Resource-Aware Test Suite Optimization.	QSIC	2009	DBLP DOI BibTeX RDF	test suite optimization, 0-1 knapsack, regression testing, resource-aware
15	Tomohiro Shintani, Ryuichi Sakai	Cryptanalysis on 2 Dimensional Subset-sum Public Key Cryptosystem.	ICIS	2009	DBLP DOI BibTeX RDF	knapsack public key cryptosystem, cryptanalysis, lattice, shortest vector problem
15	Christian Klamler, Ulrich Pferschy, Stefan Ruzika	Committee Selection with a Weight Constraint Based on Lexicographic Rankings of Individuals.	ADT	2009	DBLP DOI BibTeX RDF	knapsack constraint, committee selection
15	Shamik Sengupta, Mainak Chatterjee	Designing Auction Mechanisms for Dynamic Spectrum Access.	Mob. Networks Appl.	2008	DBLP DOI BibTeX RDF	dynamic spectrum access (DSA), auctions, cognitive radio, knapsack, winner determination
15	Lucian Prodan, Mihai Udrescu, Mircea Vladutiu	Fault-Tolerant Memory Design and Partitioning Issues in Embryonics.	ICES	2008	DBLP DOI BibTeX RDF	genetic algorithms, fault tolerance, reliability, partitioning, memory architecture, knapsack problem, Embryonics
15	Terence Kelly, Andrew Byde	Generating k-best solutions to auction winner determination problems.	SIGecom Exch.	2006	DBLP DOI BibTeX RDF	decision support, auctions, knapsack problems, procurement, preference elicitation, k-shortest paths
15	Giuliana Carello, Federico Della Croce, Andrea Grosso, Marco Locatelli 0001	A "maximum node clustering" problem.	J. Comb. Optim.	2006	DBLP DOI BibTeX RDF	Maximum Node Clustering, Complexity, Approximation, Knapsack
15	Aynur Kahraman, H. Aydolu Seven	Healthy daily meal planner.	GECCO Workshops	2005	DBLP DOI BibTeX RDF	diet problem, multi-objective multi-constrained knapsack problem, genetic algorithms, multi-objective optimization
15	Maria A. Osorio, German Cuaya-Simbro	Hard Problem Generation for MKP.	ENC	2005	DBLP DOI BibTeX RDF	Multdimensional Knapsack Problem, Hard Problems Generation, Integer Programming
15	Jan Cosyn, Karl Sigman	Stochastic Networks: Admission and Routing Using Penalty Functions.	Queueing Syst. Theory Appl.	2004	DBLP DOI BibTeX RDF	exponential penalty, stochastic knapsack, admission control, routing control
15	Eduardo Conde	An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterion.	Math. Program.	2004	DBLP DOI BibTeX RDF	complexity, knapsack problem, robust optimization, polynomial algorithm
15	Athanassios Boulis, Mani B. Srivastava	Node-Level Energy Management for Sensor Networks in the Presence of Multiple Applications.	Wirel. Networks	2004	DBLP DOI BibTeX RDF	distributed mobile applications, dynamic and stochastic knapsack problem, sensor networks, admission control, energy management
15	Meinolf Sellmann, Torsten Fahle	Constraint Programming Based Lagrangian Relaxation for the Automatic Recording Problem.	Ann. Oper. Res.	2003	DBLP DOI BibTeX RDF	maximum weighted stable set constraint, knapsack constraint, Lagrangian relaxation, optimization constraint
15	Johannes Merkle	Multi-round passive attacks on server-aided RSA protocols.	CCS	2000	DBLP DOI BibTeX RDF	server aided secret computations, digital signatures, RSA, knapsack problem
15	Gary Valentin, Michael Zuliani, Daniel C. Zilio, Guy M. Lohman, Alan Skelley	DB2 Advisor: An Optimizer Smart Enough to Recommend Its Own Indexes.	ICDE	2000	DBLP DOI BibTeX RDF	Index Selection, Knapsack Algorithm, Optimizer, Relational Database, Database Design, Self-Tuning, Auto-Tuning, Wizard
15	Paul Camion, Hervé Chabanne	On the Powerline System.	Appl. Algebra Eng. Commun. Comput.	1999	DBLP DOI BibTeX RDF	Chor-Rivest, Powerline, Fractional Powerline, Quadratic Fractional Power System, Berlekamp-Massey, RSA, Identification, Public Key Cryptosystem (PKC), Knapsack
15	Reuven Bar-Yehuda	Using Homogenous Weights for Approximating the Partial Cover Problem.	SODA	1999	DBLP BibTeX RDF	approximation algorithm, set cover, vertex cover, knapsack, covering problems, local ratio, partial covering
15	Chi-Sung Laih, Min-Jea Gau	Cryptanalysis if a Diophantine Equation Oriented Public Key Cryptosystem.	IEEE Trans. Computers	1997	DBLP DOI BibTeX RDF	knapsack cryptosystem, cryptography, cryptanalysis, Public keys
15	Naoyuki Kubota, Toshio Fukuda	Genetic algorithms with age structure.	Soft Comput.	1997	DBLP DOI BibTeX RDF	Age Structure, Genetic Algorithm, Optimization, Knapsack Problem
15	Kequin Li	Probabilistic analysis of an approximation algorithm for maximum subset sum using recurrence relations.	ACM Southeast Regional Conference	1995	DBLP DOI BibTeX RDF	maximum subset sum, multiprogrammed parallel system, sequential selection, approximation algorithm, probabilistic analysis, knapsack, recurrence relations
15	David Eppstein	Finding the k Shortest Paths	FOCS	1994	DBLP DOI BibTeX RDF	maximum inscribed polygons, implicit representation, dynamic programming problems, algorithms, sequence alignment, knapsack problem, vertices, digraph, k shortest paths
12	Matthew E. Scherer, Raymond R. Hill, Brian J. Lunday, Bruce A. Cox, Edward D. White	Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis.	Comput. Oper. Res.	2024	DBLP DOI BibTeX RDF
12	Dung T. K. Ha, Canh V. Pham, Tan D. Tran	Improved approximation algorithms for k-submodular maximization under a knapsack constraint.	Comput. Oper. Res.	2024	DBLP DOI BibTeX RDF
12	Qing Zhou, Jin-Kao Hao, Zhong-Zhong Jiang, Qinghua Wu 0002	An effective hybrid search method for the quadratic knapsack problem with conflict graphs.	J. Oper. Res. Soc.	2024	DBLP DOI BibTeX RDF
12	Ahmed Noaman Karar, Ashraf Labib, Dylan Jones	A resilience-based maintenance optimisation framework using multiple criteria and Knapsack methods.	Reliab. Eng. Syst. Saf.	2024	DBLP DOI BibTeX RDF
12	Samah Boukhari, Mhand Hifi	Combining local branching and descent method for solving the multiple-choice knapsack problem with setups.	Int. Trans. Oper. Res.	2024	DBLP DOI BibTeX RDF
12	Malek Masmoudi, Yassine Adouani, Bassem Jarboui	LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup.	Int. Trans. Oper. Res.	2024	DBLP DOI BibTeX RDF
12	Dmitry V. Gribanov, I. A. Shumilov, Dmitriy S. Malyshev	Structured $(\min ,+)$-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems.	Optim. Lett.	2024	DBLP DOI BibTeX RDF
12	Minami Sato, Sosuke Minamoto, Ryuichi Sakai, Yasuyuki Murakami	High-Density Knapsack Cryptosystem Using Shifted-Odd and Super-Increasing Sequence.	IEICE Trans. Fundam. Electron. Commun. Comput. Sci.	2024	DBLP DOI BibTeX RDF
12	Yann Disser, Max Klimm, Annette Lutz, David Weckbecker	Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows.	SIAM J. Discret. Math.	2024	DBLP DOI BibTeX RDF
12	Zhongzheng Tang, Jingwen Chen, Chenhao Wang 0001	Greedy+Singleton: An efficient approximation algorithm for k-submodular knapsack maximization.	Theor. Comput. Sci.	2024	DBLP DOI BibTeX RDF
12	Jiaxi Wu, Wenquan Yang, Xinming Han, Yunzhe Qiu, Andrei Gudkov, Jie Song 0002	Hotspot resolution in cloud computing: A Γ-robust knapsack approach for virtual machine migration.	J. Parallel Distributed Comput.	2024	DBLP DOI BibTeX RDF
12	Yang Yang	An upper bound of the mutation probability in the genetic algorithm for general 0-1 knapsack problem.	CoRR	2024	DBLP DOI BibTeX RDF
12	Peyman Khezr, Vijay Mohan, Lionel Page	Strategic Bidding in Knapsack Auctions.	CoRR	2024	DBLP DOI BibTeX RDF
12	Moritz Buchem, Paul Deuker, Andreas Wiese	Approximating the Geometric Knapsack Problem in Near-Linear Time and Dynamically.	CoRR	2024	DBLP DOI BibTeX RDF
12	Jonathan Goohs, Georgel Savin, Lucas Starks, Josiah Dykstra, William Casey	Adversarial Knapsack and Secondary Effects of Common Information for Cyber Operations.	CoRR	2024	DBLP DOI BibTeX RDF
12	Junyoung Kim, Kyungsik Lee	Non-convex relaxation and 1/2-approximation algorithm for the chance-constrained binary knapsack problem.	CoRR	2024	DBLP DOI BibTeX RDF
12	Jihyeok Jung, Chan-Oi Song, Deok-Joo Lee, Kiho Yoon	Optimal Mechanism in a Dynamic Stochastic Knapsack Environment.	CoRR	2024	DBLP DOI BibTeX RDF
12	Yang Yang	A constant time complexity algorithm for the unbounded knapsack problem with bounded coefficients.	CoRR	2024	DBLP DOI BibTeX RDF
12	Mohammad Saleh Vahdatpour	Addressing The Knapsack Challenge Through Cultural Algorithm Optimization.	CoRR	2024	DBLP DOI BibTeX RDF
12	Kentaro Ohno, Tatsuhiko Shirai, Nozomu Togawa	Toward Practical Benchmarks of Ising Machines: A Case Study on the Quadratic Knapsack Problem.	CoRR	2024	DBLP DOI BibTeX RDF
12	Ivan Sergeev	On contention resolution for the hypergraph matching, knapsack, and k-column sparse packing problems.	CoRR	2024	DBLP DOI BibTeX RDF
12	Kilian Grage, Klaus Jansen	Convolution and Knapsack in Higher Dimensions.	CoRR	2024	DBLP DOI BibTeX RDF
12	Guilherme Dias da Fonseca, Yan Gerard	Shadoks Approach to Knapsack Polygonal Packing.	CoRR	2024	DBLP DOI BibTeX RDF
12	Alberto Santini, Enrico Malaguti	The min-Knapsack problem with compactness constraints and applications in statistics.	Eur. J. Oper. Res.	2024	DBLP DOI BibTeX RDF
12	Florette Martinez	A Variation on Knellwolf and Meier's Attack on the Knapsack Generator.	IACR Cryptol. ePrint Arch.	2024	DBLP BibTeX RDF
12	Dipayan Das 0001, Antoine Joux	Key Recovery Attack on the Partial Vandermonde Knapsack Problem.	IACR Cryptol. ePrint Arch.	2024	DBLP BibTeX RDF
12	Lin Chen 0009, Jiayi Lian, Yuchen Mao, Guochuan Zhang	Faster Algorithms for Bounded Knapsack and Bounded Subset Sum Via Fine-Grained Proximity Results.	SODA	2024	DBLP DOI BibTeX RDF
12	Shuang Cui, Kai Han 0003, He Huang	Deletion-Robust Submodular Maximization with Knapsack Constraints.	AAAI	2024	DBLP DOI BibTeX RDF
12	Jihyeok Jung, Chan-Oi Song, Deok-Joo Lee, Kiho Yoon	Optimal Mechanism in a Dynamic Stochastic Knapsack Environment.	AAAI	2024	DBLP DOI BibTeX RDF
12	Zhen Song, Wenjian Luo, Peilan Xu, Zipeng Ye, Kesheng Chen	An Indicator Based Evolutionary Algorithm for Multiparty Multiobjective Knapsack Problems.	Intelligent Information Processing (1)	2024	DBLP DOI BibTeX RDF
12	Dipayan Das 0001, Antoine Joux	Key Recovery Attack on the Partial Vandermonde Knapsack Problem.	EUROCRYPT (6)	2024	DBLP DOI BibTeX RDF
12	Hans-Joachim Böckenhauer, Fabian Frei, Peter Rossmanith	Removable Online Knapsack and Advice.	STACS	2024	DBLP DOI BibTeX RDF
12	Matthias Gehnen, Henri Lotze, Peter Rossmanith	Online Simple Knapsack with Bounded Predictions.	STACS	2024	DBLP DOI BibTeX RDF
12	Qizheng He, Zhean Xu	Simple and Faster Algorithms for Knapsack.	SOSA	2024	DBLP DOI BibTeX RDF
12	Marzan Binte Abid, Shuvo Shaha, Upama Kabir, Md. Fahim Arefin	Parallelized 0/1 Knapsack Algorithm Optimization in CPU-GPU-Based Heterogeneous System with Algorithm-based Fault Tolerance.	IMCOM	2024	DBLP DOI BibTeX RDF
12	Palash Dey, Sudeshna Kolay, Sipra Singh	Knapsack: Connectedness, Path, and Shortest-Path.	LATIN (2)	2024	DBLP DOI BibTeX RDF
12	Laurent Gourvès, Aris Pagourtzis	Removable Online Knapsack with Bounded Size Items.	SOFSEM	2024	DBLP DOI BibTeX RDF
12	Karam M. Sallam, Amr A. Abohany, Rizk Masoud Rizk-Allah	Correction to: An enhanced multi-operator differential evolution algorithm for tackling knapsack optimization problem.	Neural Comput. Appl.	2023	DBLP DOI BibTeX RDF
12	Méziane Aïder, Oussama Gacem, Mhand Hifi	Effect of learning strategies in an evolutionary method: the case of the bi-objective quadratic multiple knapsack problem.	Neural Comput. Appl.	2023	DBLP DOI BibTeX RDF
12	Karam M. Sallam, Amr A. Abohany, Rizk M. Rizk-Allahi	An enhanced multi-operator differential evolution algorithm for tackling knapsack optimization problem.	Neural Comput. Appl.	2023	DBLP DOI BibTeX RDF
12	Yan Kang 0003, Haining Wang, Bin Pu, Jiansong Liu, Shin-Jye Lee, Xuekun Yang, Liu Tao	TMHSCA: a novel hybrid two-stage mutation with a sine cosine algorithm for discounted {0-1} knapsack problems.	Neural Comput. Appl.	2023	DBLP DOI BibTeX RDF
12	Yan Kang 0003, Haining Wang, Bin Pu, Jiansong Liu, Shin-Jye Lee, Xuekun Yang, Liu Tao	Correction to: TMHSCA: a novel hybrid two-stage mutation with a sine cosine algorithm for discounted {0-1} knapsack problems.	Neural Comput. Appl.	2023	DBLP DOI BibTeX RDF
12	Qiang Luo, Yunqing Rao	Heuristic algorithms for the special knapsack packing problem with defects arising in aircraft arrangement.	Expert Syst. Appl.	2023	DBLP DOI BibTeX RDF
12	Jingjing Tan, Ruiqi Yang, Yapu Zhang, Mingyue Zhu	Streaming Algorithms for Non-Submodular Functions Maximization with d-Knapsack Constraint on the Integer Lattice.	Asia Pac. J. Oper. Res.	2023	DBLP DOI BibTeX RDF
12	Ao Zhao, Qian Liu, Yang Zhou 0018, Min Li	Approximation Algorithms for Matroid and Knapsack Means Problems.	Asia Pac. J. Oper. Res.	2023	DBLP DOI BibTeX RDF
12	Imen Ben Mansour	An Effective Hybrid Ant Colony Optimization for the Knapsack Problem Using Multi-Directional Search.	SN Comput. Sci.	2023	DBLP DOI BibTeX RDF
12	Stanislaw Gawiejnowicz, Nir Halman, Hans Kellerer	Knapsack problems with position-dependent item weights or profits.	Ann. Oper. Res.	2023	DBLP DOI BibTeX RDF
12	Seulgi Joung, Seyoung Oh, Kyungsik Lee	Comparative analysis of linear programming relaxations for the robust knapsack problem.	Ann. Oper. Res.	2023	DBLP DOI BibTeX RDF
12	Moses Ganardi, Markus Lohrey, Georg Zetzsche	Knapsack and the power word problem in solvable Baumslag-Solitar groups.	Int. J. Algebra Comput.	2023	DBLP DOI BibTeX RDF
12	Yasmine Beck, Ivana Ljubic, Martin Schmidt 0003	Exact methods for discrete ${\varGamma }$-robust interdiction problems with an application to the bilevel knapsack problem.	Math. Program. Comput.	2023	DBLP DOI BibTeX RDF
12	Shaoze Li, Zhibin Deng, Cheng Lu 0007, Junhao Wu, Jinyu Dai, Qiao Wang	An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints.	Comput. Optim. Appl.	2023	DBLP DOI BibTeX RDF
12	Cheng-Ying Hsieh, Yi Ren 0001, Jyh-Cheng Chen	Edge-Cloud Offloading: Knapsack Potential Game in 5G Multi-Access Edge Computing.	IEEE Trans. Wirel. Commun.	2023	DBLP DOI BibTeX RDF
12	Xiaotong Li, Wei Fang 0001, Shuwei Zhu	An improved binary quantum-behaved particle swarm optimization algorithm for knapsack problems.	Inf. Sci.	2023	DBLP DOI BibTeX RDF
12	Ali Aouad, Danny Segev	Technical Note - An Approximate Dynamic Programming Approach to the Incremental Knapsack Problem.	Oper. Res.	2023	DBLP DOI BibTeX RDF
12	Kimleang Kea, Chansreynich Huot, Youngsun Han	Leveraging Knapsack QAOA Approach for Optimal Electric Vehicle Charging.	IEEE Access	2023	DBLP DOI BibTeX RDF
12	Arij Mkaouar, Skander Htiouech, Habib Chabchoub	Modified Artificial Bee Colony Algorithm for Multiple-Choice Multidimensional Knapsack Problem.	IEEE Access	2023	DBLP DOI BibTeX RDF
12	Mohammed Lalou, Hamamache Kheddouci	Pseudo-polynomial algorithms for solving the Knapsack Problem with dependencies between items.	Comput. Oper. Res.	2023	DBLP DOI BibTeX RDF
12	Shraddha Ghatkar, Ashwin Arulselvan, Alec Morton	Solution techniques for Bi-level Knapsack Problems.	Comput. Oper. Res.	2023	DBLP DOI BibTeX RDF
12	I. Esra Büyüktahtakin	Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems.	Comput. Oper. Res.	2023	DBLP DOI BibTeX RDF
12	Ciriaco D'Ambrosio, Federica Laureana, Andrea Raiconi, Gaetano Vitale	The Knapsack Problem with forfeit sets.	Comput. Oper. Res.	2023	DBLP DOI BibTeX RDF