This node is currently not available in KNIME v5.4 — instead we’re showing this page for KNIME v5.2. You can use the version menu in the title bar to permanently switch your preferred version. This will also show the link to the update site.

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

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

: Table with geometry information of demand and supply

Output Ports

: 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

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.3.0.202412051033

On NodePit since: 2023-12-06

Last update: 2024-12-18

KNIME versions: From v5.2 to 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!