NYU Faculty Digital Archive
metadata only
CAPACITY AND FLOW ASSIGNMENTS IN LARGE COMPUTER NETWORKS
This paper presents a model and the corresponding solution method for the problem of jointly selecting a set of primary routes and assigning capacities to the links in a computer communication network. The network topology and the traffic characteristics are known; a set of candidate routes for
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Clique Number of Tournaments II#984399
- ROUTING AND CAPACITY ASSIGNMENT IN A NETWORK WITH DIFFERENT CLASSES OF MESSAGES#933527
- A Network Formation Game for Katz Centrality Maximization: A Resource Allocation Perspective#1048320
- Combinatorial Theory: Introduction to Graph Theory, Extremal and Enumerative Combinatorics#66909
- Branch-and-price approaches for the network design problem with relays#955412
Record · ID 933595
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive