This book constitutes the refereed proceedings of the 17th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2014, held in Bonn, Germany, in June 2014. The 34 full papers presented were carefully reviewed and selected from 143 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, computation, and applications in these areas. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.(D) We will henceforth refer to feasible solutions of (P) and (D) as fractional matchings and vertex covers, respectively. ... a natural, recent generalization of Nasha#39;s famous bargaining solution  to networks due to Kleinberg and Tardos [ 11].
|Title||:||Integer Programming and Combinatorial Optimization|
|Author||:||Jon Lee, Jens Vygen|
|Publisher||:||Springer - 2014-05-17|