Pages that link to "Item:Q2655403"
From MaRDI portal
The following pages link to A bundle-type algorithm for routing in telecommunication data networks (Q2655403):
Displaying 13 items.
- Approximated perspective relaxations: a project and lift approach (Q263157) (← links)
- Large-scale optimization with the primal-dual column generation method (Q266408) (← links)
- The proximal Chebychev center cutting plane algorithm for convex additive functions (Q359628) (← links)
- An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems (Q647397) (← links)
- Application of Lagrangian relaxation to computer network control (Q1118382) (← links)
- Models for the piecewise linear unsplittable multicommodity flow problems (Q1753554) (← links)
- Bundle methods for sum-functions with ``easy'' components: applications to multicommodity network design (Q2248747) (← links)
- A decomposition method for solving multicommodity network equilibria (Q2670467) (← links)
- Improving an interior-point algorithm for multicommodity flows by quadratic regularizations (Q2892150) (← links)
- Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem (Q3458834) (← links)
- (Q5323415) (← links)
- The omnipresence of Lagrange (Q5920487) (← links)
- Implementation of an oracle-structured bundle method for distributed optimization (Q6640181) (← links)