Lagrangienne decomposition for general step cost single path network design (2002) [1 citations — 0 self]

Download:

by Coden Trita/mat--os, Mikael Prytz, Mikael Prytzt

Department of Mathematics, Royal institute of technology, SE-100 44

http://www.math.kth.se/~mikaelp/research/nds.ps

Add To MetaCart

Popular Tags

No tags have been applied to this document.

BibTeX | Add To MetaCart

@INPROCEEDINGS{Trita/mat--os02lagrangiennedecomposition,
    author = {Coden Trita/mat--os and Mikael Prytz and Mikael Prytzt},
    title = {Lagrangienne decomposition for general step cost single path network design},
    booktitle = {Department of Mathematics, Royal institute of technology, SE-100 44},
    year = {2002}
}

Abstract:

Lagrangian decomposition for general step cost single path network design by

Citations

7703	Computers and Intractability: A Guide to the Theory of NP-Completeness – Garey, Johnson - 1979
1374	Data Networks – Bertsekas, Gallager - 1992
888	Network Flows: Theory, Algorithms, and Applications – Ahuja, Magnanti, et al. - 1993
64	Telecommunications network design algorithms – Kershenbaum - 1993
47	Capacitated network design - Polyhedral structure and computation – Bienstock, Gunluk - 1996
43	Minimum cost capacity installation for multicommodity network flows – Bienstock, Chopra, et al. - 1998
34	Lagrangean decomposition: A model yielding stronger lagrangean bounds – Guignard, Kim - 1987
24	A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems – Dahl, Stoer - 1998
22	Models for Planning Capacity Expansion in Local Access Telecommunication Networks – BALAKRISHNAN, MAGNANTI, et al. - 1991
20	A Lagrangean Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem – Holmberg, Yuan - 1996
6	Exact solution of multicommodity network optimization problems with general step cost functions – Gabrel, Knippel, et al. - 1999
5	ATM Network design: Traffic models and optimization-based heuristics (1997).to appear, Telecomm. Systems – Bienstock, Saniee - 2001
5	User's Guide for NOA 3.0: A Fortran Package for Convex Nondifferentiable Optimization – Kiwiel - 1993
4	A lagrangean approach to network design problems – Holmberg, Yuan - 1998
2	Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable optimization – Kiwiel - 1991
1	Network design using cut inequalities – Baxahona - 1996
1	Integer multicommodity flow problems – Baxnhaxt, I-lane, et al. - 1996
1	Convex Analysis and Minimization Algorithms II, Advanced Theory and Bundle Methods – Hiriaxt-Urruty, Lemaxchal - 1993

View or Download | Add to My Collection | Correct Errors