Pages that link to "Item:Q6070422"
From MaRDI portal
The following pages link to Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods (Q6070422):
Displaying 3 items.
- LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions (Q1384428) (← links)
- Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints (Q3057143) (← links)
- Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem (Q6091422) (← links)