Sparse dynamic discretization discovery via arc-dependent time discretizations
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 2038726 (Why is no real title available?)
- scientific article; zbMATH DE number 2079322 (Why is no real title available?)
- A dynamic discretization discovery algorithm for the minimum duration time-dependent shortest path problem
- A time bucket formulation for the traveling salesman problem with time windows
- An introduction to network flows over time
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Constructing maximal dynamic flows from static flows
- Dynamic discretization discovery for solving the continuous time inventory routing problem with out-and-back routes
- Perspectives on integer programming for time-dependent models
- Quickest Flows Over Time
- Scalable timing-aware network design via Lagrangian decomposition
- Scheduling activities with time-dependent durations and resource consumptions
- Service network design for freight transportation: a review
- Service network design in freight transportation
- Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery
- The Continuous-Time Service Network Design Problem
This page was built for publication: Sparse dynamic discretization discovery via arc-dependent time discretizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6979437)
