Incremental network design with maximum flows
From MaRDI portal
Publication:726224
DOI10.1016/j.ejor.2014.10.003zbMath1341.90024arXiv1312.6447OpenAlexW2027517531WikidataQ57955342 ScholiaQ57955342MaRDI QIDQ726224
Dmytro Matsypura, Thomas Kalinowski, Savelsbergh, Martin W. P.
Publication date: 8 July 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.6447
Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)
Related Items (25)
Polynomial-time algorithms for single resource stochastic capacity expansion models with lost sales ⋮ Scheduling maintenance jobs in networks ⋮ Interdependent network restoration: on the value of information-sharing ⋮ Network construction problems with due dates ⋮ Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period ⋮ Online scheduling problems with flexible release dates: applications to infrastructure restoration ⋮ Designing and constructing networks under uncertainty in the construction stage: definition and exact algorithmic approach ⋮ The Post-Disaster Debris Clearance Problem Under Incomplete Information ⋮ Approximation guarantees of algorithms for fractional optimization problems arising in dispatching rules for INDS problems ⋮ Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines ⋮ Integrated reinforcement and repair of interdependent infrastructure networks under disaster-related uncertainties ⋮ Learn to decompose multiobjective optimization models for large‐scale networks ⋮ Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows ⋮ Incremental Network Design with Minimum Spanning Trees ⋮ Unnamed Item ⋮ Lateness Minimization in Pairwise Connectivity Restoration Problems ⋮ Quantitative Models for Infrastructure Restoration After Extreme Events: Network Optimization Meets Scheduling ⋮ Approximating Incremental Combinatorial Optimization Problems ⋮ A quantitative approach for the long-term assessment of railway rapid transit network construction or expansion projects ⋮ Dynamic resource allocation to support oil spill response planning for energy exploration in the Arctic ⋮ Tree optimization based heuristics and metaheuristics in network construction problems ⋮ Interdependent integrated network design and scheduling problems with movement of machines ⋮ Exact solution approaches for the multi-period degree constrained minimum spanning tree problem ⋮ The incremental connected facility location problem ⋮ Fractionally subadditive maximization under an incremental knapsack constraint
Cites Work
- Incremental network design with shortest paths
- Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem
- Integrating restoration and scheduling decisions for disrupted interdependent infrastructure systems
- Integrated network design and scheduling problems with parallel identical machines: Complexity results and dispatching rules
This page was built for publication: Incremental network design with maximum flows