Pages that link to "Item:Q3057143"
From MaRDI portal
The following pages link to Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints (Q3057143):
Displaying 9 items.
- Multimodal freight transportation planning: a literature review (Q297170) (← links)
- A conic quadratic formulation for a class of convex congestion functions in network flow problems (Q713098) (← links)
- LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions (Q1384428) (← links)
- An augmented Lagrangian algorithm for large scale multicommodity routing (Q1424783) (← links)
- Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design (Q2064301) (← links)
- Meta partial Benders decomposition for the logistics service network design problem (Q2116853) (← links)
- A parametric programming methodology to solve the Lagrangian dual for network problems with multiple side-constraints (Q2368115) (← links)
- A decomposition method for solving multicommodity network equilibria (Q2670467) (← links)
- How recycled grade is economical? An application of MILP and evolutionary algorithms in intermodal networks under uncertain demand (Q6537137) (← links)
