On a branch-and-bound approach for a Huff-like Stackelberg location problem (Q1027988): Difference between revisions
From MaRDI portal
Latest revision as of 18:03, 1 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On a branch-and-bound approach for a Huff-like Stackelberg location problem |
scientific article |
Statements
On a branch-and-bound approach for a Huff-like Stackelberg location problem (English)
0 references
30 June 2009
0 references
continuous location
0 references
nonlinear programming
0 references
global optimisation algorithms
0 references
Stackelberg competitive location
0 references
0 references
0 references
0 references