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)

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)

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)

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)

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)