Classical knapsack to geometric knapsack: A journey

Author

Mahapatra, Priya Ranjan Sinha

Author_Institution

Dept. of Comput. Sci. & Eng., Univ. of Kalyani, Kalyani, India

Volume

2

fYear

2011

fDate

8-10 April 2011

Firstpage

84

Lastpage

88

Abstract

Knapsack problems have been extensively studied in operations research for last few decades. We review the method of mapping classical knapsack problems into a new class of geometric knapsack problems. Then it is shown that a wide class of problems in geometric optimization and facility location can be represented as geometric knapsack problems.

Keywords

computational geometry; facility location; geometric programming; knapsack problems; classical knapsack problem; computational geometry; facility location; geometric knapsack problem; geometric optimization; maximum covering location problem; operations research; Computational geometry; Computational modeling; Europe; Heuristic algorithms; Operations research; Optimization; Shape; Computational Geometry; Covering Location Problem; Enclosing Problem; Facility Location; Geometric Knapsack problem; Knapsack problem; Maximum Covering Location Problem;

fLanguage

English

Publisher

ieee

Conference_Titel

Electronics Computer Technology (ICECT), 2011 3rd International Conference on

Conference_Location

Kanyakumari

Print_ISBN

978-1-4244-8678-6

Electronic_ISBN

978-1-4244-8679-3

Type

conf

DOI

10.1109/ICECTECH.2011.5941660

Filename

5941660