Designing and constructing networks under uncertainty in the construction stage: definition and exact algorithmic approach
type: Item
instance of: scholarly article
title: Designing and constructing networks under uncertainty in the construction stage: definition and exact algorithmic approach
zbMATH Open document ID: 1391.90594
author: Eduardo Álvarez-Miranda
author: Jordi Pereira
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6901383
zbMATH Keywords: network design
zbMATH Keywords: network construction
zbMATH Keywords: two-stage robust optimization
zbMATH Keywords: exact algorithms
Wikidata QID: Q56524139
describes a project that uses: SteinLib
MaRDI profile type: Publication
full work available at URL: j.cor.2016.12.018
OpenAlex ID: W2563186578
cites work: The Recoverable Robust Two-Level Network Design Problem
cites work: Two-Stage Robust Network Flow and Design Under Demand Uncertainty
cites work: Network construction problems with due dates
cites work: Incremental network design with shortest paths
cites work: Adjustable robust solutions of uncertain linear programs
cites work: Q3182207
cites work: The Price of Robustness
cites work: Introduction to Stochastic Programming
cites work: Q3425131
cites work: Recoverable robust shortest path problems
cites work: One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
cites work: Incremental Network Design with Minimum Spanning Trees
cites work: Q4952698
cites work: Incremental network design with maximum flows
cites work: Solving Steiner tree problems in graphs to optimality
cites work: Robust discrete optimization and its applications
cites work: The integer \(L\)-shaped method for stochastic integer programs with complete recourse
cites work: Integrated network design and scheduling problems with parallel identical machines: Complexity results and dispatching rules
cites work: Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem
cites work: Q3061964
DOI: 10.1016/J.COR.2016.12.018
description: scientific article; zbMATH DE number 6901383