Optimal expansion of an existing network

DOI10.1007/BF01580236MaRDI QIDQ4777083zbMATH OpenFDO

Authors

Publication date 1974

Published in Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Cites work

• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• An Algorithm for the Traveling Salesman Problem
• Increasing the capacity of a network: the parametric budget problem
• Integer Programming by Implicit Enumeration and Balas’ Method

Cited in

(8)

• Call admission control schemes and ATM network topological design
• Configuring wide area computer networks. Problems and models
• The incremental connected facility location problem
• Engpässe, Staustellen und glatte homogene Ströme in Netzen
• Optimal expansion of capacitated transshipment networks
• A Lagrangian relaxation approach for stochastic network capacity expansion with budget constraints
• Multi-period capacity expansion for a local access telecommunications network
• Heuristics for multi-period capacity expansion in local telecommunications networks

This page was built for publication: Optimal expansion of an existing network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4777083)