On two new formulations for the fixed charge network design problem with shortest path constraints (Q2003438): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.cor.2019.04.007 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2915893890 / rank | |||
Normal rank | |||
Revision as of 18:16, 19 March 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
