Algorithms with guarantee value for Bounded Knapsack Problems
Loading...
Date
2010
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Vilnius Gediminas Technical University
Open Access Color
OpenAIRE Downloads
OpenAIRE Views
Abstract
In this study one-dimensional Knapsack Problems which have many applications in economic area have been studied, then greedy algorithms have been discussed for these problems. Guarantee values of the algorithms have been calculated in order to determine how close the results returned by the algorithms are to optimal solutions. Furthermore complementary problem for Bounded Integer Maximization Knapsack Problem has been defined, and it has been aimed to improve the guarantee value calculated earlier in terms of the complementary problem. © Izmir University of Economics Turkey 2010. © 2014 Elsevier B.V. All rights reserved.
Description
Keywords
Complementary Problem, Greedy Algorithms, Guarantee Value, Integer Programming, Knapsack Problems, Worst-case Analysis, Combinatorial Optimization, Integer Programming, Optimization, Complementary Problems, Greedy Algorithms, Guarantee Value, Knapsack Problems, Worst-case Analysis, Algorithms, Combinatorial optimization, Integer programming, Optimization, Complementary problems, Greedy algorithms, Guarantee value, Knapsack problems, Worst-case analysis, Algorithms, Guarantee Value, Greedy Algorithms, Integer Programming, Knapsack Problems, Worst-Case Analysis, Complementary Problem
Fields of Science
Citation
WoS Q
Scopus Q
Source
24th Mini EURO Conference on Continuous Optimization and Information-Based Technologies in the Financial Sector MEC EurOPT 2010
Volume
Issue
Start Page
183
End Page
189
Collections
