A heuristic procedure for computing the nucleolus

[EN] This paper introduces a row and column generation algorithm for finding the nucleolus, based on a linear programming model proposed in an earlier research. Since this approach cannot return an allocation for large games, we also propose a heuristic approach, which is based on sampling the coalitions space. Experiments over medium sized games show that the proposed heuristic finds allocations which are close to the true nucleolus, in a reasonable amount of time. Experiments over 100-player games show that the proposed heuristic can be applied to games of large size.The authors would like to acknowledge the support from Spanish "Ministerio de Economia y competitividad" throughout grant number MTM2016-74983 and grant "SCHEYARD - Optimization of Scheduling Problems in Container Yards" (No. DPI2015-65895-R) financed by FEDER funds. Special thanks are due to two anonymous referees for their valuable comments.Perea Rojas Marcos, F.; Puerto, J. (2019). A heuristic procedure for computing the nucleolus. Computers & Operations Research. 112:1-9. https://doi.org/10.1016/j.cor.2019.104764S1911

Data for: A heuristic procedure for computing the nucleolus

Instances and complete resultsTHIS DATASET IS ARCHIVED AT DANS/EASY, BUT NOT ACCESSIBLE HERE. TO VIEW A LIST OF FILES AND ACCESS THE FILES IN THIS DATASET CLICK ON THE DOI-LINK ABOV

Data for: A heuristic procedure for computing the nucleolus

Instances and complete result