Author:
Diarrassouba I.,Mahjoub A. R.,Almudahka I. M.
Publisher
Springer Science and Business Media LLC
Reference29 articles.
1. Arslan O, Jabali O, Laporte G (2020) A flexible, natural formulation for the network design problem with vulnerability constraints. INFORMS J Comput 32(1):1–198
2. Balakrishnana A, Vad Karsten C (2017) Container shipping service selection and cargo routing with transshipment limits. Eur J Oper Res 263:652–663
3. Bendali F, Diarrassouba I, Mahjoub AR, Mailfert J (2010) On the k-edge-disjoint 3-hop-constrained paths polytope. Discrete Optim 7(1):1–191
4. Botton Q, Fortz B, Gouveia L, Poss M (2013) Benders decomposition for the hop-constrained survivable network design problem. INFORMS J Comput 25(1):1–191
5. Chopra S (1994) The $$k$$-edge connected spanning subgraph polyhedron. SIAM J Discrete Math 7:245–259