Pages that link to "Item:Q2429403"
From MaRDI portal
The following pages link to Lagrangian relaxations on networks by \(\varepsilon \)-subgradient methods (Q2429403):
Displaying 9 items.
- Epsilon-subgradient optimization techniques in convex programming and Lagrangian duality (Q1079495) (← links)
- A subgradient method for solving multiproduct network development problems with survivability guarantees (Q1323948) (← links)
- Computational comparisons of dual conjugate gradient algorithms for strictly convex networks. (Q1406626) (← links)
- Parametric programming and Lagrangian relaxation: The case of the network problem with a single side-constraint (Q1814154) (← links)
- Revisiting Lagrangian relaxation for network design (Q2414466) (← links)
- Convergent Lagrangian heuristics for nonlinear minimum cost network flows (Q2480971) (← links)
- Approximate subgradient methods for nonlinearly constrained network flow problems (Q2499376) (← links)
- Approximate Subgradient Methods for Lagrangian Relaxations on Networks (Q3557823) (← links)
- Lagrangian Relaxation via Ballstep Subgradient Methods (Q5388054) (← links)