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...
Saved in:
Main Authors: | Andreas Bley, Ivana Ljubić, Olaf Maurer |
---|---|
Format: | article |
Language: | EN |
Published: |
Elsevier
2013
|
Subjects: | |
Online Access: | https://doaj.org/article/c89c6d5c6f654a3ea25f69981f65c078 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A Lagrangian-ACO matheuristic for car sequencing
by: Dhananjay Thiruvady, et al.
Published: (2014) -
SI on computational methods for network optimization problems
by: Bernard Fortz, et al.
Published: (2013) -
Erratum to: Evaluating balancing on social networks through the efficient solution of correlation clustering problems
by: Mario Levorato, et al.
Published: (2017) -
A decomposition-based heuristic for large employee scheduling problems with inter-department transfers
by: Dalia Attia, et al.
Published: (2019) -
Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming
by: DimitriJ. Papageorgiou, et al.
Published: (2018)