Logistics networks: a game theory application for solving the transshipment problem

DOI10.1016/j.amc.2004.10.030zbMath1090.91010MaRDI QIDQ2572775

Pedro M. Reyes

Publication date: 4 November 2005

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2004.10.030

zbMATH Keywords

Shapley value; Game theory; Logistics network; Transshipment problem

Mathematics Subject Classification ID

91A12: Cooperative games

90B06: Transportation, logistics and supply chain management

Related Items

Optimal distributions for multiplex logistic networks, A game theoretical approach to emergency logistics planning in natural disasters, Cooperative maximum-flow problem under uncertainty in logistic networks, A methodology to exploit profit allocation in logistics joint distribution network optimization, Competition with online and offline demands considering logistics costs based on the Hotelling model, Cooperative strategies for maximum-flow problem in uncertain decentralized systems using reliability analysis, Strength of preference in graph models for multiple-decision-maker conflicts, A HEURISTIC APPROACH FOR SOLVING SERIALLY DISTRIBUTED STORAGE DEPOTS UNDER GENERAL-INTEGER POLICY

Cites Work

• Unnamed Item
• Efficient continuous-time dynamic network flow algorithms
• Capacity Choice and Allocation: Strategic Behavior and Supply Chain Performance
• Modeling Emergency Supply Flexibility in a Two-Echelon Inventory System
• Generalized Network Problems Yielding Totally Balanced Games
• Totally Balanced Games and Games of Flow