On two new formulations for the fixed charge network design problem with shortest path constraints (Q2003438): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cor.2019.04.007 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2019.04.007 / rank | |||
Normal rank | |||
Latest revision as of 18:47, 16 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On two new formulations for the fixed charge network design problem with shortest path constraints |
scientific article |
Statements
On two new formulations for the fixed charge network design problem with shortest path constraints (English)
0 references
8 July 2019
0 references
network design
0 references
bi-level programming
0 references
cutting plane
0 references
branch-and-cut
0 references
