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...
Guardado en:
Autores principales: | Andreas Bley, Ivana Ljubić, Olaf Maurer |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Elsevier
2013
|
Materias: | |
Acceso en línea: | https://doaj.org/article/c89c6d5c6f654a3ea25f69981f65c078 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
A Lagrangian-ACO matheuristic for car sequencing
por: Dhananjay Thiruvady, et al.
Publicado: (2014) -
SI on computational methods for network optimization problems
por: Bernard Fortz, et al.
Publicado: (2013) -
Erratum to: Evaluating balancing on social networks through the efficient solution of correlation clustering problems
por: Mario Levorato, et al.
Publicado: (2017) -
A decomposition-based heuristic for large employee scheduling problems with inter-department transfers
por: Dalia Attia, et al.
Publicado: (2019) -
Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming
por: DimitriJ. Papageorgiou, et al.
Publicado: (2018)