A generalized upper bounding approach to a communications network planning problem

DOI10.1002/NET.3230070102zbMATH Open0357.90069OpenAlexW2097374731MaRDI QIDQ4133436FDOQ4133436

Authors: 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

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

Cites Work

• Generalized upper bounding techniques

Cited In (5)

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

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

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