Approximation of the competitive facility location problem with MIPs (Q1725607): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cor.2018.12.010 / rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q128744135 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2018.12.010 / rank | |||
Normal rank | |||
Latest revision as of 05:58, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation of the competitive facility location problem with MIPs |
scientific article |
Statements
Approximation of the competitive facility location problem with MIPs (English)
0 references
14 February 2019
0 references
location
0 references
Stackelberg game
0 references
bi-level programming
0 references
cut generation
0 references
branch-and-bound
0 references
0 references
0 references
0 references
0 references
