Cooperative maximum-flow problem under uncertainty in logistic networks

DOI10.1016/J.AMC.2014.10.080MaRDI QIDQ902866zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

logisticsrobust optimizationmaximum-flow problemmultiple-owners graphreliability and stability

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 3961334 (Why is no real title available?)
• scientific article; zbMATH DE number 49749 (Why is no real title available?)
• scientific article; zbMATH DE number 1239298 (Why is no real title available?)
• scientific article; zbMATH DE number 3078997 (Why is no real title available?)
• A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure
• A new algorithm for solving the feasibility problem of a network flow
• Cooperative game theory approach to allocating benefits of horizontal cooperation
• Cost allocation in collaborative forest transportation
• Cost allocation: The traveling salesman, bin packing, and the knapsack
• Game theory. An introduction
• Generalized Network Problems Yielding Totally Balanced Games
• Logistics networks: a game theory application for solving the transshipment problem
• Models in Cooperative Game Theory
• Network flows. Theory, algorithms, and applications.
• On robust maximum flow with polyhedral uncertainty sets
• On the history of the transportation and maximum flow problems
• Polynomial-time identification of robust network flows under uncertain arc failures
• Robust Optimization of Large-Scale Systems
• Robust discrete optimization and network flows
• Robust solutions of linear programming problems contaminated with uncertain data
• Strategic and tactical design of competing decentralized supply chain networks with risk-averse participants for markets with uncertain demand
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• The Price of Robustness
• The cooperative game theory of networks and hierarchies
• The maximum flow problem of uncertain network
• Totally Balanced Games and Games of Flow

Cited in

(5)

• Collaborative airline revenue sharing game with grey demand data
• Cooperative grey games: an application to a flow situation
• A note on the nonuniqueness of the equal profit method
• Cooperative strategies for maximum-flow problem in uncertain decentralized systems using reliability analysis
• Cooperative games in networks under uncertainty on the costs

Describes a project that uses

Uses Software

• TUGlab

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)