Time-dependent optimization of a multi-item uncertain supply chain network: a hybrid approximation algorithm
From MaRDI portal
Publication:1751136
DOI10.1016/j.disopt.2015.09.002zbMath1387.90032OpenAlexW2181455832MaRDI QIDQ1751136
Publication date: 24 May 2018
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2015.09.002
Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A model-based approach and analysis for multi-period networks
- Discrete and continuous time representations and mathematical models for large production scheduling problems: a case study from the pharmaceutical industry
- Euler index in uncertain graph
- An introduction to dynamic generative networks: minimum cost flow
- Shortest path problem with uncertain arc lengths
- A survey of dynamic network flows
- A generic auction algorithm for the minimum cost network flow problem
- Uncertain inference control for balancing an inverted pendulum
- Two-commodity reliability evaluation for a stochastic-flow network with node failure
- Determining the optimal flows in zero-time dynamic networks
- A decomposition-based approach for the multiperiod multiproduct distribution planning problem
- UNCERTAIN OPTIMAL CONTROL WITH APPLICATION TO A PORTFOLIO SELECTION MODEL
- CONNECTEDNESS INDEX OF UNCERTAIN GRAPH
- Multicommodity Network Flows with Probabilistic Losses
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Multicommodity Flow Problem with Variable Arcs Capacities
- Uncertainty theory
This page was built for publication: Time-dependent optimization of a multi-item uncertain supply chain network: a hybrid approximation algorithm
