On characterization of the core of lane covering games via dual solutions

DOI10.1016/J.ORL.2014.09.002zbMath1408.90038OpenAlexW2130266852MaRDI QIDQ1785295

Behzad Hezarkhani, Marco Slikker, Tom Van Woensel

Publication date: 28 September 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/a0060c7a-4169-431b-8a06-c801b043495d

zbMATH Keywords

corelogisticscooperative game theorylane covering problem

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43) Applications of game theory (91A80) Transportation, logistics and supply chain management (90B06)

Related Items (4)

Lane covering with partner bounds in collaborative truckload transportation procurement ⋮ Pairwise mergers in bipartite matching games with an application in collaborative logistics ⋮ A competitive solution for cooperative truckload delivery ⋮ Gain-sharing in urban consolidation centers

Cites Work

• Unnamed Item
• Unnamed Item
• On computational complexity of membership test in flow games and linear production games
• Generalized Network Problems Yielding Totally Balanced Games
• On the core of linear production games

This page was built for publication: On characterization of the core of lane covering games via dual solutions