Facility location models for planning a transatlantic communications network

DOI10.1016/0377-2217(81)90209-5zbMath0451.90045OpenAlexW1974207282MaRDI QIDQ1148216

G. A. Kochman, Charles J. jun. McCallum

Publication date: 1981

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(81)90209-5

zbMATH Keywords

facility locationcomputational experiencenetwork planningsolution approachestransatlantic communications network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Inventory, storage, reservoirs (90B05)

Related Items (7)

A genetic algorithm-based heuristic for the dynamic integrated forward/reverse logistics network for 3PLs ⋮ A branch-and-price algorithm for the capacitated facility location problem ⋮ A hybrid firefly-genetic algorithm for the capacitated facility location problem ⋮ A Lagrangean heuristic for the plant location problem with multiple facilities in the same site ⋮ Transmission facility planning in telecommunications networks: A heuristic approach ⋮ Facility location models for distribution planning ⋮ A comparison of heuristics and relaxations for the capacitated plant location problem

Cites Work

• Optimal Network Capacity Planning: A Shortest-Path Scheme
• A primal algorithm for solving a capacitated network flow problem with additional linear constraints
• On building minimum cost communication networks over time
• Using decomposition in integer programming
• Minimum cost routing for dynamic network models

This page was built for publication: Facility location models for planning a transatlantic communications network