Maxflow-based integrated network design and scheduling problems with downgraded capacities
From MaRDI portal
Cites work
- A new approach to the maximum-flow problem
- Complexities and algorithms for synchronized scheduling of parallel machine assembly and air transportation in consumer electronics supply chain
- Decomposition-based algorithms for the crew scheduling and routing problem in road restoration
- scientific article; zbMATH DE number 1867327 (Why is no real title available?)
- Hybrid evolutionary metaheuristics for concurrent multi-objective design of urban road and public transit networks
- Incremental network design with maximum flows
- Incremental network design with minimum spanning trees
- Incremental network design with shortest paths
- Integrated network design and scheduling problems with parallel identical machines: Complexity results and dispatching rules
- Interdependent integrated network design and scheduling problems with movement of machines
- Minimizing the makespan in multiserver network restoration problems
- Network repair crew scheduling for short-term disasters
- Origin-Based Algorithm for the Traffic Assignment Problem
- Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem
- Routing multiple work teams to minimize latency in post-disaster road network restoration
- Solution methodologies for debris removal in disaster response
- Strategic network restoration
- The post-disaster debris clearance problem under incomplete information
- The transit route arc-node service maximization problem
- Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel machines
This page was built for publication: Maxflow-based integrated network design and scheduling problems with downgraded capacities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7239334)
