The telephonic switching centre network problem: Formalization and computational experience

DOI10.1016/0166-218X(87)90021-7zbMath0628.90087MaRDI QIDQ1093558

Regina Helena B. Cabral, Nivio Ziviani, Henrique Pacca Loureiro Luna

Publication date: 1987

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

heuristicminimum distance algorithmSteiner's problem on graphsswitching centre network problemtranshipmenturban street network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Applications of graph theory to circuits and networks (94C15)

Related Items (8)

Parallel algorithms for a multi-level network optimization problem ⋮ A constrained Steiner tree problem ⋮ Tree network design avoiding congestion ⋮ Solving to optimality the uncapacitated fixed-charge network flow problem ⋮ COLE: a new heuristic approach for fixed charge problem computational results ⋮ Algorithms for a multi-level network optimization problem ⋮ Models for planning capacity expansion in local access telecommunication networks ⋮ Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• On the shortest spanning subtree of a graph and the traveling salesman problem
• A dual ascent approach for steiner tree problems on a directed graph
• An integer linear programming approach to the steiner problem in graphs
• Optimal Facility Location with Concave Costs
• An algorithm for the steiner problem in graphs

This page was built for publication: The telephonic switching centre network problem: Formalization and computational experience