科言猫
学术研究的AI总结
首页
文献互助
订阅
我的收藏
科研工具
选题分析
论文总结
专利管理
未登录
返回
C
C. González-Martı́n
universidad de la laguna
6
H指数
23
论文数
165
被引数
0
相关解读
订阅
收录论文
8
发表时间
发表时间
IF
被引数
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
分享
收藏
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.
分享
收藏
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.
分享
收藏
The biobjective undirected two-commodity minimum cost flow problem
双目标无向双商品最小费用流问题
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2005-07-01
9
PRE
AI
Sedeño-Noda, A; González-Martín, C; Gutiérrez, J
分享
收藏
A generalization of the scaling max-flow algorithm
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2004-11-01
1
PRE
AI
Sedeño-Noda, A; González-Martín, C; Alonso, S
分享
收藏
An algorithm for the biobjective integer minimum cost flow problem
双目标整数最小费用流问题的一种算法
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2001-02-01
30
PRE
AI
Sedeño-Noda, A; González-Martín, C
分享
收藏
The biobjective minimum cost flow problem
双目标最小费用流问题
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2000-08-01
21
PRE
AI
Sedeño-Noda, A; González-Martín, C
分享
收藏
研究方向
暂时未获取到该数据
合作学者
合作期刊
S
Sergio Alonso
H 指数: 32 · 论文数: 186
E
Enrique González‐Dávila
H 指数: 20 · 论文数: 109
D
David Alcaide López de Pablo
H 指数: 16 · 论文数: 53
A
Antonio Sedeño‐Noda
H 指数: 15 · 论文数: 50
J
José M. Gutiérrez
H 指数: 14 · 论文数: 30
查看更多