. Vélib-'et-moi, -regulation-succes-et- ambitions, 2011.

T. Achterberg, T. Koch, and A. Martin, Branching rules revisited, Operations Research Letters, vol.33, issue.1, pp.42-54, 2005.
DOI : 10.1016/j.orl.2004.04.002

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

S. Anily and J. Bramel, Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries, Naval Research Logistics, vol.2, issue.6, pp.654-670, 1999.
DOI : 10.1002/(SICI)1520-6750(199909)46:6<654::AID-NAV4>3.0.CO;2-A

S. Anily and R. Hassin, The swapping problem, Networks, vol.117, issue.4, pp.419-433, 1992.
DOI : 10.1002/net.3230220408

C. Archetti, M. Speranza, and A. Hertz, A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem, Transportation Science, vol.40, issue.1, 2006.
DOI : 10.1287/trsc.1040.0103

C. Archetti and M. G. Speranza, An Overview on the Split Delivery Vehicle Routing Problem, Operations Research Proceedings 2006, Operations Research Proceedings, pp.123-127, 2007.
DOI : 10.1007/978-3-540-69995-8_20

C. Archetti, N. Bianchessi-maria-garzia, A. Speranza, and . Hertz, A column generation approach for the split delivery vehicle routing problem, Networks, vol.19, issue.4, 2011.
DOI : 10.1002/net.20467

R. Baldacci, E. Bartolini, and A. Mingozzi, An Exact Algorithm for the Pickup and Delivery Problem with Time Windows, Operations Research, vol.59, issue.2, pp.414-426, 2011.
DOI : 10.1287/opre.1100.0881

R. Baldacci, N. Christophides, and A. Mingozzi, An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts, Mathematical Programming, vol.120, issue.2, pp.351-385, 2008.
DOI : 10.1007/s10107-007-0178-5

E. Bambaron, Vélib' peine à trouver un second souffle. Le Figaro, Mars, 2010.

C. Barnhart, E. L. Johnson, G. L. Nemhauser, M. W. Savelsbergh, and P. H. Vance, Branch-and-Price: Column Generation for Solving Huge Integer Programs, Operations Research, vol.46, issue.3, pp.316-329, 1996.
DOI : 10.1287/opre.46.3.316

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

M. Benchimol, P. Benchimol, B. Chappert, A. De-la-taille, F. Laroche et al., Balancing the stations of a self service ???bike hire??? system, RAIRO - Operations Research, vol.45, issue.1, pp.37-61, 2011.
DOI : 10.1051/ro/2011102

URL : https://hal.archives-ouvertes.fr/hal-00601443

G. Berbeglia, J. Cordeau, I. Gribkovskaia, and G. Laporte, Static pickup and delivery problems: a??classification scheme and survey, TOP, vol.41, issue.2, pp.1-31, 2007.
DOI : 10.1007/s11750-007-0009-0

B. Beroud, Les expériences de vélos en libre service en Europe. Transports urbains, 2007.

P. Dimitri, J. N. Bertsekas, and . Tsitsiklis, Neuro-Dynamic Programming, Athena Scientific, 1996.

C. James and . Bezdek, Pattern Recognition with Fuzzy Objective Function Algorithms, 1981.

B. Fr and I. Voigt, Der Handlungsreisende ? wie er sein soll und was er zu thun hat, um Aufträge zu erhalten und eines glücklichen Erfolgs in seinen Geschäften gewiß zu sein ? von einem alten Commis-Voyageur, 1832.

C. Bordenave, M. Gendreau, and G. Laporte, A branch-and-cut algorithm for the preemptive swapping problem, Networks, vol.92, issue.4, pp.387-399, 2012.
DOI : 10.1002/net.20447

J. Carlier, F. Clautiaux, and A. Moukrim, New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation, Computers & Operations Research, vol.34, issue.8, pp.2223-2250, 2007.
DOI : 10.1016/j.cor.2005.08.012

D. Chemla, F. Meunier, and R. W. Calvo, The multiple-vehicle balancing problem, Working Paper, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01351215

D. Chemla, F. Meunier, and R. W. Calvo, Bike hiring system: solving the rebalancing problem in the static case. Discrete Optimization

D. Chemla, F. Meunier, T. Pradeau, R. W. Calvo, and H. Yahiaoui, Bike sharing system: simulation, repositioning, pricing. Working Paper, 2012.

F. Clautiaux, C. Alves, and J. Valério-de-carvalho, A survey of dual-feasible and superadditive functions, Annals of Operations Research, vol.183, issue.6, pp.317-342, 2010.
DOI : 10.1007/s10479-008-0453-8

URL : https://hal.archives-ouvertes.fr/inria-00522674

C. Contardo, C. Morency, and L. Rousseau, Balancing a Dynamic Public Bike-Sharing System, 2012.

Y. Crozet, Le temps et le transport de voyageurs, European Conference of Ministers of Transport, 2005.

G. B. Dantzig, R. Fulkerson, and S. M. Johnson, Solution of a Large-Scale Traveling-Salesman Problem, Journal of the Operations Research Society of America, vol.2, issue.4, pp.393-410, 1954.
DOI : 10.1287/opre.2.4.393

B. George, J. H. Dantzig, and . Ramser, The truck dispatching problem, Management Science, vol.6, issue.1, pp.80-91, 1959.

P. Demaio, Bike-sharing: History, Impacts, Models of Provision, and Future, Journal of Public Transportation, vol.12, issue.4, pp.41-56, 2009.
DOI : 10.5038/2375-0901.12.4.3

M. Desrochers and G. Laporte, Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints, Operations Research Letters, vol.10, issue.1, pp.27-36, 1991.
DOI : 10.1016/0167-6377(91)90083-2

M. Dror and P. Trudeau, Savings by Split Delivery Routing, Transportation Science, vol.23, issue.2, pp.141-145, 1989.
DOI : 10.1287/trsc.23.2.141

M. Dror and P. Trudeau, Split delivery routing, Naval Research Logistics (NRL), vol.11, issue.1, pp.383-402, 1990.
DOI : 10.1002/nav.3800370304

L. Dubost, R. Gonzalez, and C. Lemaréchal, A primal-proximal heuristic applied to the French Unit-commitment problem, Mathematical Programming, vol.3, issue.1, pp.129-151, 2005.
DOI : 10.1007/s10107-005-0593-4

C. Joseph and . Dunn, A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters, Journal of Cybernetics, vol.3, issue.3, pp.32-57, 1973.

J. Edmonds and R. M. Karp, Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems, Journal of the ACM, vol.19, issue.2, pp.248-264, 1972.
DOI : 10.1145/321694.321699

P. Fay, Vélib', un système qui peut coûter cher, Europe, vol.1, 2011.

P. Sándor, J. Fekete, and . Schepers, New classes of fast lower bounds for bin packing problems, Mathematical Programming, pp.11-31, 2001.

C. Erlon, . Finardi, L. Edson, C. Da-silva, and . Sagastizàbal, Solving the unit commitment problem of hydropower plants via lagrangian relaxation and sequential quadratic programming, Computational & Applied Mathematics, vol.24, issue.12, pp.317-342, 2005.

P. Flajolet and R. Sedgewick, Analytic Combinatorics, 2009.
DOI : 10.1017/CBO9780511801655

URL : https://hal.archives-ouvertes.fr/inria-00072739

A. Frangioni, C. Gentile, and F. Lacalandra, Solving unit commitment problems with general ramp constraints, International Journal of Electrical Power & Energy Systems, vol.30, issue.5, pp.316-326, 2008.
DOI : 10.1016/j.ijepes.2007.10.003

C. Fricker and N. Gast, Incentives and regulations in bike-sharing systems with stations of finite capacity. Working Paper, 2012.

T. Gallai, Maximum-minimum theorems for networks, 1957.

M. Gendreau, A. Hertz, and G. Laporte, A Tabu Search Heuristic for the Vehicle Routing Problem, Management Science, vol.40, issue.10, pp.1276-1290, 1994.
DOI : 10.1287/mnsc.40.10.1276

M. Gendreau, G. Laporte, and C. Bordenave, A branch-and-cut algorithm for the non-preemptive swapping problem, Naval Research Logistics, 2009.

K. David, C. H. George, and . Xia, Fleet-sizing and service availability for a vehicle rental system via closed queueing networks, European Journal of Operational Research, vol.211, issue.1, pp.198-207, 2011.

M. Held and R. M. Karp, A Dynamic Programming Approach to Sequencing Problems, Journal of the Society for Industrial and Applied Mathematics, vol.10, issue.1, pp.196-210, 1962.
DOI : 10.1137/0110015

S. Irnich and G. Desaulniers, Shortest path problems with resource constraints. Columns Generation, pp.33-65, 2005.
DOI : 10.1007/0-387-25486-2_2

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

J. Kallrath, P. M. Pardalos, S. Rebennack, and M. Scheidt, Optimization in the Energy Industry, 2009.
DOI : 10.1007/978-3-540-88965-6

A. Spiridon and . Kazarlis, Anastasios Bakirtzis, and Vassilios Petridis. A genetic algorithm approach to solve the unit commitment problem, IEEE Transactions on Power Systems, vol.11, pp.83-92, 1996.

I. Mohand, M. Khemmoudj, H. Porcheron, and . Bennaceur, When constraints programming and local search solve the scheduling problem of edf nuclear power plant aoutages, 12th Internationnal Conference on Principles and Practice of Constraint Programming, pp.271-283, 2006.

B. Korte and J. Vygen, Combinatorial Optimization: Theory and Algorithms, 2002.

N. Lathia, S. Ahmad, and L. Capra, Measuring the impact of opening the London shared bicycle scheme to casual users, Transportation Research Part C, 2012.
DOI : 10.1016/j.trc.2011.12.004

J. Lin and T. Yang, Strategic design of public bicycle sharing systems with service level constraints, Transportation Research Part E: Logistics and Transportation Review, vol.47, issue.2, pp.284-294, 2011.
DOI : 10.1016/j.tre.2010.09.004

E. Marco, J. Lubbecke, and . Desrosiers, Selected topics in column generation, Operations Research, pp.1007-1023, 2005.

R. Lusby, L. F. Muller, and B. Petersen, A solution approach to the roadef/euro 2010 challenge based on benders decomposition, 2010.

G. Monge, Mémoire sur la théorie des déblais et des remblais, pp.666-704

P. Moscato, On evolution, search, optimization, genetic algorithms and martial arts towards memetic algorithms, 1989.

R. Motwani and P. Chalasani, Approximating capacitated routing and delivery problems, SIAM Journal on Computing, vol.28, 2009.

D. Naddef, P. Augerat, J. M. Belenguer, E. Benavent, and A. Corbéran, Separating capacity constraints in the cvrp using tabu search, European Journal of Operational Research, vol.106, pp.2-3546, 1998.

H. Hernandez, P. , and J. González, The One-Commodity Pickup-and-Delivery Travelling Salesman Problem, Lecture Notes in Computer Science, vol.2570, pp.89-104, 2002.
DOI : 10.1007/3-540-36478-1_10

H. Hernandez, P. , and J. González, A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery, Discrete Applied Mathematics, vol.145, issue.1, pp.126-139, 2004.
DOI : 10.1016/j.dam.2003.09.013

H. Hernandez, P. , and J. González, Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem, Transportation Science, vol.38, issue.2, pp.245-255, 2004.
DOI : 10.1287/trsc.1030.0086

H. Hernandez, P. , and J. González, The one-commodity pickupand-delivery travelling salesman problem: inequalities and algorithms. Networks, pp.258-272, 2007.

H. Hernandez-pérez, J. Inmaculada-rodriguez-martin, and . González, A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem, Computers & Operations Research, vol.36, issue.5, pp.1639-1645, 2009.
DOI : 10.1016/j.cor.2008.03.008

D. Pesach, T. Raviv, and M. Tzur, Dynamic Repositioning in a Bike-Sharing System Models and Solution Approaches. Working Paper, 2011.

M. Porcheron, A. Gorge, O. Juen, T. Simovic, G. Dereu et al., Challenge roadef/euro 2010 :a large-scale energy management problem with varied constraints, 2010.

C. Prins, A simple and effective evolutionary algorithm for the vehicle routing problem, Computers & Operations Research, vol.31, issue.12, pp.1985-2002, 2004.
DOI : 10.1016/S0305-0548(03)00158-8

T. Raviv and O. Kolka, Optimal inventory management of a bike-sharing station. Working Paper, 2011.

T. Raviv, M. Tzur, and I. Forma, Static repositioning in a bike-sharing system: models and solution approaches, EURO Journal on Transportation and Logistics, vol.39, issue.1, 2009.
DOI : 10.1007/s13676-012-0017-6

A. Rozenknop, R. W. Calvo, L. Alfandari, D. Chemla, and L. Létocart, Solving eletricity production planning by column generation, Journal of Scheduling, 2012.
DOI : 10.1007/s10951-012-0286-9

A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency, 2003.

S. A. Shaheen, S. Guzman, and H. Zhang, Bikesharing in Europe, the Americas, and Asia, Transportation Research Record: Journal of the Transportation Research Board, vol.2143, pp.159-167, 2010.
DOI : 10.3141/2143-20

A. Herbert and . Simon, The architecture of complexity, Proceedings of the American Philosophical Society, pp.467-482, 1962.

L. Spinney, Les maths au secours du " vélopartage " . Le Temps, 2011.

P. Toth and D. Vigo, The Vehicle Routing Problem, 2002.
DOI : 10.1137/1.9780898718515

URL : https://hal.archives-ouvertes.fr/hal-01223571

P. Vogel and D. C. Mattfeld, Anticipating usage patterns in the design of bikesharing systems, In INFORMS, 2011.

A. Wagelmans, S. Van-hoesel, and A. Kolen, Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case, Operations Research, vol.40, issue.1-supplement-1, pp.145-156, 1992.
DOI : 10.1287/opre.40.1.S145

M. Harvey, T. M. Wagner, and . Whitin, Dynamic version of the economic lot size model, Management Science, vol.5, pp.89-96, 1958.

A. Laurence and . Wolsey, Integer Programming, 1998.

K. Zavitsas, I. Kaparias, and M. G. Bell, Transport problems in cities, 2010.