Designing and constructing networks under uncertainty in the construction stage: definition and exact algorithmic approach
From MaRDI portal
Publication:1652235
DOI10.1016/j.cor.2016.12.018zbMath1391.90594OpenAlexW2563186578WikidataQ56524139 ScholiaQ56524139MaRDI QIDQ1652235
Eduardo Álvarez-Miranda, Jordi Pereira
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.12.018
Programming involving graphs or networks (90C35) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Incremental network design with shortest paths
- Network construction problems with due dates
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Incremental network design with maximum flows
- Robust discrete optimization and its applications
- Adjustable robust solutions of uncertain linear programs
- Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem
- Recoverable robust shortest path problems
- The Recoverable Robust Two-Level Network Design Problem
- Incremental Network Design with Minimum Spanning Trees
- Introduction to Stochastic Programming
- Two-Stage Robust Network Flow and Design Under Demand Uncertainty
- The Price of Robustness
- Solving Steiner tree problems in graphs to optimality
- Integrated network design and scheduling problems with parallel identical machines: Complexity results and dispatching rules
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
This page was built for publication: Designing and constructing networks under uncertainty in the construction stage: definition and exact algorithmic approach
