E. Balas, The prize collecting traveling salesman problem, Networks, vol.19, issue.6, pp.621-636, 1989.

C. Barnhart, E. Johnson, G. Nemhauser, M. Savelsbergh, and P. Vance, Branchand-price: Column generation for solving huge integer programs, Operations research, vol.46, issue.3, pp.316-329, 1998.

O. Briant, C. Lemaréchal, . Ph, S. Meurdesoif, N. Michel et al., Comparison of bundle and classical column generation, Mathematical Programming, vol.113, issue.2, pp.299-344, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00070554

S. De-vries and R. V. Vohra, Combinatorial auctions: A survey, INFORMS Journal on Computing, vol.15, issue.3, pp.284-309, 2003.

J. Edmonds, Submodular functions, matroids, and certain polyhedra, Combinatorial Structures and their Applications, pp.69-87, 1970.

L. Fleischer and S. Iwata, A push-relabel framework for submodular function minimization and applications to parametric optimization, Discrete Applied Mathematics, vol.131, issue.2, pp.311-322, 2003.

F. Hillier and G. Lieberman, , 2001.

S. Iwata, A faster scaling algorithm for minimizing submodular functions, SIAM Journal of Computing, vol.32, issue.4, pp.833-840, 2003.

S. Iwata and K. Nagano, Submodular function minimization under covering constraints, Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp.671-680, 2009.

J. Krarup and P. Mark-pruzan, The simple plant location problem: survey and synthesis, European Journal of Operational Research, vol.12, issue.1, pp.36-81, 1983.

L. Lovász, Submodular functions and convexity, Mathematical Programming The State of the Art, pp.235-257, 1983.

S. and T. Mccormick, Submodular function minimization, Discrete Optimization, vol.12, pp.321-391, 2005.

K. Nagano, On convex minimization over base polytopes, Integer Programming and Combinatorial Optimization, vol.4513, pp.252-266, 2007.

. James-b-orlin, A faster strongly polynomial time algorithm for submodular function minimization, Mathematical Programming, vol.118, issue.2, pp.237-251, 2009.

A. Schrijver, A combinatorial algorithm minimizing submodular functions in strongly polynomial time, Journal of Combinatorial Theory, Series B, vol.80, issue.2, pp.346-355, 2000.

A. Schrijver, Combinatorial optimization: polyhedra and efficiency, 2002.

Y. Sharma, C. Swamy, and D. Williamson, Approximation algorithms for prize collecting forest problems with submodular penalty functions, Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, SODA '07, pp.1275-1284, 2007.

Z. Shen, C. R. Coullard, and M. S. Daskin, A joint location -inventory model, Transportation Science, vol.37, issue.1, pp.40-55, 2003.

D. Vainsencher, O. Dekel, and S. Mannor, Bundle selling by online estimation of valuation functions, Proceedings the 28th International Conference on Machine Learning (USA), pp.1137-1144, 2011.