. Cisco, The Zettabyte Era: Trends and Analysis, pp.1-29, 2017.

P. S. Khodashenas, J. M. Rivas-moscoso, D. Siracusa, F. Pederzolli, B. Shariati et al., Comparison of Spectral and Spatial Super-Channel Allocation Schemes for SDM Networks, J Lightwave Technol, vol.34, pp.2710-2716, 2016.

M. Klinkowski, P. Lechowicz, and K. Walkowiak, Survey of resource allocation schemes and algorithms in spectrally-spatially flexible optical networking, Opt Switch Netw, vol.27, pp.58-78, 2018.

D. Klonidis, F. Cugini, O. Gerstel, M. Jinno, V. Lopez et al., Spectrally and Spatially Flexible Optical Network Planning and Operations, IEEE Comm Mag, vol.53, pp.69-78, 2015.

G. Li, N. Bai, N. Zhao, and C. Xia, Space-division multiplexing: the next frontier in optical communication, Adv. Opt. Photon, vol.6, issue.4, pp.413-487, 2014.

Y. Li, N. Hua, and X. Zheng, Routing, wavelength and core allocation planning for multi-core fiber networks with MIMO-based crosstalk suppression, Opto-Electronics and Communications Conference (OECC, pp.1-3, 2015.

A. Muhammad, G. Zervas, G. Saridis, E. H. Salas, D. Simeonidou et al., Flexible and synthetic SDM networks with multi-core-fibers implemented by programmable ROADMs, The European Conference on Optical Communication (ECOC, pp.1-3, 2014.

A. Muhammad, G. Zervas, D. Simeonidou, and R. Forchheimer, Routing, spectrum and core allocation in flexgrid SDM networks with multi-core fibers, Proc. Optical Network Design and Modeling (ONDM, pp.192-197, 2014.

J. Perello, J. M. Genã?, A. Pagã?s, J. A. Lazaro, and S. Spadaro, Flexgrid/SDM backbone network design with inter-core XT-limited transmission reach, J Opt Commun Netw, vol.8, pp.540-552, 2016.

M. Pióro and D. Medhi, Routing, Flow, and Capacity Design in Communication and Computer Networks, 2004.

C. Rottondi, P. Boffi, P. Martelli, and M. Tornatore, Routing, Modulation Format, Baud Rate and Spectrum Allocation in Optical Metro Rings With Flexible Grid and Few-Mode Transmission, J Lightwave Technol, vol.35, pp.61-70, 2017.

C. Rottondi, M. Tornatore, and G. Gavioli, Optical Ring Metro Networks With Flexible Grid and Distance-Adaptive Optical Coherent Transceivers, Bell Labs Technical Journal, vol.18, pp.95-110, 2013.

G. M. Saridis, D. Alexandropoulos, G. Zervas, and D. Simeonidou, Survey and Evaluation of Space Division Multiplexing: From Technologies to Optical Networks, IEEE Commun Surv Tut, vol.17, pp.2136-2156, 2015.

K. Walkowiak, Modeling and Optimization of Cloud-Ready and Content-Oriented Networks, 2016.

K. Walkowiak, P. Lechowicz, M. Klinkowski, and A. Sen, ILP modeling of flexgrid SDM optical networks, Proc. Telecommunications Network Strategy and Planning Symposium (Networks, pp.121-126, 2016.

L. Zhang, N. Ansari, and A. Khreishah, Anycast Planning in Space Division Multiplexing Elastic Optical Networks With Multi-Core Fibers, IEEE Commun Lett, vol.20, pp.1983-1986, 2016.

U. Aldasoro, L. F. Escudero, M. Merino, J. F. Monge, and G. Pérez, A parallel Branch-and-Fix Coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0-1 problems, European Journal of Operational Research, vol.258, pp.590-606, 2017.

A. Alonso-ayuso, F. Carvallo, L. F. Escudero, M. Guignard, J. Pi et al., On the optimization of copper extraction in mining under uncertainty in copper prices, European Journal of Operational Research, vol.233, pp.711-726, 2014.

A. Alonso-ayuso, L. F. Escudero, F. J. Martín-campo, and J. F. Monge, On the strategic multistage scenario tree, tactical multi-horizon graphs in electricity Transmission / Generation network capacity Expansion Planning, TGEP. EC COST TD1207-2017, Final Conference, 2017.

K. An and H. K. Lo, Service Reliability-based transit network design with stochastic demand, Transportation Research Record, vol.2467, pp.101-109, 2014.

K. An and H. K. Lo, A robust transit network design with stochastic demand considering development density, Transportation Research Part B, vol.81, pp.737-754, 2015.

K. An and H. K. Lo, Two-phase stochastic program for transit network design under demand uncertainty, Transportation Research Part B, vol.81, pp.157-181, 2016.

A. Bärmann, A. Martin, and H. Schülldorf, A decomposition method for multiperiod railway network expansion, with a case study for Germany, Transportation Science, vol.51, pp.1102-1121, 2017.

D. Bertsimas and M. Slim, The price of robustness, Operations Research, vol.52, pp.35-53, 2004.

V. Cacchiani, A. Caprara, L. Galli, L. Kroon, G. Maróti et al., Railway rolling stock planning: Robustness against large disruptions, Transportation Science, vol.46, pp.217-232, 2012.

L. Cadarso and A. Marín, Improved rapid transit network design model: considering transfer effects, Annals of Operations Research, pp.1-21, 2015.

L. Cadarso and A. Marín, Combining robustness and recovery in rapid transit network design, Transportmetrica A: Transport Science, vol.12, pp.203-229, 2016.

L. Cadarso, A. Marín, and G. Maroti, Recovery of disruptions in rapid transit networks, Transportation Research Part E: Logistics and Transportation Review, vol.53, pp.15-33, 2013.

L. Cadarso, G. Maroti, and A. Marín, Smooth and controlled recovery planning of disruptions in rapid transit networks, IEEE Transactions on Intelligent Transportation Systems, vol.16, pp.2192-2202, 2015.

L. Cadarso, L. F. Escudero, and A. Marín, On strategic multistage operational two-stage stochastic 0-1 optimization for the Rapid Transit Network Design problem, European Journal of Operational Research, vol.271, issue.2, pp.577-593, 2018.

A. Caprara, L. Galli, S. Stiller, and P. Toth, Recoverable-robust plataforming by network buffering, 2008.

S. Cicerone, G. Dâ??angelo, G. D. Stefano, D. Frigioni, A. Navarra et al., Recoverable robustness in shunting and timetabling, Robust and On-Line Large Scale Optimization, pp.28-60, 2009.

E. Codina, A. Marín, and L. Cadarso, Robust Infrastructure Design in Rapid Transit Rail systems, Transportation Research Procedia, vol.3, pp.660-669, 2014.

D. Dentcheva and A. Ruszczynski, Optimization with stochastic dominance constraints, SIAM Journal on Optimization, vol.14, pp.548-566, 2003.

L. F. Escudero, A. Garín, and A. Unzueta, Cluster Lagrangean decomposition for risk averse in multistage stochastic optimization, Computers and Operations Research, vol.85, pp.154-171, 2017.

L. F. Escudero and J. F. Monge, On capacity expansion planning under strategic and operational uncertainties based on stochastic dominance risk averse management, Computational Management Science, vol.15, pp.479-500, 2018.

L. F. Escudero, J. F. Monge, and D. Romero-morales, On time-consistent stochastic dominance risk averse measure for tactical supply chain planning under uncertainty. Computers and Operations Research, 2017.

L. F. Escudero and S. Muñoz, An approach for solving a modification of the extended rapid transit network design problem, TOP, vol.17, pp.320-334, 2009.

M. Fischetti, D. Salvagnin, and A. Zanette, Fast approaches to improve the robustness of a railway timetable, Transportation Science, vol.43, pp.321-335, 2009.

M. Kaut, K. T. Midthun, A. S. Werner, A. Tomasgard, L. Hellemo et al., Dual-level scenario trees â?? scenario generation and applications in energy planning, Computational Management Science, vol.11, pp.179-193, 2014.

G. Laporte, A. Marín, J. A. Mesa, and F. A. Ortega, An integrated methodology for the rapid transit network design problem, pp.187-199, 2007.

G. Laporte, A. Marín, J. A. Mesa, and F. Perea, Designing robust rapid transit networks with alternative routes, Journal of advanced transportation, vol.45, pp.54-65, 2011.

G. Laporte and J. A. Mesa, The design of rapid transit networks, Location Science, pp.581-594

. Springer, , 2015.

C. Liebchen, M. Lãijbbecke, R. Möhring, and S. Stiller, The Concept of recoverable robustness, linear programming recovery and railway applications, Robust and Online Large-Scale Optimization, 2009.

A. Marín, An extension to rapid transit network design problem, TOP, vol.15, pp.231-241, 2007.

A. Marín and P. Jaramillo, Urban rapid transit network capacity expansion, European Journal of Operational Research, vol.191, pp.45-60, 2008.

G. Ch, Pflug and W. Römisch. Modeling, measuring and managing risk, 2007.

A. Shapiro and A. Pichler, Time and Dynamic Consistency of Risk Averse Stochastic Programs, 2016.

A. S. Werner, A. Pichler, K. T. Midthun, L. Hellemo, and A. Tomasgard, Handbook of Risk Management in Energy Production and Trading, pp.177-201, 2013.

E. R. Barnes, An algorithm for partitioning the nodes of a graph, SIAM Journal on Algebraic and Discrete Mathematics, vol.3, pp.541-555, 1982.

L. Bicalho, A. Da-cunha, and A. Lucena, Branch-and-cut-and-price algorithms for the Degree Constrained Minimum Spanning Tree Problem, Computational Optimization and Applications, vol.63, pp.755-792, 2016.

P. Brucker, Optimization and Operations Research, Chapter On the complexity of clustering problems, vol.157, pp.45-54, 1978.

M. Campêlo, R. Corrêa, and Y. Frota, Cliques, holes and the vertex coloring polytope, Inform. Process. Lett, vol.89, pp.159-164, 2004.

M. Poggi-de-aragão and E. Uchoa, The ? ?connected assignment problem, European Journal of Operational Research, vol.118, pp.127-138, 1999.

S. Jitender, D. Deogun, G. Kratsch, and . Steiner, An approximation algorithm for clustering graphs with dominating diametral path, Inform. Process. Lett, vol.61, pp.121-127, 1997.

J. Edachery, A. Sen, and F. J. Brandenburg, Graph drawing, Chapter Graph Clustering Using Distance-k cliques, vol.1731, pp.98-106, 1999.

J. Falkner, F. Rendl, and H. Wolkowicz, A computational study of graph partitioning, Mathematical Programming, vol.66, pp.211-224, 1994.

M. R. Garey, D. S. Johnson, and L. Stockmeyer, Some simplified NPcomplete graph problems, Theoretical Computer Science, vol.1, pp.237-267, 1976.

B. Gavish, Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem, J. ACM, vol.30, pp.118-132, 1983.

W. Hager and Y. Krulyuk, Multiset graph partitioning, Mathematical Methods of OR, vol.55, pp.1-10, 2002.

W. W. Hager, D. T. Phan, and H. Zhang, An exact algorithm for graph partitioning, Mathematical Programming, vol.137, pp.531-556, 2013.

T. Ito, T. Nishizeki, M. Schröeder, T. Uno, and X. Zhou, Partitioning a Weighted Tree into Subtrees with Weights in a Given Range, Algorithmica, vol.62, pp.823-841, 2012.

E. L. Johnson, A. Mehrotra, and G. L. Nemhauser, Min-cut clustering, Mathematical Programming, vol.62, pp.133-151, 1993.

N. P. Kruyt, A conjugate gradient method for the spectral partitioning of graphs, Parallel Comput, vol.22, pp.1493-1502, 1997.

G. Laporte, Y. Nobert, and M. Desrochers, Optimal Routing under Capacity and Distance Restrictions, Operations Research, vol.33, pp.1050-1073, 1985.

I. Lari, F. Ricca, J. Puerto, and A. Scozzari, Partitioning a Graph into Connected Components with Fixed Centers and Optimizing Cost-Based Objective Functions or Equipartition Criteria, Networks, vol.67, pp.69-81, 2016.

F. Murtagh, A Survey of Algorithms for Contiguity-constrained Clustering and Related Problems, Comput. J, vol.28, pp.82-88, 1985.

. Murtagh, Maximum Split Clustering Under Connectivity Constraints, Journal of Classification, vol.20, pp.143-180, 2003.

J. Nossack and E. Pesch, A branch-and-bound algorithm for the acyclic partitioning problem, Computers & Operations Research, vol.41, pp.174-184, 2014.

M. W. Padberg and G. Rinaldi, A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems, SIAM review, vol.33, pp.60-100, 1991.

M. W. Padberg and L. A. Wolsey, Trees and cuts, Annals of Discrete Mathematics, vol.17, pp.511-517, 1983.

A. Pothen, H. D. Simon, and K. P. Liou, Partitioning sparse matrices with eigenvectors of graphs, SIAM J. Matrix Anal. Appl, vol.11, pp.430-452, 1990.

F. Rendl and H. Wolkowicz, A projection tecnhique for partitioning the nodes of a graph, Ann. Oper. Res, vol.581, pp.172-191, 1995.

E. Satu and . Schaeffer, Graph clustering, Computer Science Review, vol.1, pp.27-64, 2007.

E. Uchoa, R. Fukasawa, J. Lysgaard, A. Pessoa, D. Poggi-de-aragão et al., Robust branch-cut-and-price for the Capacitated Minimum Spanning Tree problem over a large extended formulation, Mathematical Programming, vol.112, pp.446-472, 2008.

H. Wolkowicz and Q. Zhao, Semidefinite programming relaxations for the graph partitioning problem, Discrete Appl. Math, vol.96, issue.97, pp.467-547, 1999.

K. Ravindra, T. L. Ahuja, J. B. Magnanti, and . Orlin, Network Flows: Theory, Algorithms and Applications, 1993.

?. Kuban-alt?nel, N. Aras, Z. ?uvak, and Z. Caner-ta?k?n, Minimum Cost Non-crossing Flow Problem on Layered Networks, Discrete Appl. Math, 2018.

R. Mariem-ben-salem, A. R. Taktak, H. Mahjoub, and . Benabdallah, Optimization Algorithms for the Disjunctively Constrained Knapsack Problem, Soft Comput, vol.22, issue.6, pp.2025-2043, 2018.

A. Bettinelli, V. Cacchiani, and E. Malaguti, A Branchand-Bound Algorithm for the Knapsack Problem with Conflict Graph. IN-FORMS, J. Comput, vol.29, pp.457-473, 2017.

R. Capua, Y. Frota, and L. Ochi, A Study on Exponentialsize Neighborhoods for the Bin Packing Problem with Conflicts, J. Heuristics, vol.24, pp.667-695, 2018.

F. Carrabs, R. Cerulli, R. Pentangelo, and A. Raiconi, Minimum Spanning Tree with Conflicting Edge Pairs: a Branch-and-Cut Approach, Ann. Oper. Res, 2018.

A. Darmann, U. Pferschy, J. Schauer, and G. J. , Woeginger. 2011. Path, Trees and Matchings under Disjunctive Constraints, Discrete Appl. Math, vol.159, pp.1726-1735, 2011.

R. Duan and S. Pettie, Linear-Time Approximation for Maximum Weight Matching, J. Assoc. Comput. Mach, vol.61, pp.1-23, 2014.

J. Edmonds, Maximum Matching and a Polyhedron with 0,1-Vertices, J. Res. Natl. Bur. Stand. 69B, vol.1, issue.2, pp.125-130, 1965.

A. M. Ficker, C. R. Frits, G. J. Spieksma, and . Woeginger, Transportation Problem with Conflicts. Ann. Oper. Res, pp.1-21, 2018.

R. Michael, D. S. Garey, and . Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness, 1979.

M. Gendreau, G. Laporte, and F. Semet, Heuristics and Lower Bounds for the Bin Packing Problem with Conflicts, Comput. Oper. Res, vol.31, issue.3, pp.195-203, 2004.

D. Goossens, C. R. Frits, and . Sieksma, The Transportation Problem with Exclusionary Side Constraints. 4OR-Q, J. Oper. Res, vol.7, pp.51-60, 2009.

C. Chien, T. Huang, and . Kavitha, New Algorithms for Maximum Weight Matching and a Decomposition Theorem, Math. Oper. Res, vol.42, issue.2, pp.411-426, 2017.

T. Öncan and ?. Kuban-alt?nel, A Branch-and-Bound Algorithm for the Minimum Cost Bipartite Perfect Matching Problem with Conflict Pair Constraints. Electron. Notes Discrete Math, vol.64, pp.5-14, 2018.

T. Öncan, R. Zhang, and A. P. Punnen, The Minimum Cost Perfect Matching Problem with Conflict Pair Constraints, Comput. Oper. Res, vol.40, issue.4, pp.920-930, 2013.

R. J. Patric and . Östergård, A New Algorithm for the Maximum-Weight Clique Problem, Electron. Notes Discrete Math, vol.3, pp.80045-80054, 1999.

R. J. Patric and . Östergård, A Fast Algorithm for the Maximum Clique Problem, Discrete Appl. Math, vol.120, pp.290-296, 2002.

U. Pferschy and J. Schauer, The Knapsack Problem with Conflict Graphs, J. Graph Algorithms Appl, vol.13, pp.233-249, 2009.

U. Pferschy and J. Schauer, The Maximum Flow Problem with Disjunctive Constraints, J. Comb. Optim, vol.26, pp.109-119, 2013.

R. Sadykov and F. Vanderbeck, Bin Packing with Conflicts: a Generic Branch-and-Price Algorithm, INFORMS J. Comput, vol.25, pp.244-255, 2013.
URL : https://hal.archives-ouvertes.fr/inria-00539869

P. Samer and S. Urrutia, A Branch and Cut Algorithm for Minimum Spanning Trees under Conflict Constraints, Optim. Lett, vol.9, pp.41-55, 2015.

M. Sun, The Transportation Problem with Exclusionary Side Constraints and Two Branch-and-Bound Algorithms, Eur. J. Oper. Res, vol.140, pp.239-248, 2002.

R. Zhang, N. Santosh, A. P. Kabadi, and . Punnen, The Minimum Spanning Tree Problem with Conflict Constraints and its Variations, 2011.

D. Optim, , vol.8, pp.191-205, 2011.

Z. Allybokus, N. Perrot, J. Leguay, L. Maggi, and E. Gourdin, Virtual Function Placement for Service Chaining with Partial Orders and Anti-Affinity Rules, Networks, vol.71, pp.97-106, 2018.

C. J. Bernardos, A. Rahman, and A. Mourad, Service Function Chaining Use Cases in Fog RAN. Internet-Draft draft-bernardos-sfc-fog-ran-04. Internet Engineering Task Force, 2018.

A. Engelmann and A. Jukan, A Reliability Study of Parallelized VNF Chaining, 2017.

. Etsi, Network Functions Virtualisation (NFV) ; Reliability ; Report on Models and Features for End-to-End Reliability, 2016.

W. E. Hart, C. D. Laird, J. P. Watson, D. L. Woodruff, G. A. Hackebeil et al., Pyomo-optimization modeling in python, vol.67, 2017.

A. Hmaity, M. Savi, F. Musumeci, M. Tornatore, and A. Pattavina, Virtual Network Function placement for resilient Service Chain provisioning, 8th International Workshop on Resilient Networks Design and Modeling (RNDM), pp.245-252, 2016.

. Ibm-ilog, IBM ILOG CPLEX V12.6: User's manual for CPLEX, 2015.

J. Kong, I. Kim, X. Wang, Q. Zhang, H. C. Cankaya et al., Guaranteed-Availability Network Function Virtualization with Network Protection and VNF Replication, GLOBECOM 2017 -2017 IEEE Global Communications Conference, pp.1-6, 2017.

S. Matsushima and R. Wakikawa, Internet-Draft draft-matsushima-stateless-uplanevepc-06. Internet Engineering Task Force, 2016.

J. Napper, M. Stiemerling, D. Lopez, and J. Uttaro, Service Function Chaining Use Cases in Mobile Networks. Internet-Draft draft-ietf-sfc-use-casemobility-08. Internet Engineering Task Force, 2018.

L. Qu, C. M. Assi, K. B. Shaban, and M. J. Khabbaz, A Reliability-Aware Network Service Chain Provisioning With Delay Guarantees in NFV-Enabled Enterprise Datacenter Networks, IEEE Transactions on Network and Service Management, vol.14, pp.554-568, 2017.

D. A. Schult, Exploring network structure, dynamics, and function using NetworkX, Proceedings of the 7th Python in Science Conference (SciPy, pp.11-15, 2008.

W. Wang and J. Doucette, Availability optimization in shared-backup path protected networks, IEEE/OSA Journal of Optical Communications and Networking, vol.10, pp.451-460, 2018.

P. Avella, M. Boccia, C. Mannino, and I. Vasilyev, Valid Inequalities for Time-Indexed Formulations of the Runway Scheduling Problem, Supplementary Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School (DOOR 2016), pp.787-790, 2016.

P. Hansen and N. Mladenovi?, Variable neighborhood search: Principles and applications, European Journal of Operational Research, vol.130, pp.449-467, 2001.

A. Janiak, W. A. Janiak, T. Krysiak, and T. Kwiatkowski, A survey on scheduling problems with due windows, European Journal of Operational Research, vol.242, pp.347-357, 2015.

B. F. Rosa, M. J. Souza, S. R. Souza, P. Y. Michelon, and Z. Ales, Mathematical formulations for the job scheduling problem with due windows and setup times (in portuguese), Proceedings of the XLVIII Brazilian Symposium of Operational Research -XLVIII SBPO, pp.4140-4151, 2016.

B. F. Rosa, M. J. Souza, S. R. Souza, M. F. De-frança-filho, Z. Ales et al., Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties, Computers & Operations Research, vol.81, pp.203-215, 2017.

J. P. Sousa and L. A. Wolsey, A time indexed formulation of nonpreemptive single machine scheduling problems, Mathematical Programming, vol.54, pp.353-367, 1992.

S. Tanaka, An Exact Algorithm for the Single-Machine Earliness-Tardiness Scheduling Problem, Springer Optimization and Its Applications, vol.60, pp.21-40, 2012.

L. A. Wolsey, Integer programming, 1998.

A. Lm-ayompe, . Du-y, M. Mccormack, and . Conlon, Measured performance of a 1.72 kW rooftop grid connected photovoltaic system in Ireland, Energy conversion and management, vol.52, pp.816-825, 2011.

F. Balduzzi, A. Bianchini, E. Antonio-carnevale, L. Ferrari, and S. Magnani, Feasibility analysis of a Darrieus verticalaxis wind turbine installation in the rooftop of a building, Energy Solutions for a Sustainable World -Proceedings of the Third International Conference on Applied Energy, vol.97, pp.921-929, 2011.

P. Carroll, B. Fortz, M. Labbé, and S. Mcgarraghy, A branch-and-cut algorithm for the ring spur assignment problem, Networks, vol.61, pp.89-103, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01255253

C. , Clean Energy For All Europeans, 2016.

M. Fischetti and D. Pisinger, Optimal wind farm cable routing: Modeling branches and o shore transformer modules, 2018.

B. Fortz, M. Labbé, and F. Ma-oli, Solving the TwoConnected Network with Bounded Meshes Problem, Operations Research, vol.48, pp.866-877, 2000.
URL : https://hal.archives-ouvertes.fr/hal-01255611

H. William and . Kersting, Radial distribution test feeders, IEEE Transactions on Power Systems, vol.6, pp.975-985, 1991.

F. Kreikebaum, D. Das, Y. Yang, F. Lambert, and D. Divan, Smart Wires â?? A distributed, low-cost solution for controlling power ows and monitoring transmission lines, 2010 IEEE PES Innovative Smart Grid Technologies Conference Europe, pp.1-8, 2010.

F. Moret and P. Pinson, Energy Collectives: a Community and Fairness based Approach to Future Electricity Markets, IEEE Transactions on Power Systems, pp.1-1, 2018.

, Retail Market Design Service (RMDS), 2019.

D. Wiesmann, P. Inã?s-lima-azevedo, and J. E. Ferrã?o, Residential electricity consumption in Portugal: Findings from top-down and bottom-up models, Energy Policy, vol.39, pp.2772-2779, 2011.

Y. Azar, E. Cohen, and A. Fiat, Optimal oblivious routing in polynomial time, ACM Symp. on Theory of Computing, pp.383-388, 2003.

W. Ben-ameur and M. ?otkiewicz, Robust routing and optimal partitioning of a traffic demand polytope, Intl. Trans. in Operational Research, vol.18, pp.307-333, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00678809

W. Ben-ameur and M. ?otkiewicz, Multipolar routing: where dynamic and static routing meet, Electronic Notes in Discrete Mathematics, vol.41, pp.61-68, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00838434

T. Benson, A. Anand, A. Akella, and M. Zhang, MicroTE: Fine grained traffic engineering for data centers, Proc. ACM CoNext, vol.8, 2011.

P. Casas, L. Fillatre, and S. Vaton, Multi Hour Robust Routing and Fast Load Change Detection for Traffic Engineering, Proc. IEEE ICC, pp.5777-5782, 2008.

B. Fortz and M. Thorup, Optimizing OSPF/IS-IS weights in a changing world, IEEE JSAC, vol.20, pp.756-767, 2002.
URL : https://hal.archives-ouvertes.fr/hal-01255600

C. Hong, S. Kandula, and R. Mahajan, Achieving high utilization with software-driven WAN, ACM SIGCOMM CCR, vol.43, pp.15-26, 2013.

S. Jain, A. Kumar, and S. Mandal, B4: Experience with a globally-deployed software defined WAN, ACM SIGCOMM CCR, vol.43, pp.3-14, 2013.

M. Kodialam, S. Tv-lakshman, and . Sengupta, Efficient and robust routing of highly variable traffic, Proc. HotNets, 2004.

M. Pióro and D. Medhi, Routing, Flow, and Capacity Design in Communication and Computer Networks, 2004.

M. Poss and C. Raack, Affine recourse for the robust network design problem: Between static and dynamic routing, Networks, vol.61, pp.180-198, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00916978

M. Roughan, M. Thorup, and Y. Zhang, Traffic engineering with estimated traffic matrices, Proc. ACM IMC, 2003.

D. Sanvito, I. Filippini, A. Capone, S. Paris, and J. Leguay, Adaptive Robust Traffic Engineering in Software Defined Networks, Proc. IFIP Networking, 2018.

M. Silva, M. Poss, and N. Maculan, Solving the bifurcated and nonbifurcated robust network loading problem with k-adaptive routing, Networks, vol.72, pp.151-170, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01537872

A. Vahid-tabatabaee, B. Kashyap, . Bhattacharjee, J. Richard, M. A. La et al., Robust routing with unknown traffic matrices, Proc. IEEE INFOCOM, pp.2436-2440, 2007.

H. Wang, H. Xie, L. Qiu, Y. R. Yang, Y. Zhang et al., COPE: traffic engineering in dynamic networks, ACM SIGCOMM CCR, vol.36, pp.99-110, 2006.

Y. Zhang and Z. Ge, Finding critical traffic matrices, Proc. IEEE DSN, 2005.

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, pp.316-329, 1998.

J. Blazewicz, J. K. Lenstra, and A. H. Kan, Scheduling subject to resource constraints: classification and complexity, Discrete Applied Mathematics, vol.5, issue.1, pp.90012-90016, 1983.

, Workforce scheduling and routing problems : literature survey and computational study, pp.1-29, 2014.

J. A. Castillo-salazar, D. Landa-silva, and R. Qu, A greedy heuristic for workforce scheduling and routing with time-dependent activities constraints, International Conference on Operations Research and Enterprise Systems, 2015.

E. Choi and D. W. Tcha, A column generation approach to the heterogeneous fleet vehicle routing problem, Computers & Operations Research, vol.34, pp.2080-2095, 2007.

J. F. Cordeau, G. Laporte, F. Pasin, and S. Ropke, Scheduling technicians and tasks in a telecommunications company, Journal of Scheduling, vol.13, pp.393-409, 2010.

M. Desrochers, J. K. Lenstra, and M. W. Savelsbergh, A classification scheme for vehicle routing and scheduling problems, European Journal of Operational Research, vol.46, p.90007, 1990.

J. Desrosiers, Y. Dumas, M. Solomon, and F. Soumis, Time Constrained Routing and Scheduling, Handbooks in Operations Research and Management Science, vol.8, pp.80106-80115, 1995.

A. Dohn, M. S. Rasmussen, and J. Larsen, The vehicle routing problem with time windows and temporal dependencies, Networks, vol.58, pp.273-289, 2011.

M. Dror, Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW, vol.42, pp.977-978, 1994.

D. Feillet, A tutorial on column generation and branch-and-price for vehicle routing problems, A Quarterly Journal of Operations Research, vol.4, issue.4, pp.407-424, 2010.
URL : https://hal.archives-ouvertes.fr/emse-00505959

D. Feillet, P. Dejax, M. Gendreau, and C. Gueguen, An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems, Networks, vol.44, pp.216-229, 2004.

R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. Rinnooy-kan, Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey, Annals of Discrete Mathematics, vol.5, pp.287-326, 1979.

C. A. Hurkens, Incorporating the strength of MIP modeling in schedule construction, RAIRO -Operations Research, vol.43, 2009.

S. Irnich and G. Desaulniers, Shortest path problems with resource constraints, Column generation, pp.33-65, 2005.

P. Laborie and J. Rogerie, Reasoning with Conditional Time-Intervals, Proceedings of the Twenty-First International Florida Artificial Intelligence Research Society Conference, pp.555-560, 2008.

P. Laborie, J. Rogerie, P. Shaw, and P. Vilim, Reasoning with Conditional Time-Intervals. Part II: An Algebraical Model for Resources. FLAIRS Conference, pp.201-206, 2009.

B. J. Lageweg, J. K. Lenstra, E. L. Lawler, and A. H. Rinnooy-kan, Computer-Aided complexity classification of combinational problems, Commun. ACM, vol.25, pp.817-822, 1982.

E. L. Lawler, J. K. Lenstra, A. H. Rinnooy-kan, and D. B. Shmoys, Sequencing and scheduling: Algorithms and complexity, pp.80189-80195, 1993.

J. Lenstra, Personnel scheduling: A literature review, 2013.

S. Pokutta and G. Stauffer, France Telecom workforce scheduling problem: A challenge, RAIRO -Operations Research, vol.43, pp.375-386, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00442261

M. S. Rasmussen, The Home Care Crew Scheduling Problem: PreferenceBased Visit Clustering and Temporal Dependencies, 2010.

M. Solomon, Algorithms for the vehicle routing and scheduling problems with time window constraints, Operations research, vol.35, pp.254-265, 1987.

M. Solomon and J. Desrosiers, Survey Paper -Time Window Constrained Routing and Scheduling Problems, 1988.

J. N. Tsitsiklis, Special cases of traveling salesman and repairman problems with time windows, Networks, vol.22, pp.263-282, 1992.

J. Abara, Applying integer linear programming to the fleet assignment problem, Interfaces, vol.19, pp.20-28, 1989.

C. Barnhart, T. S. Kniker, and M. Lohatepanont, Itinerary-based airline fleet assignment, Transportation Science, vol.36, pp.199-217, 2002.

A. Ben-hur, D. Horn, H. T. Siegelmann, and V. Vapnik, Support vector clustering, J. Mach. Learn. Res, vol.2, pp.125-137, 2002.

A. Ben-tal, A. Goryashko, E. Guslitzer, and A. Nemirovski, Adjustable robust solutions of uncertain linear programs, Mathematical Programming, vol.99, pp.351-376, 2004.

A. Ben-tal and N. , A. Robust convex optimization. Math. Oper. Res, vol.23, pp.769-805, 1998.

A. Ben-tal and A. Nemirovski, Robust solutions of uncertain linear programs, Operations Research Letters, vol.25, pp.1-13, 1999.

D. Bertsimas, I. Dunning, and M. Lubin, Reformulation versus cuttingplanes for robust optimization, Computational Management Science, vol.13, issue.2, pp.195-217, 2016.

D. Bertsimas, M. Sim, and M. Zhang, Adaptive distributionally robust optimization, Management Science, 2018.

M. Boudia, T. Delahaye, S. Gabteni, and R. Acuna-agost, Novel approach to deal with demand volatility on fleet assignment models, Journal of the Operational Research Society, vol.69, pp.895-904, 2018.

E. Delage, Y. , and Y. , Distributionally robust optimization under moment uncertainty with application to data-driven problems, Operations Research, vol.58, pp.595-612, 2010.

C. A. Hane, C. Barnhart, E. L. Johnson, R. E. Marsten, G. L. Nemhauser et al., The fleet assignment problem: Solving a large-scale integer program, Math. Program, vol.70, pp.211-232, 1995.

N. Kenan, A. Jebali, and A. Diabat, An integrated flight scheduling and fleet assignment problem under uncertainty, Computers and Operations Research, vol.100, pp.333-342, 2018.

M. Lubin and I. Dunning, Computing in Operations Research using Julia, 2013.

C. Shang, X. Huang, and F. You, Data-driven robust optimization based on kernel learning, Computers and Chemical Engineering, vol.106, pp.464-479, 2017.

C. Shang and F. You, Distributionally robust optimization for planning and scheduling under uncertainty, Computers and Chemical Engineering, vol.110, pp.53-68, 2018.

H. D. Sherali, E. K. Bish, and X. Zhu, Airline fleet assignment concepts, models, and algorithms, European Journal of Operational Research, vol.172, pp.1-30, 2006.

S. Wold, K. Esbensen, G. , and P. , Principal component analysis, Chemometrics and Intelligent Laboratory Systems, vol.2, pp.37-52, 1987.

M. Khattar-awad, Y. Rafique, and R. A. Hallah, Energy-aware routing for software-defined networks with discrete link rates: A benders decomposition-based heuristic approach, Sustainable Computing: Informatics and Systems, vol.13, pp.31-41, 2017.

V. , Linear Programming, 1983.

A. Destounis, G. Paschos, S. Paris, J. Leguay, L. Gkatzikis et al., Slice-based column generation for network slicing, IEEE INFOCOM 2018 -Poster, 2018.

X. Foukas, G. Patounas, A. Elmokashfi, and M. K. Marina, Network slicing in 5g: Survey and challenges, 2017.

V. Gabrel, A. Knippel, and M. Minoux, Exact solution of multicommodity network optimization problems with general step cost functions, Operations Research Letters, vol.25, issue.1, pp.15-23, 1999.
URL : https://hal.archives-ouvertes.fr/hal-01150534

V. Gabrel, A. Knippel, and M. Minoux, A comparison of heuristics for the discrete cost multicommodity network optimization problem, Journal of Heuristics, vol.9, issue.5, pp.429-445, 2003.

L. Geng, J. Dong, S. Bryant, K. Makhijani, A. Galis et al., Network Slicing Architecture, 2017.

A. Juttner, B. Szviatovski, I. Mecs, and Z. Rajko, Lagrange relaxation based method for the qos routing problem, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213), vol.2, pp.859-868, 2001.

. Oif, Flex Ethernet 2.0 Implementation Agreement, 2018.

Y. Xiao, K. Thulasiraman, and G. Xue, Gen-larac: A generalized approach to the constrained shortest path problem under multiple additive constraints, Algorithms and Computation, 2005.

E. Balas, Machine sequencing via disjunctive graphs: an implicit enumeration algorithm, Operations research, vol.17, pp.941-957, 1969.

S. Bollapragada, R. Markley, H. Morgan, E. Telatar, S. Wills et al., A Novel Movement Planner System for Dispatching Trains, Interfaces, vol.48, pp.57-69, 2018.

Q. Cappart and P. Schaus, Rescheduling railway traffic on real time situations using time-interval variables, International Conference on AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pp.312-327, 2017.

F. Corman and L. Meng, A review of online dynamic models and algorithms for railway traffic management, IEEE Transactions on Intelligent Transportation Systems, vol.16, pp.1274-1284, 2015.

M. Fischetti and M. Monaci, Using a general-purpose mixedinteger linear programming solver for the practical solution of real-time train rescheduling, European Journal of Operational Research, vol.263, pp.258-264, 2017.

P. Kecman, F. Corman, A. D. Ariano, and R. Goverde, Rescheduling models for railway traffic management in large-scale networks, Public Transport, vol.5, pp.95-123, 2013.

L. Lamorgese and C. Mannino, An exact decomposition approach for the real-time train dispatching problem, Operations Research, vol.63, pp.48-64, 2015.

L. Lamorgese, C. Mannino, D. Pacciarelli, and J. T. Krasemann, Train Dispatching. In Handbook of Optimization in the Railway Industry, pp.265-283, 2018.

L. Lamorgese, C. Mannino, and M. Piacentini, Optimal train dispatching by Benders'-like reformulation, Transportation Science, vol.50, pp.910-925, 2016.

C. Mannino and A. Mascis, Optimal real-time traffic control in metro stations, Operations Research, vol.57, pp.1026-1039, 2009.

A. Mascis and D. Pacciarelli, Job-shop scheduling with blocking and no-wait constraints, European Journal of Operational Research, vol.143, pp.498-517, 2002.

P. Pellegrini, G. Marlière, and J. Rodriguez, A detailed analysis of the actual impact of real-time railway traffic management optimization, Journal of Rail Transport Planning & Management, vol.6, pp.13-31, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01266964

. Sci-verkher, Rail transport markets -global market trends, pp.2016-2025, 2017.

B. V. Almende, vis.js -A dynamic, browser based visualization library, 2015.

S. F. Daniel and . Alves, A Swarm Robotics Approach To Decontamination, Mobile Ad Hoc Robots and Wireless Robotic Systems: Design and Implementation, pp.107-122, 2012.

C. Valmir, E. M. Barbosa, and . Gafni, Concurrency in Heavily Loaded Neighborhood-Constrained Systems, ACM Transactions on Programming Languages and Systems, vol.11, issue.4, pp.562-584, 1989.

D. Carvalho, F. Protti, M. Gregorio, and F. M. França, A Novel Distributed Scheduling Algorithm for Resource Sharing Under Near-Heavy Load, Lecture Notes in Computer Science, vol.3544, pp.431-442, 2004.

R. F. Cassia, C. Vladmir, F. G. Alves, F. M. Besnard, and . França, Synchronous-To-Asynchronous Conversion of Cryptographic Circuits, Journal of Circuits, Systems and Computers, vol.18, pp.271-282, 2009.

J. D. Fernandez and F. Vico, AI Methods in Algorithmic Composition: A Comprehensive Survey, Journal of Artificial Intelligence Research, vol.48, pp.513-582, 2013.

E. M. Gafni and D. P. Bertsekas, Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing Topology, IEEE Transactions on Communications, vol.29, pp.11-18, 1981.

R. Michael, D. S. Garey, and . Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, p.213, 1979.

C. F. Vanessa, P. M. Gonçalves, N. Lima, F. M. Maculan, and . França, A Distributed Dynamics for WebGraph Decontamination, Lecture Notes in Computer Science, vol.6415, pp.462-472, 2010.

D. Huber, The MIDI Manual, 2007.

M. Gladstone and . Arantes, Trilhas, Otimização de Concorrência e Inicialização Probabilística em Sistemas sob Reversão de Arestas, 2006.

M. S. Krishnamoorthy, An NP-hard problem in bipartite graphs, SIGACT News, vol.7, pp.26-26, 1975.

O. Lengerke, G. Hernã?n, M. S. Acuã?a, F. M. Dutra, F. A. Franã?a et al., Distributed control of job-shop systems via edge reversal dynamics for automated guided vehicles, International Conference on Intelligent Systems and Applications, vol.1, pp.25-30, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00938526

L. Luccio and . Fabrizio-annd-pagli, Web Marshals Fighting Curly Link Farms, Lecture Notes in Computer Science, vol.4475, pp.240-248, 2007.

A. Lucena, A. Cunha, and L. G. Simonetti, A New Formulation and Computational Results for the Simple Cycle Problem, Electronic Notes in Discrete Mathematics, vol.44, pp.83-88, 2013.

M. Moscarini, R. Petreschi, and J. L. Szwarcfiter, On node searching and starlike graphs, Congressus Numerantium, vol.131, pp.75-84, 1998.

G. Nierhaus, Algorithmic Composition: Paradigms of Automated Music Generation, 2009.

C. Schmidt-jones, Understanding Basic Music Theory. OpenStax CNX, 2007.

M. Shan and S. Chiu, Algorithmic compositions based on discovered musical patterns, Multimedia Tools and Applications, vol.46, pp.1-23, 2010.

J. Simpson, howler.js -JavaScript audio library for the modern Web, 2013.

K. I. Aardal, A. Hipolito, S. P. Van-hoesel, and B. Jansen, A branch-andcut algorithm for the frequency assignment problem, 1996.

K. I. Aardal, S. P. Van-hoesel, A. M. Koster, C. Mannino, and A. Sassano, Models and solution techniques for frequency assignment problems, Annals of Operations Research, vol.153, issue.1, pp.79-129, 2007.

A. Asadi, Q. Wang, and V. Mancuso, A Survey on Device-toDevice Communication in Cellular Networks, IEEE Communications Surveys and Tutorials, vol.16, pp.1801-1819, 2014.

M. Depolli, J. Konc, K. Rozman, R. Trobec, and D. Janezic, Exact parallel maximum clique algorithm for general and protein graphs, Journal of chemical information and modeling, vol.53, pp.2217-2228, 2013.

W. Edsger and . Dijkstra, A note on two problems in connexion with graphs, Numerische mathematik, vol.1, pp.269-271, 1959.

B. Jaumard, C. Meyer, and B. Thiongane, ILP Formulations for the Routing and Wavelength Assignment Problem: Symmetric Systems, pp.637-677, 2006.

E. Malaguti and P. Toth, A survey on vertex coloring problems, International transactions in operational research, vol.17, pp.1-34, 2010.

F. Margot, Symmetry in Integer Linear Programming, pp.647-686, 2010.

W. David, G. Matula, J. D. Marble, and . Isaacson, Graph coloring algorithms, pp.109-122, 1972.

G. L. Nemhauser and G. Sigismondi, A Strong Cutting Plane/Branchand-Bound Algorithm for Node Packing, Journal of the Operational Research Society, vol.43, pp.443-457, 1992.

A. E. Ozdaglar and D. P. Bertsekas, Routing and Wavelength Assignment in Optical Networks, IEEE/ACM Trans. Netw, vol.11, issue.2, pp.259-272, 2003.

Y. Jin and . Yen, An algorithm for finding shortest routes from all source nodes to a given destination in general networks, Quart. Appl. Math, vol.27, pp.526-530, 1970.

M. Zulhasnine, C. Huang, and A. Srinivasan, Efficient resource allocation for device-to-device communication underlaying LTE network, IEEE 6th International conference on wireless and mobile computing, networking and communications, pp.368-375, 2010.

N. Adhya, M. Tawarmalani, and N. V. Sahinidis, A Lagrangian Approach to the Pooling Problem, Industrial and Engineering Chemistry Research, vol.38, pp.1956-1972, 1999.

M. Alfaki and D. Haugland, Strong Formulations for the Pooling Problem, Journal of Global Optimization, vol.56, pp.897-916, 2013.

M. Alfaki and D. Haugland, A Cost Minimization Heuristic for the Pooling Problem, Annals of Operations Research, vol.222, pp.73-87, 2014.

H. Almutairi and S. Elhedhli, A New Lagrangian Approach to the Pooling Problem, Journal of Global Optimization, vol.45, pp.237-257, 2009.

C. Audet, J. Brimberg, P. Hansen, S. L. Digabel, and N. Mladenovi?, Pooling Problem: Alternate Formulations and Solution Methods, Management Science, vol.50, pp.761-776, 2004.

T. E. Baker and L. S. Lasdon, Successive Linear Programming at Exxon, Management Science, vol.31, pp.264-274, 1985.

R. Baltean-lugojan and R. Misener, Piecewise Parametric Structure in the Pooling Problem: From Sparse StronglyPolynomial Solutions to NP-hardness, Journal of Global Optimization, vol.71, pp.655-690, 2018.

A. Ben-tal, G. Eiger, and V. Gershovitz, Global Minimization by Reducing the Duality Gap, Mathematical programming, vol.63, pp.193-212, 1994.

N. Boland, T. Kalinowski, and F. Rigterink, A Polynomially Solvable Case of the Pooling Problem, Journal of Global Optimization, vol.67, pp.621-630, 2017.

C. W. Dewitt, L. S. Lasdon, D. A. Brenner, and S. A. Melhem, OMEGA: An Improved Gasoline Blending System for Texaco, Interfaces, vol.19, pp.85-101, 1989.

S. Dey and A. Gupte, Analysis of MILP Techniques for the Pooling Problem, Operations Research, vol.63, pp.412-427, 2015.

G. Erbeyoglu and U. Bilge, PSO-based and SA-Based Metaheuristics for Bilinear Programming Problems: an Application to the Pooling Problem, Journal of Heuristics, vol.22, pp.147-179, 2016.

C. A. Floudas and V. Visweswaran, A Global Optimization Algorithm (GOP) for CERTAIN Classes of, Nonconvex NLPs. 1. Theory. Computers and Chemical Engineering, vol.14, pp.1397-1417, 1990.

L. R. Foulds, D. Haugland, and K. Jörnsten, A Bilinear Approach to the Pooling Problem, Optimization, vol.24, pp.165-180, 1992.

B. Galan and I. E. Grossmann, Optimal Design of Distributed Wastewater Treatment Networks. Industrial and Engineering, Chemistry Research, vol.37, pp.4036-4048, 1998.

A. Gupte, S. Ahmed, S. Dey, and M. S. Cheon, Relaxations and Discretizations for the Pooling Problem, Journal of Global Optimization, vol.67, pp.631-669, 2017.

D. Haugland, The Computational Complexity of the Pooling Problem, Journal of Global Optimization, vol.64, pp.199-215, 2016.

D. Haugland and E. M. Hendrix, Pooling Problems with Polynomial-Time Algorithms, Journal of Optimization Theory and Applications, vol.170, pp.591-615, 2016.

C. A. Haverly, Studies of the Behaviour of Recursion for the Pooling Problem, ACM SIGMAP Bulletin, vol.25, pp.19-28, 1978.

J. Kallrath05, Solving Planning and Design Problems in the Process Industry Using Mixed Integer and Global Optimization, Annals of Operations Research, vol.140, pp.339-373, 2005.

M. Kimizuka, S. Kim, and M. Yamashita, Solving Pooling Problems by LP and SOCP Relaxations and Rescheduling Methods, 2018.

A. Marandi, J. Dahl, and E. De-klerk, A Numerical Evaluation of the Bounded Degree Sum-of-Squares Hierarchy of Lasserre, Toh, and Yang on the Pooling Problem, Annals of Operations Research, vol.265, pp.67-92, 2018.

R. Misener and C. A. Floudas, Advances for the Pooling Problem: Modeling, Global Optimization, and Computational Studies Survey, Applied and Computational Mathematics, vol.8, pp.3-22, 2009.

R. Misener and C. A. Floudas, Global Optimization of Large-Scale Generalized Pooling Problems: Quadratically Constrained MINLP Models, Industrial and Engineering Chemistry Research, vol.49, pp.5424-5438, 2010.

R. Misener, J. P. Thompson, and C. A. Floudas, APOGEE: Global Optimization of Standard, Generalized, and Extended Pooling Problems via Linear and Logarithmic Partitioning Schemes, Computers and Chemical Engineering, vol.35, pp.876-892, 2011.

N. V. Sahinidis and M. Tawarmalani, Accelerating Branch-and-Bound through a Modeling Language Construct for Relaxation-Specific Constraints, Journal of Global Optimization, vol.32, pp.259-280, 2005.

V. Visweswaran, Computational results for an efficient implementation of the GOP algorithm and its variants, Global Optimization in Engineering Design. Kluwer Series in Nonconvex Optimization and Its Applications, vol.9, pp.111-153, 1996.

M. O. Ball, Computational Complexity of Network Reliability Analysis: An Overview, IEEE Transactions on Reliability, vol.35, pp.230-239, 1986.

J. Barrera, H. Cancela, and E. Moreno, Topological optimization of reliable networks under dependent failures, Oper. Res. Lett, vol.43, pp.132-136, 2015.

N. Biggs, Algebraic Graph Theory, 1993.

F. T. Boesch, A. Satyanarayana, and C. L. Suffel, A survey of some network reliability analysis and synthesis results, Networks, vol.54, pp.99-107, 2009.

F. T. Boesch, X. Li, and C. Suffel, On the existence of uniformly optimally reliable networks, Networks, vol.21, pp.181-194, 1991.

E. Canale, P. Romero, G. Rubino, and X. Warnes, Network utility problem and easy reliability polynomials, 8th International Workshop on Resilient Networks Design and Modeling (RNDM, pp.79-84, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01423584

H. Cancela and M. E. Khadiri, The recursive variancereduction simulation algorithm for network reliability evaluation, IEEE Transactions on Reliability, vol.52, pp.207-212, 2003.

J. B. Conway, A Course in Functional Analysis, 1994.

A. Stephen and . Cook, The complexity of theorem-proving procedures, Proceedings of the third annual ACM symposium on Theory of computing (STOC '71), pp.151-158, 1971.

G. N. Fredrickson and J. F. Jaja, On the relationship between the biconnectivity augmentation and traveling salesman problem, Theoretical Computer Science, vol.19, pp.189-201, 1982.

F. Harary, The Maximum Connectivity of a Graph, Proceedings of the National Academy of Sciences of the United States of America, vol.48, pp.1142-1146, 1962.

. Clydel, B. Monma, W. Munson, and . Pulleyblank, Minimum-weight two-connected spanning networks, Mathematical Programming, vol.46, pp.153-171, 1990.

J. Scott, M. O. Provan, and . Ball, The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected, SIAM J. Comput, vol.12, issue.4, pp.777-788, 1983.

P. Romero, Duality in stochastic binary systems, 8th International Workshop on Resilient Networks Design and Modeling, pp.85-91, 2016.

A. Rosenthal, Computing the Reliability of Complex Networks, SIAM J. Appl. Math, vol.32, pp.384-393, 1977.

M. Stoer, Design of Survivable Networks, 1993.

M. S. Bonfim, K. L. Dias, and S. F. Fernandes, Integrated NFV/SDN Architectures: A Systematic Literature Review, Journal ACM Computing Surveys (CSUR), vol.51, 2019.

G. Carella, M. Pauls, A. Medhat, L. Grebe, and T. Magedanz, A Network Function Virtualization framework for Network Slicing of 5G Networks, Mobilkommunikation-Technologien und Anwendungen. ITG-Fachtagung, pp.1-7, 2017.

A. Destounis, G. Paschos, S. Paris, J. Leguay, L. Gkatzikis et al., Slice-based column generation for network slicing, Annual Joint Conference of the IEEE Computer and Communications Societies -INFOCOM, pp.1-2, 2018.

A. Dohn and A. Mason, Branch-and-price for staff rostering: An efficient implementation using generic programming and nested column generation, European Journal of Operational Research, vol.230, pp.157-169, 2013.

J. B. Gauthier, J. Desrosiers, and M. E. Lübbecke, Vector Space Decomposition for Solving Large-Scale Linear Programs, Operations Research, vol.66, pp.1376-1389, 2018.

F. Hennig, B. Nygreen, and M. E. Lübbecke, Nested Column Generation Applied to the Crude Oil Tanker Routing and Scheduling Problem with Split Pickup and Split Delivery, Naval Research Logistics, vol.59, pp.298-310, 2012.

N. Huin, B. Jaumard, and F. Giroire, Optimal Network Service Chain Provisioning, IEEE/ACM Transactions on Networking, vol.26, issue.3, pp.1320-1333, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01920951

S. Karabuk, A nested decomposition approach for solving the paratransit vehicle scheduling problem, Transportation Research Part B, vol.43, pp.448-465, 2009.

L. S. Lasdon, Optimization Theory for Large Systems, 1970.

X. Li, M. Samaka, H. A. Chan, D. Bhamare, L. Gupta et al., Network Slicing for 5G: Challenges and Opportunities, IEEE Internet Computing, vol.21, pp.20-27, 2017.

R. Lin, S. Luo, J. Zhou, S. Wang, B. Chen et al., Column generation algorithms for virtual network embedding in flexi-grid optical networks, Optics Express, vol.26, pp.10898-10913, 2018.

M. E. Lübbecke and J. Desrosiers, Selected Topics in Column Generation, Operations Research, vol.53, pp.1007-1023, 2005.

L. George, L. A. Nemhauser, and . Wolsey, Integer and Combinatorial Optimization, 1988.

J. Ordonez-lucena, P. Ameigeiras, D. Lopez, J. J. Ramos-muñoz, J. Lorca et al., Network Slicing for 5G with SDN/NFV: Concepts, Architectures and Challenges, IEEE Communications Magazine, vol.55, pp.80-87, 2017.

A. Pessoa, R. Sadykov, E. Uchoa, and F. Vanderbeck, Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation, INFORMS Journal on Computing, vol.30, pp.339-360, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01077984

. Sndlib, Germany50 Problem, 2005.

S. H. Song, A nested column generation algorithm to the meta slab allocation problem in the steel making industry, Journal International Journal of Production Research, vol.47, pp.3625-3638, 2009.

L. Tang, G. Zhao, C. Wang, P. Zhao, and Q. Chen, Queue-aware reliable embedding algorithm for 5G network slicing, Computer Networks, vol.146, pp.138-150, 2018.

F. Vanderbeck, A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem, Management Science, vol.47, pp.864-879, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00342635

B. Yi, X. Wang, K. Li, S. K. Das, and M. Huan, A comprehensive survey of Network Function Virtualization, Computer Networks, vol.133, pp.212-262, 2018.

G. Berbeglia, J. Cordeau, I. Gribkovskaia, and G. Laporte, Static pickup and delivery problems: a classification scheme and survey, Top, vol.15, pp.1-31, 2007.

D. Bertsimas, Probabilistic combinatorial optimization problems, 1988.

J. Chen and T. Wu, Vehicle routing problem with simultaneous deliveries and pickups, Journal of the Operational Research Society, vol.57, issue.5, pp.579-587, 2006.

J. Cordeau, A branch-and-cut algorithm for the dial-a-ride problem, Operations Research, vol.54, issue.3, pp.573-586, 2006.

J. Cordeau and G. Laporte, A tabu search heuristic for the static multi-vehicle dial-a-ride problem, Transportation Research Part B: Methodological, vol.37, pp.579-594, 2003.

M. Gendreau, G. Laporte, and D. Vigo, Heuristics for the traveling salesman problem with pickup and delivery, Computers & Operations Research, vol.26, pp.699-714, 1999.

I. Gribkovskaia, Ø. Halskau-sr, G. Laporte, and M. Vl?ek, General solutions to the single vehicle routing problem with pickups and deliveries, European Journal of Operational Research, vol.180, pp.568-584, 2007.

H. Hernández-pérez, Traveling salesman problems with pickups and deliveries. Disertation, 2004.

H. Hernández-pérez, I. Rodríguez-martín, and J. Salazar-gonzález, A hybrid GRASP/VND heuristic for the onecommodity pickup-and-delivery traveling salesman problem, Computers & Operations Research, vol.36, pp.1639-1645, 2009.

H. Hernández, -. Pérez, and J. Salazar-gonzález, A branchand-cut algorithm for a traveling salesman problem with pickup and delivery, Discrete Applied Mathematics, vol.145, pp.126-139, 2004.

H. Hernández, -. Pérez, and J. Salazar-gonzález, Heuristics for the one-commodity pickup-and-delivery traveling salesman problem, Transportation Science, vol.38, pp.245-255, 2004.

A. Hoff and A. Løkketangen, Creating lasso-solutions for the traveling salesman problem with pickup and delivery by tabu search, Central European Journal of Operations Research, vol.14, issue.2, pp.125-140, 2006.

N. Harilaos and . Psaraftis, A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem, Transportation Science, vol.14, pp.130-154, 1980.

P. Toth and D. Vigo, Fast local search algorithms for the handicapped persons transportation problem, Meta-Heuristics, pp.677-690, 1996.