Lower and upper bounds for a two-level hierarchical location problem in computer networks

DOI10.1016/j.cor.2006.10.005zbMath1139.90015OpenAlexW2078279808MaRDI QIDQ2462545

Ferreira Virgílio José Martins Filho, Aníbal Alberto Vilcapoma Ignacio, Roberto Diéguez Galvão

Publication date: 30 November 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2006.10.005

zbMATH Keywords

tabu searchLagrangean relaxationhierarchical location problemsdesign of computer networks

Mathematics Subject Classification ID

Continuous location (90B85) Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

Exactly solving a two-level location problem with modular node capacities ⋮ A two-level location-allocation problem in designing local access fiber optic networks ⋮ Multi-level facility location problems ⋮ Combining very large scale and ILP based neighborhoods for a two-level location problem

Uses Software

• CPLEX
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Heuristics for distribution network design in telecommunication
• Optimization of resource location in hierarchical computer networks
• Efficient algorithms for the capacitated concentrator location problem
• Locational analysis
• Topological design of telecommunication networks --- local access design methods
• Topological design of computer communication networks -- the overall design problem
• Optimal design of a distributed network with a two-level hierarchical structure
• Upper and lower bounds for the two-level simple plant location problem
• The tabu search metaheuristic: How we used it
• A comparison of optimal methods for local access uncapacitated network design
• Selecting hierarchical facilities in a service-operations environment
• Cost-optimal topology planning of hierarchical access networks
• Solving the hub location problem with modular link capacities
• Capacitated facility location problem with general setup cost
• On the capacitated concentrator location problem: a reformulation by discretization
• Solving the Hub location problem in telecommunication network design: A local search approach
• An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
• Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds
• A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
• An Overview of Representative Problems in Location Research
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Tabu Search—Part I
• Tabu Search—Part II
• Heuristics for Two-Level Hierarchical Transportation Networks
• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• INTEGER PROGRAMMING MODEL AND EXACT SOLUTION FOR CONCENTRATOR LOCATION PROBLEM
• Validation of subgradient optimization
• An Algorithm for the Design of Multitype Concentrator Networks
• Capacitated location-allocation problems on a line

This page was built for publication: Lower and upper bounds for a two-level hierarchical location problem in computer networks