A generalized upper bounding approach to a communications network planning problem

DOI10.1002/net.3230070102zbMath0357.90069OpenAlexW2097374731MaRDI QIDQ4133436

Charles J. jun. McCallum

Publication date: 1977

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230070102

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10)

Related Items (5)

Multicommodity network flow with jump constraints ⋮ A survey of dynamic network flows ⋮ Unnamed Item ⋮ Design of private backbone networks. I: Time varying traffic ⋮ A primal partitioning approach for single and non-simultaneous multicommodity flow problems

Cites Work

• Generalized upper bounding techniques

This page was built for publication: A generalized upper bounding approach to a communications network planning problem