The stochastic single resource service-provision problem

DOI10.1002/nav.10092zbMath1055.90093OpenAlexW2140844111MaRDI QIDQ4651738

Shane Dye, Asgeir Tomasgard, Leen Stougie

Publication date: 22 February 2005

Published in: Naval Research Logistics (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/8418f7b1-4e96-4ed9-b25f-c3339367ce0b

zbMATH Keywords

approximationtelecommunicationsworst-case analysisstrong NP-hardnessdistributed processingservice provisionstochastic (integer) programming

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Communication networks in operations research (90B18) Stochastic programming (90C15) Boolean programming (90C09) Distributed systems (68M14)

Related Items

Fast primal-dual distributed algorithms for scheduling and matching problems ⋮ K-Adaptability in Two-Stage Robust Binary Programming ⋮ Approximation algorithms for \(k\)-level stochastic facility location problems ⋮ Configuration balancing for stochastic requests ⋮ Approximability of the two-stage stochastic knapsack problem with discretely distributed weights ⋮ Commitment under uncertainty: Two-stage stochastic matching problems ⋮ Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach ⋮ A generalised likelihood uncertainty estimation mixed-integer programming model: Application to a water resource distribution network

Cites Work

• Unnamed Item
• Unnamed Item