An extended continuous maximal covering location problem with facility placement

From MaRDI portal





We discuss a formulation of the maximal covering problem when the facilities can be placed anywhere on the set \(R^ 2\). A selection of such problems is given. In each case we shall see that the set of locations for facility placement can be reduced to a finite set. Lastly, one of the problems is then solved using an integer program formulation.











This page was built for publication: An extended continuous maximal covering location problem with facility placement

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