On two new formulations for the fixed charge network design problem with shortest path constraints (Q2003438)
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: On two new formulations for the fixed charge network design problem with shortest path constraints |
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
