Antonio Sedeño-Noda
Orcid: 0000-0003-0681-4585
According to our database1,
Antonio Sedeño-Noda
authored at least 36 papers
between 2000 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
New Dynamic Programming algorithm for the Multiobjective Minimum Spanning Tree problem.
Comput. Oper. Res., 2025
2023
A bi-objective optimization model to decide the lines attending a bus-stop with high passenger demands.
Comput. Ind. Eng., December, 2023
2021
2019
2017
Finding extreme supported solutions of biobjective network flow problems: An enhanced parametric programming approach.
Comput. Oper. Res., 2017
An <i>O</i>(<i>nm</i>) time algorithm for finding the min length directed cycle in a graph.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
2016
2015
A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem.
Comput. Oper. Res., 2015
An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem.
Appl. Math. Comput., 2015
2014
2013
Optim. Lett., 2013
2012
Comput. Optim. Appl., 2012
Appl. Math. Comput., 2012
2010
Comput. Optim. Appl., 2010
Asia Pac. J. Oper. Res., 2010
2009
A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows.
Eur. J. Oper. Res., 2009
Eur. J. Oper. Res., 2009
Eur. J. Oper. Res., 2009
New efficient shortest path simplex algorithm: pseudo permanent labels instead of permanent labels.
Comput. Optim. Appl., 2009
2008
An efficient approach for solving the lot-sizing problem with time-varying storage capacities.
Eur. J. Oper. Res., 2008
2007
A polynomial algorithm for the production/ordering planning problem with limited storage.
Comput. Oper. Res., 2007
2006
Network flow approaches to pre-emptive open-shop scheduling problems with time-windows.
Eur. J. Oper. Res., 2006
2005
Networks, 2005
Eur. J. Oper. Res., 2005
2004
An <i>O</i>(<i>T</i> log <i>T</i>) Algorithm for the Dynamic Lot Size Problem with Limited Storage and Linear Costs.
Comput. Optim. Appl., 2004
2003
Comput. Oper. Res., 2003
2001
Comput. Oper. Res., 2001
2000