( en | de | ru )

 

Disambiguation of "Sedeño-Noda, Antonio"

Author of the publication

copydeleteadd this publication to your clipboard
A biobjective Dijkstra algorithm.

, and . Eur. J. Oper. Res., 276 (1): 106-118 (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Teruhisa Noda

Tatsuhiko Noda

Shigeru Noda

Norihiro Noda

Norihiro Noda

 

Other publications of authors with the same name

An algorithm for the biobjective integer minimum cost flow problem., and . Comput. Oper. Res., 28 (2): 139-156 (2001)An efficient label setting/correcting shortest path algorithm., and . Comput. Optim. Appl., 51 (1): 437-455 (2012)An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem., and . Appl. Math. Comput., (2015)The biobjective undirected two-commodity minimum cost flow problem., , and . Eur. J. Oper. Res., 164 (1): 89-103 (2005)New efficient shortest path simplex algorithm: pseudo permanent labels instead of permanent labels., and . Comput. Optim. Appl., 43 (3): 437-448 (2009)A bi-objective optimization model to decide the lines attending a bus-stop with high passenger demands., , and . Comput. Ind. Eng., (December 2023)An efficient approach for solving the lot-sizing problem with time-varying storage capacities., , , and . Eur. J. Oper. Res., 189 (3): 682-693 (2008)Fast and fine quickest path algorithm., and . Eur. J. Oper. Res., 238 (2): 596-606 (2014)Network flow approaches to pre-emptive open-shop scheduling problems with time-windows., , and . Eur. J. Oper. Res., 174 (3): 1501-1518 (2006)On the K shortest path trees problem., and . Eur. J. Oper. Res., 202 (3): 628-635 (2010)