Joint chance-constrained survivable capacitated multi-commodity network design problem with demand uncertainty

DOI10.1051/RO/2025096MaRDI QIDQ6907770zbMATH OpenFDO

Authors Salman Khodayifar, Mohammadreza Farjaie

Publication date 1 November 2025

Published in RAIRO. Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1051/RO/2025096

zbMATH Keywords

network design problemsurvivabilitycopula theoryjoint chance-constrained programming

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06)

Cites work

• scientific article; zbMATH DE number 3152042 (Why is no real title available?)
• scientific article; zbMATH DE number 3163305 (Why is no real title available?)
• scientific article; zbMATH DE number 45785 (Why is no real title available?)
• scientific article; zbMATH DE number 50707 (Why is no real title available?)
• scientific article; zbMATH DE number 3992730 (Why is no real title available?)
• A Stochastic Programming Model
• A second-order cone programming approach for linear programs with joint probabilistic constraints
• An introduction to copulas.
• Chance Constrained Programming with Joint Constraints
• Chance constrained \(0-1\) quadratic programs using copulas
• Chance-Constrained Programming with Joint Constraints
• Chance-constrained data envelopment analysis modeling with random-rough data
• Chance-constrained programming
• Copula theory approach to stochastic geometric programming
• Emergence of Scaling in Random Networks
• Estimation of portfolio efficiency via stochastic DEA
• Introduction to stochastic programming.
• Joint chance constrained shortest path problem with Copula theory
• Joint chance-constrained multi-objective multi-commodity minimum cost network flow problem with copula theory
• Maximum probability shortest path problem
• Optimum Synthesis of a Network with Non-Simultaneous Multicommodity Flow Requirements
• Portfolio optimization with a copula-based extension of conditional value-at-risk
• Stochastic survivable network design problems: theory and practice
• Survivable capacitated network design problem: new formulation and Lagrangean relaxation
• Survivable network design under optimal and heuristic interdiction scenarios
• Survivable network design with demand uncertainty
• The edge-labeled survivable network design problem: formulations and branch-and-cut

Cited in

(2)

• Distributionally robust chance-constrained multicommodity network flow problem in dynamic networks: a column-generation approach
• Distributionally robust joint chance-constrained approach for the stochastic survivable capacitated network design problem

This page was built for publication: Joint chance-constrained survivable capacitated multi-commodity network design problem with demand uncertainty

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6907770)