LSCP

The LSCP problem,location set covering problem (LSCP), aims to cover all demand points within a threshold distance,with minimizing the number of facilities. The LSCP problem will be solved by PuLP package.

The node is based on the package PuLP and here are related tools and references:

• Pulp.Solver

Input ports

1. Type: Table
   Input OD list with geometries

   Table with geometry information of demand and supply

Output ports

1. Type: Table
   Demand table with LSCP result

   Demand table with assigned supply point and link