Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods (Q6070422)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7768507
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods |
scientific article; zbMATH DE number 7768507 |
Statements
Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods (English)
0 references
21 November 2023
0 references
bundle method
0 references
volume algorithm
0 references
fixed-charge multicommodity network design problem
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
