Location problems (Q1062596): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(85)90010-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2211267191 / rank | |||
Normal rank | |||
Revision as of 19:48, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Location problems |
scientific article |
Statements
Location problems (English)
0 references
1985
0 references
Recent developments for several location problems are surveyed. These include: graph theoretic and combinatorial formulations of the simple plant location problem, the NP-hardness of some p-center problems, worst- case bounds for several polynomial-time heuristics for some p-center problems, and a general solution to a class of one facility network problems with convex cost functions.
0 references
facility location
0 references
plant location
0 references
NP-hardness
0 references
p-center
0 references
worst-case bounds
0 references
polynomial-time heuristics
0 references
facility network problems
0 references
