Computing the Nucleolus by Solving a Prolonged Simplex Algorithm
From MaRDI portal
Publication:4716936
DOI10.1287/moor.21.3.757zbMath0873.90127OpenAlexW2073544949MaRDI QIDQ4716936
J. H. Reijnierse, Michel Ansing, Jos A. M. Potters
Publication date: 20 October 1997
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2066/27990
Related Items
On the lexicographic centre of multiple objective optimization ⋮ Finding the nucleoli of large cooperative games ⋮ Finding the nucleolus of any \(n\)-person cooperative game by a single linear program ⋮ Characterization sets for the nucleolus in balanced games ⋮ Finding and verifying the nucleolus of cooperative games ⋮ Finding the nucleolus of the vehicle routing game with time windows ⋮ Analytic solution for the nucleolus of a three-player cooperative game ⋮ Constructive and blocking power in collaborative transportation ⋮ The \({\mathcal B}\)-nucleolus of TU-games ⋮ The Complexity of the Nucleolus in Compact Games ⋮ A heuristic procedure for computing the nucleolus
This page was built for publication: Computing the Nucleolus by Solving a Prolonged Simplex Algorithm