Articles dans des revues avec comité de lecture (4)
  1. 1. Catanzaro, D., Labbé, M., & Salazar-Neumann, M. (2011). Reduction approaches for robust shortest path problems. Computers & operations research, 38(11), 1610-1619.
  2. 2. Salazar-Neumann, M. (2007). The robust minimum spanning tree problem: Compact and convex uncertainty. Operations research letters, 35(1), 17-22.
  3. 3. Hites, R., De Smet, Y., Risse, N., Salazar-Neumann, M., & Vincke, P. (2006). About the applicability of MCDA to some robustness problems. European Journal of Operational Research, 174(1), 322-332.
  4. 4. Salazar-Neumann, M. (2006). The robust minimum spanning tree problem: compact and convex uncertainty. Operations research letters, 35, 17-22.
    5.   Thèses et mémoires (1)
  5. 1. Salazar-Neumann, M. (2010). Advances in robust combinatorial optimization and linear programming (Thèse doctorale non-publiée). Université libre de Bruxelles, Faculté des Sciences – Mathématiques, Bruxelles.