Cooperative maximum-flow problem under uncertainty in logistic networks
DOI10.1016/J.AMC.2014.10.080zbMATH Open1328.90016OpenAlexW1977277863MaRDI QIDQ902866FDOQ902866
Authors: 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
Recommendations
- Cooperative strategies for maximum-flow problem in uncertain decentralized systems using reliability analysis
- Cooperative games in networks under uncertainty on the costs
- A network design model under uncertainty
- The maximum flow problem of uncertain network
- The \(\alpha\)-maximum flow model with uncertain capacities
Deterministic network models in operations research (90B10) Reliability, availability, maintenance, inspection in operations research (90B25) Cooperative games (91A12) Applications of game theory (91A80) Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06) Games involving graphs (91A43)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Title not available (Why is that?)
- The Price of Robustness
- Robust Optimization of Large-Scale Systems
- Robust discrete optimization and network flows
- Robust solutions of linear programming problems contaminated with uncertain data
- Title not available (Why is that?)
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Generalized Network Problems Yielding Totally Balanced Games
- Totally Balanced Games and Games of Flow
- Models in Cooperative Game Theory
- Cost allocation: The traveling salesman, bin packing, and the knapsack
- Cost allocation in collaborative forest transportation
- A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cooperative game theory approach to allocating benefits of horizontal cooperation
- The cooperative game theory of networks and hierarchies
- Game theory. An introduction
- Polynomial-time identification of robust network flows under uncertain arc failures
- On the history of the transportation and maximum flow problems
- Strategic and tactical design of competing decentralized supply chain networks with risk-averse participants for markets with uncertain demand
- The maximum flow problem of uncertain network
- On robust maximum flow with polyhedral uncertainty sets
- A new algorithm for solving the feasibility problem of a network flow
- Logistics networks: a game theory application for solving the transshipment problem
Cited In (5)
- A note on the nonuniqueness of the equal profit method
- Collaborative airline revenue sharing game with grey demand data
- Cooperative strategies for maximum-flow problem in uncertain decentralized systems using reliability analysis
- Cooperative games in networks under uncertainty on the costs
- Cooperative grey games: an application to a flow situation
Uses Software
This page was built for publication: Cooperative maximum-flow problem under uncertainty in logistic networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q902866)
