Optimal expansion of an existing network

DOI10.1007/BF01580236zbMATH Open0288.90078MaRDI QIDQ4777083FDOQ4777083

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

• Title not available (Why is that?)
• 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)

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

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)