Sharing loading costs for multi compartment vehicles

DOI10.3390/g9020025zbMath1403.90120OpenAlexW2800487035MaRDI QIDQ1651904

Bruce C. Hartman

Publication date: 10 July 2018

Published in: Games (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/g9020025

zbMATH Keywords

cooperative gameslogisticsloading problemsmulti compartment vehicles

Mathematics Subject Classification ID

Cooperative games (91A12) Transportation, logistics and supply chain management (90B06)

Cites Work

• Unnamed Item
• Finding the nucleolus of any \(n\)-person cooperative game by a single linear program
• A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
• Characterization sets for the nucleolus in balanced games
• Three-dimensional container loading models with cargo stability and load bearing constraints
• A parallel multi-population biased random-key genetic algorithm for a container loading problem
• The freight consolidation and containerization problem
• A review on cost allocation methods in collaborative transportation
• Stability and Endogenous Formation of Inventory Transshipment Networks
• Analytic solution for the nucleolus of a three-player cooperative game
• Shipment Consolidation: Who Pays for It and How Much?
• The Price of Stability for Network Design with Fair Cost Allocation
• Cost allocation in continuous-review inventory models
• An inductive method for constructing mimmal balanced collections of finite sets
• The Nucleolus of a Characteristic Function Game
• Introduction to the Theory of Cooperative Games
• Strategyproof sharing of submodular costs: budget balance versus efficiency

This page was built for publication: Sharing loading costs for multi compartment vehicles