The branch-and-bound algorithm for a competitive facility location problem with the prescribed choice of suppliers (Q5264729)
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 6466087
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The branch-and-bound algorithm for a competitive facility location problem with the prescribed choice of suppliers |
scientific article; zbMATH DE number 6466087 |
Statements
The branch-and-bound algorithm for a competitive facility location problem with the prescribed choice of suppliers (English)
0 references
27 July 2015
0 references
bilevel programming
0 references
optimal noncooperative solution
0 references
pseudo-Boolean function
0 references
branch-and-bound method
0 references
0.9235660433769226
0 references
0.8636983633041382
0 references
0.855942964553833
0 references
0.8416731953620911
0 references
