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

DOI10.1016/J.COR.2009.07.005zbMath1177.90061OpenAlexW2039069493MaRDI QIDQ1046709

Michael J. O'Sullivan, Cameron G. Walker

Publication date: 22 December 2009

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

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

zbMATH Keywords

network designinteger programcutsstorage area networkcore-edge topology

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Cites Work

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

This page was built for publication: Core-edge design of storage area networks-a single-edge formulation with problem-specific cuts