Uncertain random bilevel programming models and their application to shared capacity routing problem
From MaRDI portal
Publication:2112700
DOI10.1016/j.cam.2022.114965OpenAlexW4310076250MaRDI QIDQ2112700
Publication date: 11 January 2023
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2022.114965
Linear programming (90C05) Stochastic programming (90C15) Management decision making, including multiple objectives (90B50) Transportation, logistics and supply chain management (90B06) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)
Related Items (1)
Cites Work
- Uncertain random multilevel programming with application to production control problem
- Uncertain random shortest path problem
- Green supply chain analysis under cost sharing contract with uncertain information based on confidence level
- Depedent-chance programming: A class of stochastic optimization
- Shared capacity routing problem -- an omni-channel retail study
- Uncertain random programming with applications
- Uncertain random variables: a mixture of uncertainty and randomness
- Stochastic mathematical programs with equilibrium constraints
- An enhanced branch-and-bound algorithm for bilevel integer linear programming
- On the significance of edges for connectivity in uncertain random graphs
- Uncertain random data envelopment analysis for technical efficiency
- Elliptic entropy of uncertain random variables with application to portfolio selection
- Detecting and solving aircraft conflicts using bilevel programming
- Reversed hazard function of uncertain lifetime
- Value-at-risk in uncertain random risk analysis
- Chance-Constrained Programming
- Computational Difficulties of Bilevel Linear Programming
- Uncertain random newsboy problem
- Mathematical Programs with Optimization Problems in the Constraints
- Uncertainty theory
This page was built for publication: Uncertain random bilevel programming models and their application to shared capacity routing problem
