科言猫
学术研究的AI总结
首页
文献互助
订阅
我的收藏
科研工具
选题分析
论文总结
专利管理
未登录
返回
A
Antonio Sedeño‐Noda
universidad de la laguna
15
H指数
50
论文数
700
被引数
0
相关解读
订阅
收录论文
25
发表时间
发表时间
IF
被引数
A bi-objective sustainable EOQ model with all-units discounts
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
IF
7.2
2026-01-21
0
PRE
AI
Gutierrez, Jose M.; Sedeno-Noda, Antonio
分享
收藏
K-shortest simple paths using biobjective path search
使用双目标路径搜索的K-最短简单路径
MATHEMATICAL PROGRAMMING COMPUTATION
IF
3.6
2025-02-13
0
OA
AI
de las Casas, Pedro Maristany; Sedeno-Noda, Antonio; Borndoerfer, Ralf; Huneshagen, Max
分享
收藏
New Dynamic Programming algorithm for the Multiobjective Minimum Spanning Tree problem
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2025-01-01
0
PRE
AI
de las Casas, Pedro Maristany; Sedeno-Noda, Antonio; Borndoerfer, Ralf
分享
收藏
A bi-objective optimization model to decide the lines attending a bus-stop with high passenger demands
COMPUTERS & INDUSTRIAL ENGINEERING
IF
6.5
2023-12-01
0
OA
AI
Esquivel-Gonzalez, Guillermo; Leon, Gines; Sedeno-Noda, Antonio
分享
收藏
An Improved Multiobjective Shortest Path Algorithm
一种改进的多目标最短路径算法
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2021-11-01
21
PRE
AI
de las Casas, Pedro Maristany; Sedeno-Noda, Antonio; Borndoerfer, Ralf
分享
收藏
A biobjective Dijkstra algorithm
一种双目标Dijkstra算法
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2019-07-01
56
PRE
AI
Sedeno-noda, Antonio; Colebrook, Marcos
分享
收藏
Finding extreme supported solutions of biobjective network flow problems: An enhanced parametric programming approach
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2017-06-01
4
OA
AI
Raith, Andrea; Sedeno-Noda, Antonio
分享
收藏
An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem
一种改进的剪枝k-sp算法求解约束最短路径问题
APPLIED MATHEMATICS AND COMPUTATION
IF
3.4
2015-08-01
26
PRE
AI
Sedeno-Noda, Antonio; Alonso-Rodriguez, Sergio
分享
收藏
A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2015-05-01
46
OA
AI
Sedeno-Noda, Antonio; Raith, Andrea
分享
收藏
Fast and fine quickest path algorithm
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2014-10-01
14
PRE
AI
Sedeno-Noda, Antonio; Gonzalez-Barrera, Jonathan D.
分享
收藏
On the K best integer network flows
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2013-02-01
7
PRE
AI
Sedeno-Noda, Antonio; Jose Espino-Martin, Juan
分享
收藏
Enumerating K best paths in length order in DAGs
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2012-09-01
8
PRE
AI
Pascoal, Marta M. B.; Sedeno-Noda, Antonio
分享
收藏
An efficient time and space K point-to-point shortest simple paths algorithm
APPLIED MATHEMATICS AND COMPUTATION
IF
3.4
2012-06-01
13
PRE
AI
Sedeno-Noda, Antonio
分享
收藏
On the K shortest path trees problem
关于K个最短路径树问题
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2010-05-01
11
OA
AI
Sedeno-Noda, Antonio; Gonzalez-Martin, Carlos
分享
收藏
Optimality conditions in preference-based spanning tree problems
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2009-10-01
2
PRE
AI
Alonso, Sergio; Angel Dominguez-Rios, Miguel; Colebrook, Marcos; Sedeno-Noda, Antonio
分享
收藏
Preemptive benchmarking problem: An approach for official statistics in small areas
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2009-07-01
1
PRE
AI
Sedeno-Noda, A.; Gonzalez-Davila, E.; Gonzalez-Martin, C.; Gonzalez-Yanes, A.
分享
收藏
A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2009-07-01
16
PRE
AI
Sedeno-Noda, A.; Alcaide-Lopez-de-Pablo, David; Gonzalez-Martin, C.
分享
收藏
An efficient approach for solving the lot-sizing problem with time-varying storage capacities
一种解决随存储容量变化的批量问题的有效方法
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2008-09-01
14
PRE
AI
Gutierrez, J.; Sedeno-Noda, A.; Colebrook, M.; Sicilia, J.
分享
收藏
A polynomial algorithm for the production/ordering planning problem with limited storage
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2007-04-01
19
PRE
AI
Gutierrez, J.; Sedeno-Noda, A.; Colebrook, M.; Sicilia, J.
分享
收藏
Network flow approaches to pre-emptive open-shop scheduling problems with time-windows
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2006-11-01
15
PRE
AI
Sedeno-Noda, A.; Alcaide, D.; Gonzalez-Martin, C.
分享
收藏
研究方向
暂时未获取到该数据
合作学者
合作期刊
S
Sergio Alonso
H 指数: 32 · 论文数: 186
J
Joaquı́n Sicilia
H 指数: 30 · 论文数: 103
R
Ralf Borndörfer
H 指数: 25 · 论文数: 223
E
Enrique González‐Dávila
H 指数: 20 · 论文数: 109
A
Andrea Raith
H 指数: 17 · 论文数: 71
查看更多