arrow
返回
A

Antonio Sedeño‐Noda

universidad de la laguna

15H指数
50论文数
700被引数
收录论文 25
发表时间
K-shortest simple paths using biobjective path search使用双目标路径搜索的K-最短简单路径
err2025-02-13
err0
errOAAI
errde las Casas, Pedro Maristany; Sedeno-Noda, Antonio; Borndoerfer, Ralf; Huneshagen, Max
err分享
err收藏
New Dynamic Programming algorithm for the Multiobjective Minimum Spanning Tree problem
err2025-01-01
err0
PREAI
errde las Casas, Pedro Maristany; Sedeno-Noda, Antonio; Borndoerfer, Ralf
err分享
err收藏
err分享
err收藏
An Improved Multiobjective Shortest Path Algorithm一种改进的多目标最短路径算法
err2021-11-01
err21
PREAI
errde las Casas, Pedro Maristany; Sedeno-Noda, Antonio; Borndoerfer, Ralf
err分享
err收藏
err分享
err收藏
Fast and fine quickest path algorithm
err2014-10-01
err14
PREAI
errSedeno-Noda, Antonio; Gonzalez-Barrera, Jonathan D.
err分享
err收藏
On the K best integer network flows
err2013-02-01
err7
PREAI
errSedeno-Noda, Antonio; Jose Espino-Martin, Juan
err分享
err收藏
Enumerating K best paths in length order in DAGs
err2012-09-01
err8
PREAI
errPascoal, Marta M. B.; Sedeno-Noda, Antonio
err分享
err收藏
err分享
err收藏
Optimality conditions in preference-based spanning tree problems
err2009-10-01
err2
PREAI
errAlonso, Sergio; Angel Dominguez-Rios, Miguel; Colebrook, Marcos; Sedeno-Noda, Antonio
err分享
err收藏
Preemptive benchmarking problem: An approach for official statistics in small areas
err2009-07-01
err1
PREAI
errSedeno-Noda, A.; Gonzalez-Davila, E.; Gonzalez-Martin, C.; Gonzalez-Yanes, A.
err分享
err收藏
A polynomial algorithm for the production/ordering planning problem with limited storage
err2007-04-01
err19
PREAI
errGutierrez, J.; Sedeno-Noda, A.; Colebrook, M.; Sicilia, J.
err分享
err收藏