A mixed-integer approach to Core-Edge design of storage area networks

DOI10.1016/j.cor.2005.11.009zbMath1185.90159OpenAlexW1993011008MaRDI QIDQ878574

Timothy Thompson, Cameron G. Walker, Michael J. O'Sullivan

Publication date: 26 April 2007

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

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

zbMATH Keywords

mixed-integer programmingCore-Edge designstorage area network

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic network models in operations research (90B10)

Related Items (1)

Core-edge design of storage area networks-a single-edge formulation with problem-specific cuts

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient algorithms for the capacitated concentrator location problem
• 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
• Solution algorithms for the capacitated single allocation hub location problem
• Minimum cost capacity installation for multicommodity network flows
• A hybrid heuristic for the uncapacitated hub location problem
• Location analysis: a synthesis and survey
• Solving the hub location problem with modular link capacities
• On the Design Problem of Multitechnology Networks
• Telecommunication Node Clustering with Node Compatibility and Network Survivability Requirements
• Solving the Hub location problem in telecommunication network design: A local search approach
• Large-Scale Network Topological Optimization
• Optimization of Teleprocessing Networks with Concentrators and Multiconnected Terminals
• A dual algorithm for the uncapacitated hub location problem
• Topological Design of Centralized Computer Networks

This page was built for publication: A mixed-integer approach to Core-Edge design of storage area networks