arXiv (All)
open access
Compressed Traffic Assignment with the Augmented Lagrangian Method
We consider large-scale traffic assignment problems and develop a path-based compression framework. In particular, we partition paths into major and minor paths according to nominal path flows and a prescribed threshold, and retain the major paths explicitly. For the minor paths, we use reference fl
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
- GATE: GPU-Accelerated Traffic Engineering for the WAN#1130541
- SWAP: A Scalable, Warm-Startable, Anytime Permutation Solver for Optimal Transport#1064579
- Improved Impossibility Bounds for Maximin Share Allocations#1084972
- Distribution of Link-State and Traffic Engineering Information Using BGP#399465
- Improved Packet Reordering Metrics#420402
Record · ID 1105975
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