Computing and Selecting ε-Efficient Solutions of {0, 1}-Knapsack Problems

DOI10.1007/978-3-642-04045-0_32MaRDI QIDQ3556579zbMATHOpenAlexFDO

Authors Emilia Tantar, Oliver Schütze, Carlos A. Coello Coello, El-Ghazali Talbi, José Rui Figueira

Publication date 24 April 2010

Published in Lecture Notes in Economics and Mathematical Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04045-0_32

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• On the optimality of the greedy solutions of the general knapsack problems
• \(0\)-\(1\) knapsack problems
• Exact and approximate algorithms for discounted \(\{0\text{-}1\}\) knapsack problem
• scientific article; zbMATH DE number 7122316
• New trends in exact algorithms for the \(0-1\) knapsack problem
• Exact methods for the knapsack problem and its generalizations
• Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses

Cited in

(4)

• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• Some computational results on real 0-1 knapsack problems
• Comment on 'Some computational results on real 0-1 knapsack problems'
• A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem

This page was built for publication: Computing and Selecting ε-Efficient Solutions of {0, 1}-Knapsack Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3556579)