A time-dependent subgraph-capacity model for multiple shortest paths and application to \(\text{CO}_2\)/contrail-safe aircraft trajectories
From MaRDI portal
Publication:6620756
DOI10.1007/S43069-024-00347-3MaRDI QIDQ6620756
Marcel Mongeau, Céline Demouge, D. Delahaye, Nicolas P. Couellan
Publication date: 17 October 2024
Published in: SN Operations Research Forum (Search for Journal in Brave)
mixed integer linear programmingair transportationcontrailssubgraph constrained time-dependent shortest-path problem
Cites Work
- A note on two problems in connexion with graphs
- On an exact method for the constrained shortest path problem
- On air traffic flow management with rerouting. I: Deterministic case
- A survey of dynamic network flows
- The air traffic flow management problem with enroute capacities
- A survey of resource constrained shortest path problems: exact solution approaches
- On a routing problem
- Multicommodity network flows—A survey
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: A time-dependent subgraph-capacity model for multiple shortest paths and application to \(\text{CO}_2\)/contrail-safe aircraft trajectories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6620756)
