Search results for "Knapsack"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
110	Timothy J. Rolfe	An alternative dynamic programming solution for the 0/1 knapsack.	ACM SIGCSE Bull.	2007	DBLP DOI BibTeX RDF	0/1 knapsack, knapsack without repetition, dynamic programming, algorithm analysis, knapsack
95	Alok Singh 0001, Anurag Singh Baghel	A New Grouping Genetic Algorithm for the Quadratic Multiple Knapsack Problem.	EvoCOP	2007	DBLP DOI BibTeX RDF	quadratic multiple knapsack problem, Combinatorial optimization, knapsack problem, grouping genetic algorithm
94	Xin Han, Kazuhisa Makino	Online Knapsack Problems with Limited Cuts.	ISAAC	2009	DBLP DOI BibTeX RDF
81	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
81	Noboru Kunihiro	New Definition of Density on Knapsack Cryptosystems.	AFRICACRYPT	2008	DBLP DOI BibTeX RDF	Low-Weight Knapsack Cryptosystems, Lattice Attack, (pseudo-)density, Shannon Entropy
81	René Beier, Berthold Vöcking	An Experimental Study of Random Knapsack Problems.	Algorithmica	2006	DBLP DOI BibTeX RDF	Random instances, Pareto optimality, Knapsack problem, Experimental study
81	Bryant A. Julstrom	Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem.	GECCO	2005	DBLP DOI BibTeX RDF	greedy operators, quadratic knapsack problem, genetic algorithms
81	R. M. F. Goodman, Anthony J. McAuley	A New Trapdoor Knapsack Public-Key Cryptosystem.	EUROCRYPT	1984	DBLP DOI BibTeX RDF	cryptography, codes, knapsack problem, public key, ciphers
75	Marko Loparic, Hugues Marchand, Laurence A. Wolsey	Dynamic knapsack sets and capacitated lot-sizing.	Math. Program.	2003	DBLP DOI BibTeX RDF
69	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
66	Ingemar Ingemarsson	A new Algorithm for the Solution of the Knapsack Problem.	EUROCRYPT	1982	DBLP DOI BibTeX RDF
63	O. L. Mangasarian	Knapsack feasibility as an absolute value equation solvable by successive linear programming.	Optim. Lett.	2009	DBLP DOI BibTeX RDF	Knapsack feasibility, Absolute value equations, Successive linear programming
63	Yasuyuki Murakami, Tatsuo Douzono, Takeshi Nasako	Relationship between weight of plaintext and successful attacks in knapsack cryptosystems.	ICIS	2009	DBLP DOI BibTeX RDF	knapsack public-key cryptosystem, low-density attack, weight of plaintext, density
63	Kazuo Iwama, Guochuan Zhang	Optimal Resource Augmentations for Online Knapsack.	APPROX-RANDOM	2007	DBLP DOI BibTeX RDF	On-line algorithms, knapsack, resource augmentation
63	Bin Zhang 0003, Hongjun Wu 0001, Dengguo Feng, Feng Bao 0001	Cryptanalysis of a Knapsack Based Two-Lock Cryptosystem.	ACNS	2004	DBLP DOI BibTeX RDF	Two-lock cryptosystem, Cryptanalysis, Knapsack problem
60	Dibyendu Das	Function inlining versus function cloning.	ACM SIGPLAN Notices	2003	DBLP DOI BibTeX RDF	compilers, knapsack problem, cloning, inlining
60	Dibyendu Das	Function inlining versus function cloning.	ACM SIGPLAN Notices	2003	DBLP DOI BibTeX RDF	compilers, knapsack problem, cloning, inlining
59	Yunhong Zhou, Deeparnab Chakrabarty, Rajan M. Lukose	Budget constrained bidding in keyword auctions and online knapsack problems.	WWW	2008	DBLP DOI BibTeX RDF	keyword bidding, multiple-choice knapsack problem, online knapsack problem, sponsored search auction
59	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
57	Yunhong Zhou	Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems.	ISAAC	2006	DBLP DOI BibTeX RDF
57	Brian C. Dean, Michel X. Goemans, Jan Vondrák	Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity.	FOCS	2004	DBLP DOI BibTeX RDF
57	René Beier, Berthold Vöcking	An Experimental Study of Random Knapsack Problems.	ESA	2004	DBLP DOI BibTeX RDF
57	Thomas Erlebach, Hans Kellerer, Ulrich Pferschy	Approximating Multi-objective Knapsack Problems.	WADS	2001	DBLP DOI BibTeX RDF
55	John E. Beasley	Multidimensional Knapsack Problems.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Multidimensional knapsack, Multiconstraint knapsack, Multiple choice knapsack, Combinatorial optimization
55	F. Jorissen, Joos Vandewalle, René Govaerts	Extension of Brickell's Algorithm for Breaking High Density Knapsacks.	EUROCRYPT	1987	DBLP DOI BibTeX RDF
54	Jerzy W. Greblicki, Jerzy Kotowski	Analysis of the Properties of the Harmony Search Algorithm Carried Out on the One Dimensional Binary Knapsack Problem.	EUROCAST	2009	DBLP DOI BibTeX RDF	HSA, Lamarck Effect, knapsack problem, Baldwin Effect
54	Rajeev Kumar, Ashwin H. Joshi, Krishna K. Banka, Peter I. Rockett	Evolution of hyperheuristics for the biobjective 0/1 knapsack problem by multiobjective genetic programming.	GECCO	2008	DBLP DOI BibTeX RDF	0-1 knapsack problem, genetic algorithm, genetic programming, heuristics, combinatorial optimization, multiobjective optimization, optimization methods, pareto front
54	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
54	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
54	César Luis Alonso, Fernando Caro, José Luis Montaña	An Evolutionary Strategy for the Multidimensional 0-1 Knapsack Problem Based on Genetic Computation of Surrogate Multipliers.	IWINAC (2)	2005	DBLP DOI BibTeX RDF	0–1 integer programming, genetic algorithms, Evolutionary computation, combinatorial optimization, knapsack problem
54	Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten	Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack.	ESA	2005	DBLP DOI BibTeX RDF	min-max regret, mi-nimum spanning tree, approximation, shortest path, knapsack, min-max, fptas
54	Sima Uyar, Gülsen Eryigit	Improvements to penalty-based evolutionary algorithms for the multi-dimensional knapsack problem using a gene-based adaptive mutation approach.	GECCO	2005	DBLP DOI BibTeX RDF	multi-dimensional knapsack problem, penalty-based constraint handling, genetic algorithms, adaptive mutation
54	Torsten Fahle, Meinolf Sellmann	Cost Based Filtering for the Constrained Knapsack Problem.	Ann. Oper. Res.	2002	DBLP DOI BibTeX RDF	constrained knapsack problems, constraint programming, optimization constraints, cost based filtering, reduction algorithms
54	Hadas Shachnai, Tami Tamir	On Two Class-Constrained Versions of the Multiple Knapsack Problem.	Algorithmica	2001	DBLP DOI BibTeX RDF	Multimedia on-demand, Approximation algorithms, Resource allocation, Fairness, Utilization, Packing, Knapsack
50	Alexander E. Mohr	Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem.	DCC	2002	DBLP DOI BibTeX RDF	multiple choice knapsack problem, MCKP, data compression, NP-complete, NP-hard, quantization, knapsack problem, bit allocation, rate-distortion optimization
50	Silvano Martello, Paolo Toth	Algorithm 632: A Program for the 0-1 Multiple Knapsack Problem.	ACM Trans. Math. Softw.	1985	DBLP DOI BibTeX RDF	single knapsack problem, branch and bound, multiple knapsack problem
48	Rung Ching Chen, Cheng-Huei Jian	Solving Unbounded Knapsack Problem Using an Adaptive Genetic Algorithm with Elitism Strategy.	ISPA Workshops	2007	DBLP DOI BibTeX RDF
48	Jella Pfeiffer, Franz Rothlauf	Greedy Heuristics and Weight-Coded EAs for Multidimensional Knapsack Problems and Multi-Unit Combinatorial Auctions.	OR	2007	DBLP DOI BibTeX RDF
48	Gagan Aggarwal, Jason D. Hartline	Knapsack auctions.	SODA	2006	DBLP DOI BibTeX RDF
48	Xiaoling Liu, Shou-Ping Gao, De-Liang Gong, Kenli Li 0001	A Parallel Algorithm by Sampling for the Knapsack Problem Based on MIMD Parallel Computers.	PDCAT	2006	DBLP DOI BibTeX RDF
48	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
48	Mark Bartlett, Alan M. Frisch, Youssef Hamadi, Ian Miguel, Armagan Tarim, Chris Unsworth	The Temporal Knapsack Problem and Its Solution.	CPAIOR	2005	DBLP DOI BibTeX RDF
48	René Beier, Berthold Vöcking	Probabilistic analysis of knapsack core algorithms.	SODA	2004	DBLP BibTeX RDF
48	Abhijit Ray, Wu Jigang, Thambipillai Srikanthan	Knapsack Model and Algorithm for HW/SW Partitioning Problem.	International Conference on Computational Science	2004	DBLP DOI BibTeX RDF
48	Meinolf Sellmann	Approximated Consistency for Knapsack Constraints.	CP	2003	DBLP DOI BibTeX RDF	approximation algorithms, global constraints, optimization constraints, relaxed consistency, cost-based filtering
48	Ulrich Pferschy	Dynamic Programming Revisited: Improving Knapsack Algorithms.	Computing	1999	DBLP DOI BibTeX RDF	AMS Subject Classifications: 90C10, 90C39
48	David Pisinger	A Minimal Algorithm for the Bounded Knapsack Problem.	IPCO	1995	DBLP DOI BibTeX RDF
48	J. C. Lagarias 0001	Performance Analysis of Shamir's Attack on the Basic Merkle-Hellman Knapsack Cryptosystem.	ICALP	1984	DBLP DOI BibTeX RDF
44	Guangzhao Cui, Cuiling Li, Xuncai Zhang, Yanfeng Wang, Xinbo Qi, Xiaoguang Li, Haobin Li	Application of DNA Computing by Self-assembly on 0-1 Knapsack Problem.	ISNN (3)	2009	DBLP DOI BibTeX RDF	DNA tile, DNA computing, Knapsack problem, Self-assembly
44	Abu Zafar M. Shahriar, Md. Mostofa Akbar, Mohammad Sohel Rahman, Muhammad Abdul Hakim Newton	A multiprocessor based heuristic for multi-dimensional multiple-choice knapsack problem.	J. Supercomput.	2008	DBLP DOI BibTeX RDF	Multiprocessor systems, Heuristic algorithms, Knapsack problem, Process synchronization, Inter process communication
44	Yalçin Akçay, Haijun Li, Susan H. Xu	Greedy algorithm for the general multidimensional knapsack problem.	Ann. Oper. Res.	2007	DBLP DOI BibTeX RDF	Heuristics, Integer programming, Multidimensional knapsack problems
44	Jun He 0004, Yuren Zhou	A Comparison of GAs Using Penalizing Infeasible Solutions and Repairing Infeasible Solutions on Average Capacity Knapsack.	ISICA	2007	DBLP DOI BibTeX RDF	Genetic Algorithms, Performance Analysis, Constrained Optimization, Knapsack problem, Computation Time
44	Vicky Mak, Tommy Thomadsen	Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem.	J. Comb. Optim.	2006	DBLP DOI BibTeX RDF	Quadratic knapsack, Quadratic selective travelling salesman, Polyhedral analysis, Facets
44	Min Kong, Peng Tian	A New Ant Colony Optimization Applied for the Multidimensional Knapsack Problem.	SEAL	2006	DBLP DOI BibTeX RDF	Binary Ant System, Combinatorial Optimization, Ant Colony Optimization, Multidimensional Knapsack Problem
44	Arnaud Fréville, Saïd Hanafi	The Multidimensional 0-1 Knapsack Problem - Bounds and Computational Aspects.	Ann. Oper. Res.	2005	DBLP DOI BibTeX RDF	multidimensional 0-1 knapsack problem, heuristics and metaheuristics, probabilistic and worst-case analysis, surrogate and composite duality, MIP solvers, preprocessing
44	César Luis Alonso, Fernando Caro, José Luis Montaña	A Flipping Local Search Genetic Algorithm for the Multidimensional 0-1 Knapsack Problem.	CAEPIA	2005	DBLP DOI BibTeX RDF	linear 0–1 integer programming, genetic algorithms, Evolutionary computation, knapsack problem
44	Michael A. Trick	A Dynamic Programming Approach for Consistency and Propagation for Knapsack Constraints.	Ann. Oper. Res.	2003	DBLP DOI BibTeX RDF	knapsack constraints, dynamic programming, global constraints
44	René Beier, Berthold Vöcking	Random knapsack in expected polynomial time.	STOC	2003	DBLP DOI BibTeX RDF	knapsack problem, exact algorithms, average case analysis
44	Dima Grigoriev	Complexity of Positivstellensatz proofs for the knapsack.	Comput. Complex.	2001	DBLP DOI BibTeX RDF	Polynomial calculus, Positivstellensatz proofs, complexity of the knapsack
42	Yong Wei, Suchendra M. Bhandarkar, Kang Li 0001	Client-centered multimedia content adaptation.	ACM Trans. Multim. Comput. Commun. Appl.	2009	DBLP DOI BibTeX RDF	Video personalization, multiple choice multidimensional knapsack problem, hidden Markov models, video indexing
42	Thomas Plantard, Willy Susilo	Broadcast Attacks against Lattice-Based Cryptosystems.	ACNS	2009	DBLP DOI BibTeX RDF	Broadcast attack, lattice-based cryptosystem, knapsack cryptosystem, intersecting lattice
42	Yong Wei, Suchendra M. Bhandarkar, Kang Li 0001	Video personalization in resource-constrained multimedia environments.	ACM Multimedia	2007	DBLP DOI BibTeX RDF	multiple-choice multi-dimensional knapsack problem, request aggregation, video personalization, video summarization
42	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
42	Siming Huang	Inverse Problems of Some NP-Complete Problems.	AAIM	2005	DBLP DOI BibTeX RDF	pseudo-polynomial algorithm, integer programming, Inverse problem, Knapsack problem
39	Weidong Zhang, Baocang Wang, Yupu Hu	A New Knapsack Public-Key Cryptosystem.	IAS	2009	DBLP DOI BibTeX RDF
39	Klaus Jansen	Parameterized approximation scheme for the multiple knapsack problem.	SODA	2009	DBLP DOI BibTeX RDF
39	Sumit Ganguly, Christian Sohler	d-Dimensional Knapsack in the Streaming Model.	ESA	2009	DBLP DOI BibTeX RDF
39	Meinolf Sellmann	On Decomposing Knapsack Constraints for Length-Lex Bounds Consistency.	CP	2009	DBLP DOI BibTeX RDF
39	Maoguo Gong, Licheng Jiao, Wenping Ma 0001, Shuiping Gou	Solving multidimensional knapsack problems by an immune-inspired algorithm.	IEEE Congress on Evolutionary Computation	2007	DBLP DOI BibTeX RDF
39	Moshe Babaioff, Nicole Immorlica, David Kempe 0001, Robert Kleinberg	A Knapsack Secretary Problem with Applications.	APPROX-RANDOM	2007	DBLP DOI BibTeX RDF
39	Daniel C. Vanderster, Nikitas J. Dimopoulos, Rafael Parra-Hernandez, Randall J. Sobie	Evaluation of Knapsack-Based Scheduling Using the NPACI JOBLOG.	HPCS	2006	DBLP DOI BibTeX RDF
39	Bin Ye, Jun Sun 0008, Wenbo Xu 0001	Solving the Hard Knapsack Problems with a Binary Particle Swarm Approach.	ICIC (3)	2006	DBLP DOI BibTeX RDF
39	Daniel C. Vanderster, Nikitas J. Dimopoulos	Sensitivity analysis of knapsack-based task scheduling on the grid.	ICS	2006	DBLP DOI BibTeX RDF
39	Kwok Yip Szeto, Jian Zhang	Adaptive Genetic Algorithm and Quasi-parallel Genetic Algorithm: Application to Knapsack Problem.	LSSC	2005	DBLP DOI BibTeX RDF
39	Crina Grosan	Multiobjective 0/1 Knapsack Problem using Adaptive epsilon-Dominance.	WSC	2004	DBLP DOI BibTeX RDF
39	Darrell R. Ulm, Johnnie W. Baker, Michael C. Scherger	Solving a 2D Knapsack Problem Using a Hybrid Data-Parallel/Control Style of Computing.	IPDPS	2004	DBLP DOI BibTeX RDF
39	Crina Grosan, Mihai Oltean	Improving the Performance of Evolutionary Algorithms for the Multiobjective 0/1 Knapsack Problem Using e-Dominance.	International Conference on Computational Science	2004	DBLP DOI BibTeX RDF
39	Hui Han, Hongxun Yao, Shaohui Liu, Yan Liu 0014	A Fragile Watermarking Based on Knapsack Problem.	PCM (3)	2004	DBLP DOI BibTeX RDF
39	Yingjie Liu	The Fully Polynomial Approximation Algorithm for the 0-1 Knapsack Problem.	Theory Comput. Syst.	2002	DBLP DOI BibTeX RDF
39	Stavros G. Kolliopoulos, George Steiner	Partially-Ordered Knapsack and Applications to Scheduling.	ESA	2002	DBLP DOI BibTeX RDF
39	Isto Aho	On the Approximability of Interactive Knapsack Problems.	SOFSEM	2001	DBLP DOI BibTeX RDF
39	Brent A. Smolinski	Approximating the 0-1 Multiple Knapsack Problem with Agent Decomposition and Market Negotiation.	IEA/AIE	2000	DBLP DOI BibTeX RDF
39	Alfredo Goldman, Denis Trystram	An Efficient Parallel Algorithm for Solving the Knapsack Problem on the Hypercube.	IPPS	1997	DBLP DOI BibTeX RDF
39	P. Schöbe, James L. Massey	Fast Authentication in a Trapdoor - Knapsack Public Key Cryptosystem.	EUROCRYPT	1982	DBLP DOI BibTeX RDF
39	Ellis Horowitz, Sartaj Sahni	Computing Partitions with Applications to the Knapsack Problem.	J. ACM	1974	DBLP DOI BibTeX RDF
36	Kan Takeuchi, John Lin, Yan Chen 0014, Thomas A. Finholt	Shake it up baby: scheduling with package auctions.	EC	2007	DBLP DOI BibTeX RDF	resource allocation, mechanism design, combinatorial auction, cyberinfrastructure, collaboratory
36	Hadas Shachnai, Tami Tamir	Polynominal time approximation schemes for class-constrained packing problem.	APPROX	2000	DBLP DOI BibTeX RDF
35	Zhigang Ren, Zuren Feng	An ant colony optimization approach to the multiple-choice multidimensional knapsack problem.	GECCO	2010	DBLP DOI BibTeX RDF	multiple-choice multidimensional knapsack problem, ant colony optimization, lagrangian relaxation
35	Justin Yip, Pascal Van Hentenryck	Length-lex bound consistency for knapsack constraints.	SAC	2009	DBLP DOI BibTeX RDF	length-lex, set variable, knapsack, bound consistency
35	Ling Wang 0009, Xiuting Wang, Minrui Fei	A novel quantum-inspired pseudorandom proportional evolutionary algorithm for the multidimensional knapsack problem.	GEC Summit	2009	DBLP DOI BibTeX RDF	pseudo-random proportional operation, multidimensional knapsack problem, quantum-inspired evolutionary algorithm
35	Ricardo P. Beausoleil, M. Gulnara Baldoquin, Rodolfo A. Montejo	Multi-start and path relinking methods to deal with multiobjective knapsack problems.	Ann. Oper. Res.	2008	DBLP DOI BibTeX RDF	Multiple objective metaheuristics, Multi-start methods, Knapsack problems, Path relinking
35	Yannick Vimont, Sylvain Boussier, Michel Vasquez	Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem.	J. Comb. Optim.	2008	DBLP DOI BibTeX RDF	Implicit enumeration, Variable fixing, Reduced costs, Constraint propagation, Multidimensional knapsack problem
35	Sandro Pirkwieser, Günther R. Raidl, Jakob Puchinger	A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem.	Recent Advances in Evolutionary Computation for Combinatorial Optimization	2008	DBLP DOI BibTeX RDF	Knapsack Constrained Maximum Spanning Tree, Lagrangian Decomposition, Volume Algorithm, Evolutionary Algorithm, Local Search, Hybrid Approach
35	Yunhong Zhou, Victor Naroditskiy	Algorithm for stochastic multiple-choice knapsack problem and application to keywords bidding.	WWW	2008	DBLP DOI BibTeX RDF	keyword bidding, multiple-choice knapsack problem, sponsored search auction, stochastic optimization
35	Ying Zhou, Zhanghui Kuang, Jiahai Wang	A Chaotic Neural Network Combined Heuristic Strategy for Multidimensional Knapsack Problem.	ISICA	2008	DBLP DOI BibTeX RDF	Heuristic Strategy, Chaotic Neural Network, Multidimensional Knapsack Problem
35	Dominique Quadri, Éric Soutif	Rewriting integer variables into zero-one variables: Some guidelines for the integer quadratic multi-knapsack problem.	Oper. Res.	2007	DBLP DOI BibTeX RDF	integer quadratic knapsack problem, separable objective function, direct expansion, binary expansion, piecewise interpolation
35	Abdelkader Sbihi	A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	Combinatorial optimization, Branch and bound, Knapsack, Sequential algorithm
35	Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten	An Efficient Implementation for the 0-1 Multi-objective Knapsack Problem.	WEA	2007	DBLP DOI BibTeX RDF	multi-objective knapsack problem, dynamic programming, combinatorial optimization, efficient solutions, dominance relations
35	C. Patvardhan 0001, Apurva Narayan, Anand Srivastav	Enhanced Quantum Evolutionary Algorithms for Difficult Knapsack Problems.	PReMI	2007	DBLP DOI BibTeX RDF	Evolutionary Algorithms, knapsack, Quantum
35	Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten	A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem.	ESA	2007	DBLP DOI BibTeX RDF	Multi-objective knapsack problem, dynamic programming, combinatorial optimization, approximation, dominance relations