| A new characterization for the dynamic lot size problem with bounded inventory J Gutiérrez, A Sedeño-Noda, M Colebrook, J Sicilia Computers & Operations Research 30 (3), 383-395, 2003 | 99 | 2003 |
| A biobjective Dijkstra algorithm A Sedeño-Noda, M Colebrook European Journal of Operational Research 276 (1), 106-118, 2019 | 81 | 2019 |
| An algorithm for the biobjective integer minimum cost flow problem A Sedeno-Noda, C González-Martın Computers & Operations Research 28 (2), 139-156, 2001 | 77 | 2001 |
| A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem A Sedeno-Noda, A Raith Computers & Operations Research 57, 83-94, 2015 | 73 | 2015 |
| The biobjective minimum cost flow problem A Sedeno-Noda, C González-Martın European Journal of Operational Research 124 (3), 591-600, 2000 | 42 | 2000 |
| Network flow approaches to pre-emptive open-shop scheduling problems with time-windows A Sedeño-Noda, D Alcaide, C González-Martín European Journal of Operational Research 174 (3), 1501-1518, 2006 | 36 | 2006 |
| An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem A Sedeño-Noda, S Alonso-Rodríguez Applied Mathematics and Computation 265 (15), 602-618, 2015 | 33 | 2015 |
| A polynomial algorithm for the production/ordering planning problem with limited storage J Gutiérrez, A Sedeño-Noda, M Colebrook, J Sicilia Computers & operations research 34 (4), 934-937, 2007 | 31 | 2007 |
| An O(nm) time algorithm for finding the min length directed cycle in a graph JB Orlin, A Sedeno-Noda Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 27 | 2017 |
| An efficient approach for solving the lot-sizing problem with time-varying storage capacities J Gutiérrez, A Sedeño-Noda, M Colebrook, J Sicilia European Journal of Operational Research 189 (3), 682-693, 2008 | 27 | 2008 |
| An improved multiobjective shortest path algorithm PM de las Casas, A Sedeno-Noda, R Borndörfer Computers & Operations Research 135, 105424, 2021 | 26 | 2021 |
| An efficient time and space K point-to-point shortest simple paths algorithm A Sedeño-Noda Applied Mathematics and Computation 218 (20), 10244-10257, 2012 | 24 | 2012 |
| An alternative method to solve the biobjective minimum cost flow problem A Sedeno-Noda, C González-Martín ASIA PACIFIC JOURNAL OF OPERATIONAL RESEARCH 20 (2), 241-260, 2003 | 22 | 2003 |
| Fast and fine quickest path algorithm A Sedeño-Noda, JD González-Barrera European Journal of Operational Research 238 (2), 596-606, 2014 | 21 | 2014 |
| A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows A Sedeño-Noda, DAL de Pablo, C González-Martín European Journal of Operational Research 196 (1), 140-154, 2009 | 21 | 2009 |
| An O(T log T) Algorithm for the Dynamic Lot Size Problem with Limited Storage and Linear Costs A Sedeño-Noda, J Gutiérrez, B Abdul-Jalbar, J Sicilia Computational Optimization and Applications 28, 311-323, 2004 | 18 | 2004 |
| The biobjective undirected two-commodity minimum cost flow problem A Sedeno-Noda, C González-Martın, J Gutiérrez European journal of operational research 164 (1), 89-103, 2005 | 16 | 2005 |
| On the K shortest path trees problem A Sedeño-Noda, C González-Martín European Journal of Operational Research 202 (3), 628-635, 2010 | 15 | 2010 |
| La Localización industrial en Canarias. Una aproximación Multicriterio T Ravelo, C González, MC Moreno, A Sedeño Noda Fundación FYDE-CajaCanarias, 2002 | 10* | 2002 |
| On the K best integer network flows A Sedeño-Noda, JJ Espino-Martín Computers & operations research 40 (2), 616-626, 2013 | 9 | 2013 |
Marcos ColebrookProfesor Titular de la Universidad de La LagunaDirección de correo verificada de ull.edu.es
