科言猫
学术研究的AI总结
首页
文献互助
订阅
我的收藏
科研工具
选题分析
论文总结
专利管理
未登录
返回
P
Pablo San Segundo
universidad politécnica de madrid
17
H指数
64
论文数
998
被引数
0
相关解读
订阅
收录论文
24
发表时间
发表时间
IF
被引数
An exact approach for the Train Single-Routing Selection Problem
针对列车单路径选择问题的精确求解方法
European Journal of Operational Research
IF
6
2026-08-29
0
PRE
AI
Anna Livia Croella; Fabio Furini; Ivana Ljubić; Bianca Pascariu; Paola Pellegrini; Pablo San Segundo
分享
收藏
CliSAT: A new exact algorithm for hard maximum clique problems
CliSAT: 硬最大团问题的一种新的精确算法
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2023-06-01
1
OA
AI
San Segundo, Pablo; Furini, Fabio; Alvarez, David; Pardalos, Panos M.
分享
收藏
A new branch-and-filter exact algorithm for binary constraint satisfaction problems
求解二元约束满足问题的一种新的分支和过滤精确算法
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2022-06-01
3
OA
AI
San Segundo, Pablo; Furini, Fabio; Leon, Rafael
分享
收藏
A branch-and-cut algorithm for the Edge Interdiction Clique Problem
边缘遮断团问题的分支割算法
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2021-10-01
14
OA
AI
Furini, Fabio; Ljubic, Ivana; San Segundo, Pablo; Zhao, Yanlu
分享
收藏
Research trends in combinatorial optimization
组合优化的研究趋势
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH
IF
2.9
2021-05-27
19
OA
AI
Weinand, Jann Michael; Sorensen, Kenneth; San Segundo, Pablo; Kleinebrahm, Max; McKenna, Russell
分享
收藏
A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts
带冲突背包问题的一种新的组合分支定界算法
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2021-03-01
44
OA
AI
Coniglio, Stefano; Furini, Fabio; San Segundo, Pablo
分享
收藏
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
最大边加权团问题的一种新的分支定界算法
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2019-10-01
18
OA
AI
San Segundo, Pablo; Coniglio, Stefano; Furini, Fabio; Ljubic, Ivana
分享
收藏
A new branch-and-bound algorithm for the Maximum Weighted Clique Problem
最大加权团问题的一种新的分支定界算法
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2019-10-01
11
OA
AI
San Segundo, Pablo; Furini, Fabio; Artieda, Jorge
分享
收藏
The maximum clique interdiction problem
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2019-08-01
28
OA
AI
Furini, Fabio; Ljubic, Ivana; Martin, Sebastien; San Segundo, Pablo
分享
收藏
Efficiently enumerating all maximal cliques with bit-parallelism
有效地枚举具有位并行性的所有最大集团
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2018-04-01
20
OA
AI
San Segundo, Pablo; Artieda, Jorge; Strash, Darren
分享
收藏
Improved initial vertex ordering for exact maximum clique search (vol 45, pg 868, 2016)
APPLIED INTELLIGENCE
IF
3.5
2016-11-18
0
OA
AI
San Segundo, Pablo; Lopez, Alvaro; Batsyn, Mikhail; Nikolaev, Alexey; Pardalos, Panos M.
分享
收藏
Improved initial vertex ordering for exact maximum clique search
APPLIED INTELLIGENCE
IF
3.5
2016-05-24
17
PRE
AI
San Segundo, Pablo; Lopez, Alvaro; Batsyn, Mikhail; Nikolaev, Alexey; Pardalos, Panos M.
分享
收藏
A new exact maximum clique algorithm for large and massive sparse graphs
一种新的大规模稀疏图的精确最大团算法
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2016-02-01
40
PRE
AI
San Segundo, Pablo; Lopez, Alvaro; Pardalos, Panos M.
分享
收藏
Improved Infra-Chromatic Bound for Exact Maximum Clique Search
Informatica
IF
2.8
2016-01-01
10
PRE
AI
San Segundo, Pablo; Nikolaev, Alexey; Batsyn, Mikhail; Pardalos, Panos M.
分享
收藏
Infra-chromatic bound for exact maximum clique search
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2015-12-01
34
PRE
AI
San Segundo, Pablo; Nikolaev, Alexey; Batsyn, Mikhail
分享
收藏
A novel clique formulation for the visual feature matching problem
APPLIED INTELLIGENCE
IF
3.5
2015-02-28
20
PRE
AI
San Segundo, Pablo; Artieda, Jorge
分享
收藏
Relaxed approximate coloring in exact maximum clique search
精确最大集团搜索中的宽松近似着色
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2014-04-01
33
PRE
AI
San Segundo, Pablo; Tapia, Cristobal
分享
收藏
Robust Global Feature Based Data Association With a Sparse Bit Optimized Maximum Clique Algorithm
IEEE TRANSACTIONS ON ROBOTICS
IF
10.5
2013-10-01
20
PRE
AI
San Segundo, Pablo; Rodriguez-Losada, Diego
分享
收藏
GPU-Mapping Robotic Map Building with Graphical Multiprocessors
IEEE ROBOTICS & AUTOMATION MAGAZINE
IF
7.1
2013-06-01
10
PRE
AI
Rodriguez-Losada, Diego; San Segundo, Pablo; Hernando, Miguel; de la Puente, Paloma; Valero-Gomez, Alberto
分享
收藏
A new DSATUR-based algorithm for exact vertex coloring
一种新的基于DSATUR的精确顶点着色算法
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2012-07-01
41
OA
AI
San Segundo, Pablo
分享
收藏
研究方向
暂时未获取到该数据
合作学者
合作期刊
P
Pãnos M. Pardalos
H 指数: 78 · 论文数: 840
P
Pãnos M. Pardalos
H 指数: 70 · 论文数: 796
K
Kenneth Sörensen
H 指数: 45 · 论文数: 298
R
Russell McKenna
H 指数: 41 · 论文数: 285
I
Ivana Ljubić
H 指数: 33 · 论文数: 165
查看更多