Routing and scheduling of network flows with deadlines and discrete capacity allocation

DOI10.1002/net.21939zbMath1527.90073arXiv1905.04719OpenAlexW3013804946MaRDI QIDQ6092649

Ghafour Ahani, Di Yuan, Unnamed Author

Publication date: 23 November 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.04719

zbMATH Keywords

networksdeadlineflow schedulingdiscrete capacity allocationflow routing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An augmented Lagrangian algorithm for large scale multicommodity routing
• A polyhedral approach to an integer multicommodity flow problem
• Scheduling bulk file transfers with start and end times
• Selected Topics in Column Generation

This page was built for publication: Routing and scheduling of network flows with deadlines and discrete capacity allocation