Lagrangian decompositions for the two-level FTTx network design problem
We consider the design of a passive optical telecommunication access network, where clients have to be connected to an intermediate level of distribution points (DPs) and further on to some central offices (COs) in a tree-like fashion. Each client demands a given number of fiber connections to its C...
Enregistré dans:
Auteurs principaux: | Andreas Bley, Ivana Ljubić, Olaf Maurer |
---|---|
Format: | article |
Langue: | EN |
Publié: |
Elsevier
2013
|
Sujets: | |
Accès en ligne: | https://doaj.org/article/c89c6d5c6f654a3ea25f69981f65c078 |
Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
Documents similaires
-
A Lagrangian-ACO matheuristic for car sequencing
par: Dhananjay Thiruvady, et autres
Publié: (2014) -
SI on computational methods for network optimization problems
par: Bernard Fortz, et autres
Publié: (2013) -
Erratum to: Evaluating balancing on social networks through the efficient solution of correlation clustering problems
par: Mario Levorato, et autres
Publié: (2017) -
A decomposition-based heuristic for large employee scheduling problems with inter-department transfers
par: Dalia Attia, et autres
Publié: (2019) -
Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming
par: DimitriJ. Papageorgiou, et autres
Publié: (2018)