On the nucleolus of the basic vehicle routing game

DOI10.1007/BF02592333zbMath0851.90031MaRDI QIDQ1919815

Kurt O. Jørnsten, Peter Värbrand, Maud Göthe-Lundgren

Publication date: 28 July 1996

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

core; nucleolus; routing game; vehicle routing cost allocation

Mathematics Subject Classification ID

91A12: Cooperative games

90B06: Transportation, logistics and supply chain management

Related Items

Coalitions among computationally bounded agents, A stabilized column generation scheme for the traveling salesman subtour problem, A note on relatives to the Held and Karp 1-tree problem, New techniques for cost sharing in combinatorial optimization games, Collaboration in Cargo Transportation

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• The selective travelling salesman problem
• Cost allocation: The traveling salesman, bin packing, and the knapsack
• On the core of a traveling salesman cost allocation game
• An upper bound for the zero-one knapsack problem and a branch and bound algorithm
• A Linear Programming Approach to the Cutting-Stock Problem
• The prize collecting traveling salesman problem
• Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
• A procedure for finding the nucleolus of a cooperativen person game
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• The Nucleolus of a Characteristic Function Game