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:

Options

Serial id column for demand

Integer id number starting with 0

Serial id column for supply

Integer id number starting with 0

Geometry column for demand points

The Geometry column for demand points

Geometry column for supply points

The Geometry column for supply points

Travel cost between supply and demand

The travel cost between the points of supply and demand

Input critical spatial cost

Critical spatial cost to supply point

Input Ports

Icon

Table with geometry information of demand and supply

Output Ports

Icon

Demand table with assigned supply point and link

Popular Predecessors

  • No recommendations found

Popular Successors

  • No recommendations found

Views

This node has no views

Workflows

  • No workflows found

Links

Developers

You want to see the source code for this node? Click the following button and we’ll use our super-powers to find it for you.

Installation

To use this node in KNIME, install the extension Geospatial Analytics Extension for KNIME from the below update site following our NodePit Product and Node Installation Guide:

v5.2

A zipped version of the software site can be downloaded here.

Plugin provider: SDL, Harvard, Cambridge US
Plugin version: 1.2.0.202311151543
On NodePit since: 2023-12-06
Last update: 2024-04-29
KNIME versions: Since v5.2

Deploy, schedule, execute, and monitor your KNIME workflows locally, in the cloud or on-premises – with our brand new NodePit Runner.

Try NodePit Runner!