On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines (Q2043623)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines |
scientific article; zbMATH DE number 7377482
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines |
scientific article; zbMATH DE number 7377482 |
Statements
On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines (English)
0 references
3 August 2021
0 references
facility location problem
0 references
capacities
0 references
multiple allocation
0 references
single allocation
0 references
NP-hard problem
0 references
treewidth
0 references
pseudopolynomial-time algorithm
0 references
polynomial-time algorithm
0 references
0 references
