( en | de | ru )

 

Disambiguation of "Sedeño-Noda, Antonio"

Author of the publication

copydeleteadd this publication to your clipboard
Optimality conditions in preference-based spanning tree problems.

, , , and . Eur. J. Oper. Res., 198 (1): 232-240 (2009)

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 efficient label setting/correcting shortest path algorithm., and . Comput. Optim. Appl., 51 (1): 437-455 (2012)An algorithm for the biobjective integer minimum cost flow problem., and . Comput. Oper. Res., 28 (2): 139-156 (2001)A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem., and . Comput. Oper. Res., (2015)A new characterization for the dynamic lot size problem with bounded inventory., , , and . Comput. Oper. Res., 30 (3): 383-395 (2003)On the K shortest path trees problem., and . Eur. J. Oper. Res., 202 (3): 628-635 (2010)Fast and fine quickest path algorithm., and . Eur. J. Oper. Res., 238 (2): 596-606 (2014)An efficient approach for solving the lot-sizing problem with time-varying storage capacities., , , and . Eur. J. Oper. Res., 189 (3): 682-693 (2008)Network flow approaches to pre-emptive open-shop scheduling problems with time-windows., , and . Eur. J. Oper. Res., 174 (3): 1501-1518 (2006)Solving the undirected minimum cost flow problem with arbitrary costs., , and . Networks, 45 (1): 1-3 (2005)Preemptive benchmarking problem: An approach for official statistics in small areas., , , and . Eur. J. Oper. Res., 196 (1): 360-369 (2009)