Publisher
Springer Berlin Heidelberg
Reference33 articles.
1. Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P., & Vance, P. H. (1998). Branch-and-Price: Column Generation for Solving Huge Integer Programs. Operations Research, 46(3), 316–329.
2. Benders, J. F. (1962). Partitioning Procedures for Solving Mixed-Variables Programming Problems. Numerische Mathematik, 4(1), 238–252.
3. Bonnans, F., & Andr, M. (2008). Fast Computation of the Least Core and Prenucleolus of Cooperative Games. RAIRO Operations Research, 42(3), 299–314.
4. Borm, P., Hamers, H., & Hendrickx, R. (2001). Operations Research Games: A Survey. TOP, Sociedad de Estadstica e Investigacin Operativa, 9(2), 139–216.
5. Chardaire, P. (2001). The Core and the Nucleolus of Games: A Note on a Paper by Göthe-Lundgren et al.. Mathematical Programming, Series A, 90(1), 147–151.