Publication:4266755

DOI<487::AID-NAV3>3.0.CO;2-B 10.1002/(SICI)1520-6750(199908)46:5<487::AID-NAV3>3.0.CO;2-BzbMath0948.90027MaRDI QIDQ4266755

Hanan Luss, Linos F. Frantzeskakis

Publication date: 22 September 1999

zbMATH Keywords

network flow problem; heuristic; mixed integer program; network redesign problem

Mathematics Subject Classification ID

90C90: Applications of mathematical programming

90C11: Mixed integer programming

90C59: Approximation methods and heuristics in mathematical programming

90B10: Deterministic network models in operations research

Related Items

Developing concurrent investment plans for power generation and transmission

Cites Work

• Unnamed Item
• Models for planning capacity expansion in local access telecommunication networks
• Topological design of telecommunication networks --- local access design methods
• Multifacility-Type Capacity Expansion Planning: Algorithms and Complexities
• A Capacity Improvement Lower Bound for Fixed Charge Network Design Problems
• Networks synthesis and optimum network design problems: Models, solution methods and applications
• Operations Research and Capacity Expansion Problems: A Survey
• Backbone Network Design Tools with Economic Tradeoffs
• Heuristic Methods for Solving Large Scale Network Routing Problems: The Telpaking Problem
• A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning
• Modeling and Solving the Two-Facility Capacitated Network Loading Problem
• The One-Terminal TELPAK Problem
• Minimum cost routing for static network models