Pages that link to "Item:Q2819589"
From MaRDI portal
The following pages link to Efficient recovery from power outage (extended abstract) (Q2819589):
Displaying 21 items.
- An approximation algorithm for maximum weight budgeted connected set cover (Q281790) (← links)
- 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)
- A survey of models and algorithms for emergency response logistics in electric distribution systems. II: Contingency planning level (Q336405) (← links)
- Emergency path restoration problems (Q435733) (← links)
- Approximating some network design problems with node costs (Q638508) (← links)
- Resource planning and a depot location model for electric power restoration. (Q1428043) (← links)
- Online scheduling problems with flexible release dates: applications to infrastructure restoration (Q1651574) (← 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)
- Approximations for restrictions of the budgeted and generalized maximum coverage problems (Q2132403) (← links)
- Network construction/restoration problems: cycles and complexity (Q2168711) (← links)
- Optimisation of electrical network configuration: complexity and algorithms for ring topologies (Q2227500) (← links)
- Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem (Q2253398) (← links)
- Primal-Dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs (Q3012847) (← links)
- Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem (Q3512450) (← links)
- Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems (Q4571047) (← links)
- Spider Covering Algorithms for Network Design Problems (Q4689626) (← links)
- Lateness Minimization in Pairwise Connectivity Restoration Problems (Q5136078) (← links)
- Online Node-weighted Steiner Forest and Extensions via Disk Paintings (Q5737814) (← links)