23 citations · 38 across the 14 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.GT2018
Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time
Jochen Koenemann, Kanstantsin Pashkovich, Justin Toth
We provide an efficient algorithm for computing the nucleolus for an instance of a weighted cooperative matching game. This resolves a long-standing open question posed in [Faigle,…
cs.DS2018
Vehicle Routing with Subtours
Stephan Held, Jochen Könemann, Jens Vygen
When delivering items to a set of destinations, one can save time and cost by passing a subset to a sub-contractor at any point en route. We consider a model where a set of items a…