The biobjective minimum cost flow problem. - Antonio Sedeño-Noda; Carlos González-Martín (Eur. J. Oper. Res., 2000)

An algorithm for the biobjective integer minimum cost flow problem. - Antonio Sedeño-Noda; Carlos González-Martín (Comput. Oper. Res., 2001)

A new characterization for the dynamic lot size problem with bounded inventory. - Jose Gutiérrez; Antonio Sedeño-Noda; Marcos Colebrook; Joaquin Sicilia (Comput. Oper. Res., 2003)

An O(T log T) Algorithm for the Dynamic Lot Size Problem with Limited Storage and Linear Costs. - Antonio Sedeño-Noda; Jose Gutiérrez; Beatriz Abdul-Jalbar; Joaquin Sicilia (Comput. Optim. Appl., 2004)

A generalization of the scaling max-flow algorithm. - Antonio Sedeño-Noda; Carlos González-Martín; Sergio Alonso-Rodríguez (Comput. Oper. Res., 2004)

The biobjective undirected two-commodity minimum cost flow problem. - Antonio Sedeño-Noda; Carlos González-Martín; Jose Gutiérrez (Eur. J. Oper. Res., 2005)

Solving the undirected minimum cost flow problem with arbitrary costs. - Antonio Sedeño-Noda; Carlos González-Martín; Sergio Alonso-Rodríguez (Networks, 2005)

Network flow approaches to pre-emptive open-shop scheduling problems with time-windows. - Antonio Sedeño-Noda; David Alcaide López de Pablo; Carlos González-Martín (Eur. J. Oper. Res., 2006)

A polynomial algorithm for the production/ordering planning problem with limited storage. - Jose Gutiérrez; Antonio Sedeño-Noda; Marcos Colebrook; Joaquin Sicilia (Comput. Oper. Res., 2007)

An efficient approach for solving the lot-sizing problem with time-varying storage capacities. - Jose Gutiérrez; Antonio Sedeño-Noda; Marcos Colebrook; Joaquin Sicilia (Eur. J. Oper. Res., 2008)

New efficient shortest path simplex algorithm: pseudo permanent labels instead of permanent labels. - Antonio Sedeño-Noda; Carlos González-Martín (Comput. Optim. Appl., 2009)

Optimality conditions in preference-based spanning tree problems. - Sergio Alonso-Rodríguez; Miguel Ángel Domínguez-Ríos; Marcos Colebrook; Antonio Sedeño-Noda (Eur. J. Oper. Res., 2009)

Preemptive benchmarking problem: An approach for official statistics in small areas. - Antonio Sedeño-Noda; Enrique González-Dávila; Carlos González-Martín; Alberto González-Yanes (Eur. J. Oper. Res., 2009)

A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows. - Antonio Sedeño-Noda; David Alcaide López de Pablo; Carlos González-Martín (Eur. J. Oper. Res., 2009)

Shortest Path Simplex Algorithm with a Multiple Pivot Rule: a Comparative Study. - Antonio Sedeño-Noda; Carlos González-Martín (Asia Pac. J. Oper. Res., 2010)

A new strategy for the undirected two-commodity maximum flow problem. - Antonio Sedeño-Noda; Carlos González-Martín; Sergio Alonso-Rodríguez (Comput. Optim. Appl., 2010)

On the K shortest path trees problem. - Antonio Sedeño-Noda; Carlos González-Martín (Eur. J. Oper. Res., 2010)

An efficient time and space K point-to-point shortest simple paths algorithm. - Antonio Sedeño-Noda (Appl. Math. Comput., 2012)

An efficient label setting/correcting shortest path algorithm. - Antonio Sedeño-Noda; Carlos González-Martín (Comput. Optim. Appl., 2012)

Enumerating K best paths in length order in DAGs. - Marta M. B. Pascoal; Antonio Sedeño-Noda (Eur. J. Oper. Res., 2012)

On the K best integer network flows. - Antonio Sedeño-Noda; Juan José Espino-Martín (Comput. Oper. Res., 2013)

On the second point-to-point undirected shortest simple path problem. - Antonio Sedeño-Noda; Carlos González-Martín (Optim. Lett., 2013)

Fast and fine quickest path algorithm. - Antonio Sedeño-Noda; Jonathan D. González-Barrera (Eur. J. Oper. Res., 2014)

An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem. - Antonio Sedeño-Noda; Sergio Alonso-Rodríguez (Appl. Math. Comput., 2015)

A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem. - Antonio Sedeño-Noda; Andrea Raith (Comput. Oper. Res., 2015)

Ranking One Million Simple Paths in Road Networks. - Antonio Sedeño-Noda (Asia Pac. J. Oper. Res., 2016)

An O(nm) time algorithm for finding the min length directed cycle in a graph. - James B. Orlin; Antonio Sedeño-Noda (SODA, 2017)

Finding extreme supported solutions of biobjective network flow problems: An enhanced parametric programming approach. - Andrea Raith; Antonio Sedeño-Noda (Comput. Oper. Res., 2017)

A biobjective Dijkstra algorithm. - Antonio Sedeño-Noda; Marcos Colebrook (Eur. J. Oper. Res., 2019)

An FPTAS for Dynamic Multiobjective Shortest Path Problems. - Pedro Maristany de las Casas; Ralf Borndörfer; Luitgard Kraus; Antonio Sedeño-Noda (Algorithms, 2021)

An Improved Multiobjective Shortest Path Algorithm. - Pedro Maristany de las Casas; Antonio Sedeño-Noda; Ralf Borndörfer (Comput. Oper. Res., 2021)

Multiobjective Dijkstra A. - Pedro Maristany de las Casas; Luitgard Kraus; Antonio Sedeño-Noda; Ralf Borndörfer (CoRR, 2021)

Targeted multiobjective Dijkstra algorithm. - Pedro Maristany de las Casas; Luitgard Kraus; Antonio Sedeño-Noda; Ralf Borndörfer (Networks, 2023)

A bi-objective optimization model to decide the lines attending a bus-stop with high passenger demands. - Guillermo Esquivel-González; Ginés León; Antonio Sedeño-Noda (Comput. Ind. Eng., 2023)

New Dynamic Programming algorithm for the Multiobjective Minimum Spanning Tree problem. - Pedro Maristany de las Casas; Antonio Sedeño-Noda; Ralf Borndörfer (Comput. Oper. Res., 2025)

K-shortest simple paths using biobjective path search. - Pedro Maristany de las Casas; Antonio Sedeño-Noda; Ralf Borndörfer; Max Huneshagen (Math. Program. Comput., 2025)