Efficient algorithms for the uncapacitated single allocation p-hub median problem (Q4228759): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q126352166, #quickstatements; #temporary_batch_1719442853500 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0966-8349(96)00011-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1992790175 / rank | |||
Normal rank | |||
Latest revision as of 10:39, 30 July 2024
scientific article; zbMATH DE number 1257097
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for the uncapacitated single allocation p-hub median problem |
scientific article; zbMATH DE number 1257097 |
Statements
Efficient algorithms for the uncapacitated single allocation p-hub median problem (English)
0 references
1 March 1999
0 references
hub location
0 references
linear programming
0 references
heuristic solution
0 references
simulated annealing
0 references
branch-and-bound
0 references
