Solution of a certain class of network flow problems with cascaded demand aggregation and capacity allocation

DOI10.1080/10556780600627867MaRDI QIDQ5481686zbMATH OpenOpenAlexFDO

Authors Farzad Safaei, Iradj Ouveysi

Publication date 10 August 2006

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://ro.uow.edu.au/infopapers/542

zbMATH Keywords

Lagrangian relaxation techniquemathematical programmingoptimizationtelecommunications

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Communication networks in operations research (90B18)

Recommendations

• scientific article; zbMATH DE number 3959084
• Routing and capacity assignment in backbone communication networks
• scientific article; zbMATH DE number 4149863
• scientific article; zbMATH DE number 484567
• Solving a class of network models for dynamic flow control

Cites work

• A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• Optimization of Teleprocessing Networks with Concentrators and Multiconnected Terminals

Cited in

(1)

• Theoretical Investigation of Aggregation in Pseudo-polynomial Network-Flow Models

This page was built for publication: Solution of a certain class of network flow problems with cascaded demand aggregation and capacity allocation

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