On the nucleolus of the basic vehicle routing game
From MaRDI portal
Publication:1919815
DOI10.1007/BF02592333zbMath0851.90031OpenAlexW2047727108MaRDI QIDQ1919815
Peter Värbrand, Maud Göthe-Lundgren, Kurt O. Jørnsten
Publication date: 28 July 1996
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02592333
Related Items
Stochastic linear programming games with concave preferences, Core-based cost allocation in the cooperative traveling salesman problem, Finding the nucleoli of large cooperative games, New techniques for cost sharing in combinatorial optimization games, On the collaboration uncapacitated arc routing problem, The joint network vehicle routing game with optional customers, Approximate nucleolus-based revenue sharing in airline alliances, Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner, Coalitions among computationally bounded agents, Cooperative game‐theoretic features of cost sharing in location‐routing, Further insights into the allocation of greenhouse gas emissions to shipments in road freight transportation: the pollution routing game, Characterization sets for the nucleolus in balanced games, Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation, A stabilized column generation scheme for the traveling salesman subtour problem, Finding the nucleolus of the vehicle routing game with time windows, Collaborative vehicle routing: a survey, A note on relatives to the Held and Karp 1-tree problem, Coalition formation in collaborative production and transportation with competing firms, Collaborative transportation with overlapping coalitions, Consolidation in Urban Freight Transportation — Cost Allocation Models, A competitive solution for cooperative truckload delivery, Pricing strategies for the site-dependent vehicle routing problem, A review on cost allocation methods in collaborative transportation, Shared resources in collaborative vehicle routing, Collaboration in Cargo Transportation, Gain-sharing in urban consolidation centers
Uses Software
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