Pages that link to "Item:Q2414466"
From MaRDI portal
The following pages link to Revisiting Lagrangian relaxation for network design (Q2414466):
Displaying 11 items.
- Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem (Q337245) (← links)
- A Lagrangian relaxation approach for expansion of a highway network (Q512983) (← links)
- A surrogate and Lagrangian approach to constrained network problems (Q920831) (← links)
- Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design (Q2064301) (← links)
- Directed fixed charge multicommodity network design: a cutting plane approach using polar duality (Q2077967) (← links)
- Network design applications of the class of column generation/simplicial decomposition algorithms in convex differentiable optimization (Q2783479) (← links)
- Model of optimal paths design for GMPLS network and algorithm based on Lagrangian relaxation method (Q2808637) (← links)
- A Lagrangian Relaxation Technique for Optimizing Interconnection of Local Area Networks (Q4022925) (← links)
- Delay reduction via Lagrange multipliers in stochastic network optimization (Q5347674) (← links)
- Algorithms – ESA 2005 (Q5475818) (← links)
- Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks (Q6087570) (← links)
