.png){kind=icon}
.png){kind=icon}
Return
SOLVING STRUCTURED MULTIFACILITY LOCATION-PROBLEMS EFFICIENTLY
.png){kind=icon}
OA
AI
DOI：10.1287/trsc.28.2.104.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A generic multifacility location problem is considered which subsumes, as special cases, several NP-hard location problems that have appeared in literature. A unified algorithm is presented which solves the generic problem in polynomial time when problem structure, as defined by interactions between pairs of facilities, satisfies certain properties.
Keywords:
DISTANCE CONSTRAINTS
DISPERSION PROBLEMS
TREE NETWORK
MODELS
FACILITIES
GRAPHS
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.8
Papers:
1.9K
Citations:
8.4K
Organization
No organization information available