A branch-and-bound algorithm for the maximum capture problem with random utilities (Q322866)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6636211
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-bound algorithm for the maximum capture problem with random utilities |
scientific article; zbMATH DE number 6636211 |
Statements
A branch-and-bound algorithm for the maximum capture problem with random utilities (English)
0 references
7 October 2016
0 references
facility location
0 references
branch and bound
0 references
maximum capture
0 references
random utility model
0 references
0 references
0 references
0.887910008430481
0 references
0.84341961145401
0 references
0.8312714695930481
0 references
0.8244024515151978
0 references
0.8187137246131897
0 references
