Follow
Antonio Alberto Sedeño Noda
Antonio Alberto Sedeño Noda
Catedrático de Estadística e Investigación Operativa en Universidad de La Laguna
Verified email at ull.edu.es
Title
Cited by
Cited by
Year
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
982003
A biobjective Dijkstra algorithm
A Sedeño-Noda, M Colebrook
European Journal of Operational Research 276 (1), 106-118, 2019
952019
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
782015
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
752001
The biobjective minimum cost flow problem
A Sedeno-Noda, C González-Martın
European Journal of Operational Research 124 (3), 591-600, 2000
422000
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
392006
An improved multiobjective shortest path algorithm
PM de las Casas, A Sedeno-Noda, R Borndörfer
Computers & Operations Research 135, 105424, 2021
362021
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
362015
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
312007
An O(nm) time algorithm for finding the min length directed cycle in a graph
JB Orlin, A Sedeño-Noda
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
292017
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
272008
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
242012
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
232009
Fast and fine quickest path algorithm
A Sedeño-Noda, JD González-Barrera
European Journal of Operational Research 238 (2), 596-606, 2014
222014
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
212003
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
182004
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
162005
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
152010
Targeted multiobjective Dijkstra algorithm
P Maristany de las Casas, L Kraus, A Sedeño‐Noda, R Borndörfer
Networks, 2023
14*2023
An FPTAS for dynamic multiobjective shortest path problems
P Maristany de las Casas, R Borndörfer, L Kraus, A Sedeño-Noda
Algorithms 14 (2), 43, 2021
112021
The system can't perform the operation now. Try again later.
Articles 1–20