Branch-and-bound algorithm for a competitive facility location problem (Q336436)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Branch-and-bound algorithm for a competitive facility location problem |
scientific article; zbMATH DE number 6650449
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Branch-and-bound algorithm for a competitive facility location problem |
scientific article; zbMATH DE number 6650449 |
Statements
Branch-and-bound algorithm for a competitive facility location problem (English)
0 references
10 November 2016
0 references
bilevel programming problem
0 references
pseudo-Boolean function
0 references
upper bound
0 references
branch-and-bound algorithm
0 references
local search
0 references
0.9235660433769226
0 references
0.9029147624969482
0 references
0.8801442980766296
0 references
0.8766800165176392
0 references
0.8563773036003113
0 references
