Maximizing residual capacity in connection-oriented networks
From MaRDI portal
Publication:955490
DOI10.1155/JAMDS/2006/72547zbMath1152.90357MaRDI QIDQ955490
Publication date: 20 November 2008
Published in: Journal of Applied Mathematics and Decision Sciences (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/129490
Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Potential function methods for approximately solving linear programming problems: theory and practice.
- A branch and bound algorithm for primary routes assignment in survivable connection oriented networks
- Computational experience with a difficult mixed-integer multicommodity flow problem
- Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem
- Exact and Approximate Algorithms for Topological Design of Wide Area Networks with Non-simultaneous Single Commodity Flows
- The flow deviation method: An approach to store‐and‐forward communication network design
This page was built for publication: Maximizing residual capacity in connection-oriented networks
