Cooperative maximum-flow problem under uncertainty in logistic networks
From MaRDI portal
Publication:902866
DOI10.1016/j.amc.2014.10.080zbMath1328.90016OpenAlexW1977277863MaRDI QIDQ902866
Ashkan Hafezalkotob, Ahmad Makui
Publication date: 4 January 2016
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2014.10.080
Cooperative games (91A12) Stochastic programming (90C15) Games involving graphs (91A43) Applications of game theory (91A80) Transportation, logistics and supply chain management (90B06) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)
Related Items
Collaborative airline revenue sharing game with grey demand data ⋮ A note on the nonuniqueness of the equal profit method ⋮ Cooperative strategies for maximum-flow problem in uncertain decentralized systems using reliability analysis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strategic and tactical design of competing decentralized supply chain networks with risk-averse participants for markets with uncertain demand
- On robust maximum flow with polyhedral uncertainty sets
- Polynomial-time identification of robust network flows under uncertain arc failures
- The maximum flow problem of uncertain network
- Cost allocation: The traveling salesman, bin packing, and the knapsack
- Cost allocation in collaborative forest transportation
- A new algorithm for solving the feasibility problem of a network flow
- Robust discrete optimization and network flows
- Robust solutions of linear programming problems contaminated with uncertain data
- Cooperative game theory approach to allocating benefits of horizontal cooperation
- Logistics networks: a game theory application for solving the transshipment problem
- The Cooperative Game Theory of Networks and Hierarchies
- Models in Cooperative Game Theory
- The Price of Robustness
- Generalized Network Problems Yielding Totally Balanced Games
- Totally Balanced Games and Games of Flow
- A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure
- Robust Optimization of Large-Scale Systems
- Game Theory
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- On the history of the transportation and maximum flow problems