Pages that link to "Item:Q4642481"
From MaRDI portal
The following pages link to Integrated network design and scheduling problems with parallel identical machines: Complexity results and dispatching rules (Q4642481):
Displaying 26 items.
- Incremental network design with shortest paths (Q296857) (← links)
- Interdependent network restoration: on the value of information-sharing (Q319346) (← links)
- Network construction problems with due dates (Q319443) (← links)
- Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period (Q326488) (← links)
- Solution methodologies for debris removal in disaster response (Q339944) (← links)
- Applying ranking and selection procedures to long-term mitigation for improved network restoration (Q339947) (← links)
- A computational approach to determine damage in infrastructure networks from outage reports (Q523173) (← links)
- Incremental network design with maximum flows (Q726224) (← links)
- Online scheduling problems with flexible release dates: applications to infrastructure restoration (Q1651574) (← links)
- Designing and constructing networks under uncertainty in the construction stage: definition and exact algorithmic approach (Q1652235) (← links)
- Dynamic resource allocation to support oil spill response planning for energy exploration in the Arctic (Q1752802) (← links)
- Tree optimization based heuristics and metaheuristics in network construction problems (Q2027081) (← links)
- Interdependent integrated network design and scheduling problems with movement of machines (Q2028825) (← links)
- Model and solution method for mean-risk cost-based post-disruption restoration of interdependent critical infrastructure networks (Q2147096) (← links)
- Network construction/restoration problems: cycles and complexity (Q2168711) (← links)
- Risk and resilience-based optimal post-disruption restoration for critical infrastructures under uncertainty (Q2239951) (← links)
- Modeling interdependencies in infrastructure systems using multi-layered network flows (Q2297565) (← links)
- Approximation guarantees of algorithms for fractional optimization problems arising in dispatching rules for INDS problems (Q2399489) (← links)
- A linear input dependence model for interdependent networks (Q2672104) (← links)
- Incremental Network Design with Minimum Spanning Trees (Q2971398) (← links)
- The Post-Disaster Debris Clearance Problem Under Incomplete Information (Q3195231) (← links)
- Quantitative Models for Infrastructure Restoration After Extreme Events: Network Optimization Meets Scheduling (Q3296289) (← links)
- Approximating Incremental Combinatorial Optimization Problems (Q5002607) (← links)
- Lateness Minimization in Pairwise Connectivity Restoration Problems (Q5136078) (← links)
- Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines (Q6166913) (← links)
- Integrated reinforcement and repair of interdependent infrastructure networks under disaster-related uncertainties (Q6167421) (← links)