A bundle-type algorithm for routing in telecommunication data networks

Authors:
Claude Lemaréchal;Adam Ouorou;Georgios Petrou
Affiliations:
INRIA Rhônes-Alpes, Montbonnot, France 38334 Saint Ismier;France Telecom R&D, CORE/MCN, Issy-Les-Moulineaux cedex 9, France 92794;EDF R&D, Osiris, Clamart, France 92141
Venue:
Computational Optimization and Applications
Year:
2009

Citing 12
Cited 0

A dual method for certain positive semidefinite quadratic programming problems

SIAM Journal on Scientific and Statistical Computing
Proximity control in bundle methods for convex

Mathematical Programming: Series A and B
New variants of bundle methods

Mathematical Programming: Series A and B
Variable metric bundle methods: from conceptual to implementable forms

Mathematical Programming: Series A and B - Special issue on computational nonsmooth optimization
Solving semidefinite quadratic problems within nonsmooth optimization algorithms

Computers and Operations Research
Solving nonlinear multicommodity flow problems by the analytic center cutting plane method

Mathematical Programming: Series A and B - Special issue: interior point methods in theory and practice
Generalized Bundle Methods

SIAM Journal on Optimization
Lagrangian Relaxation

Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
Advances in Solving the Multicommodity-Flow Problem

Interfaces
A Survey of Algorithms for Convex Multicommodity Flow Problems

Management Science
Lagrangian Relaxation via Ballstep Subgradient Methods

Mathematics of Operations Research
ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems

Mathematical Programming: Series A and B - Series B - Special Issue: Nonsmooth Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

To optimize the quality of service through a telecommunication network, we propose an algorithm based on Lagrangian relaxation. The bundle-type dual algorithm is adapted to the present situation, where the dual function is the sum of a polyhedral function (coming from shortest path problems) and of a smooth function (coming from the congestion function).