Optimization of resource location in hierarchical computer networks
From MaRDI portal
Publication:583895
DOI10.1016/0305-0548(90)90016-ZzbMath0692.68044OpenAlexW2063507757MaRDI QIDQ583895
C. N. Dorny, G. Anandalingam, A. Vernekar
Publication date: 1990
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(90)90016-z
algorithmsgreedy heuristiccomputer network designhierarchical resource location problem (HRLP)simulate annealing
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10) Artificial intelligence (68T99)
Related Items
An exact algorithm for the maximum stable set problem, Topological design of a two-level network with ring-star configuration, A review of hierarchical facility location models, A two-phased approach to the supply network reconfiguration problem, Lower and upper bounds for a two-level hierarchical location problem in computer networks, Optimal design of LAN-WAN internetworks: An approach using simulated annealing, Formulating and solving production planning problems, The life span method -- a new variant of local search, A hierarchical model for the location of perinatal facilities in the municipality of Rio de Janeiro, A simulated annealing methodology to distribution network design and management
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- Convergence of an annealing algorithm
- Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds
- Cooling Schedules for Optimal Annealing
- A Mathematical Programming Model of Decentralized Multi-Level Systems
- Simulated Annealing – An Annotated Bibliography
- Database Location in Computer Networks
- An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
- Optimal program and data locations in computer networks
