Comparing Performances of Several Algorithms for Solving 
the Simple Plant Location Problem

Jozef Kratica, DuÜan ToÜic, Vladimir Filipovic and Ivana Ljubic

In literature exist several survey articles about the Simple Plant Location 
Problem (SPLP), which described classical (dual-based) algorithms
and all of their properties. In this paper are described several new 
techniques for solving the SPLP with comparative analysis of their results 
in practice. Results are also compared to dual based algorithms as best classical methods.

AMS subject classification:  90C27, 90C35, 90-08.