scientific article

DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(198808)35:4<503::AID-NAV3220350406>3.0.CO;2-N" /><503::AID-NAV3220350406>3.0.CO;2-N 10.1002/1520-6750(198808)35:4<503::AID-NAV3220350406>3.0.CO;2-NzbMath0643.90022MaRDI QIDQ3786250

Ilker Baybars, Richard H. Edahl

Publication date: 1988

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

telecommunications networkfinite planning horizonnetwork designdata transmissionheuristic methodfacility installationmultiple alternate routespoint-to-point demand forecasts

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (2)

Minimum concave-cost network flow problems: Applications, complexity, and algorithms ⋮ The network redesign problem for access telecommunications networks

Uses Software

• LINDO

Cites Work

• On the equivalence between the Node‐ARC and ARC‐Chain formulations for the multi‐commodity maximal flow problem

This page was built for publication: