scientific article; zbMATH DE number 1803762

MaRDI QIDQ3147665zbMATH OpenFDO

Authors Eric Gourdin, Martine Labbé, Hande Yaman

Publication date 2002

zbMATH Keywords

discrete location problemsnetwork designtelecommunication

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Discrete location and assignment (90B80)

Recommendations

• Concentrator location in telecommunications networks.
• Location problems in telecommunications
• Concentrator location in telecommunications
• Solving the hub location problem with modular link capacities
• Efficient algorithms for the capacitated concentrator location problem

Cited in

(28)

• A computational evaluation of a general branch-and-price framework for capacitated network location problems
• The \(K\)-coverage concentrator location problem
• Multi-level facility location problems
• Concentrator location in telecommunications networks.
• A branch and cut algorithm for hub location problems with single assignment
• Concentrator location in telecommunications
• Locating median cycles in networks
• Optimizing splitter and fiber location in a multilevel optical FTTH network
• The double-assignment plant location problem with co-location
• Multi-period capacitated location with modular equipments
• Towards optimizing the deployment of optical access networks
• Exactly solving a two-level location problem with modular node capacities
• Survivability in hierarchical telecommunications networks under dual homing
• scientific article; zbMATH DE number 3883910 (Why is no real title available?)
• A branch-and-cut algorithm for two-level survivable network design problems
• Combined capacity planning and concentrator location in computer communications networks
• Location of Transfer Centres on Segments of a Communication Network with Proportional Traffic
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location
• Location problems in telecommunications
• Solving the hub location problem in a star–star network
• scientific article; zbMATH DE number 2247883 (Why is no real title available?)
• New variants of the simple plant location problem and applications
• A survivable variant of the ring star problem
• Polyhedral analysis for concentrator location problems
• A review of hierarchical facility location models
• Optimal design of hierarchical networks with free main path extremes
• On split-coloring problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3147665)