Geometric Knapsack to Facility Location: A Mapping

Priya Ranjan Sinha Mahapatra

Abstract


Knapsack problems have been extensively studied in operations research for last few decades. We review the method of mapping
geometric knapsack problems into facility location 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: Geometric Knapsack Problem, Facility Location, Covering Location Problem, Enclosing Problem, Maximum Covering Location
problem.


Full Text:

PDF


DOI: https://doi.org/10.26483/ijarcs.v2i2.416

Refbacks

  • There are currently no refbacks.




Copyright (c) 2016 International Journal of Advanced Research in Computer Science