科言猫
学术研究的AI总结
首页
文献互助
订阅
我的收藏
科研工具
选题分析
论文总结
专利管理
未登录
返回
G
Günther R. Raidl
Technische Universitat Wien
40
H指数
319
论文数
7.1K
被引数
0
相关解读
订阅
收录论文
26
发表时间
发表时间
IF
被引数
Complexity of Positive Influence Domination on Partial Grids
在部分网格上的正影响支配复杂性
FUNDAMENTALS OF COMPUTATION THEORY, FCT 2025
IF
0
2026-01-01
0
PRE
AI
Iurlano, Enrico; Raidl, Guether R.
分享
收藏
Scheduling jobs using queries to interactively learn human availability times
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2024-07-01
1
OA
AI
Varga, Johannes; Raidl, Guenther R.; Roennberg, Elina; Rodemann, Tobias
分享
收藏
Signed double Roman domination on cubic graphs
APPLIED MATHEMATICS AND COMPUTATION
IF
3.4
2024-06-01
0
OA
AI
Iurlano, Enrico; Zec, Tatjana; Djukanovic, Marko; Raidl, Guenther R.
分享
收藏
A Multilevel Optimization Approach for Large Scale Battery Exchange Station Location Planning
大规模电池交换站选址规划的多级优化方法
evolutionary computation in combinatorial optimization evocop
IF
0
2023-03-31
0
PRE
AI
Jatschka, Thomas; Rodemann, Tobias; Raidl, Guenther R.
分享
收藏
Graph search and variable neighborhood search for finding constrained longest common subsequences in artificial and real gene sequences
APPLIED SOFT COMPUTING
IF
6.6
2022-06-01
2
OA
AI
Djukanovic, Marko; Kartelj, Aleksandar; Matic, Dragan; Grbic, Milana; Blum, Christian; Raidl, Guenther R.
分享
收藏
Computational Methods for Scheduling the Charging and Assignment of an On-Site Shared Electric Vehicle Fleet
IEEE ACCESS
IF
3.6
2022-01-01
4
OA
AI
Varga, Johannes; Raidl, Guenther R.; Limmer, Steffen
分享
收藏
A*-based construction of decision diagrams for a prize-collecting scheduling problem
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2021-02-01
7
OA
AI
Horn, Matthias; Maschler, Johannes; Raidl, Guenther R.; Ronnberg, Elina
分享
收藏
Finding Longest Common Subsequences: New anytime A* search results
APPLIED SOFT COMPUTING
IF
6.6
2020-10-01
10
PRE
AI
Djukanovic, Marko; Raidl, Guenther R.; Blum, Christian
分享
收藏
A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources
ANNALS OF OPERATIONS RESEARCH
IF
4.5
2020-03-03
6
PRE
AI
Horn, Matthias; Raidl, Guenther R.; Ronnberg, Elina
分享
收藏
Anytime algorithms for the longest common palindromic subsequence problem
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2020-02-01
4
PRE
AI
Djukanovic, Marko; Raidl, Guenther R.; Blum, Christian
分享
收藏
Job sequencing with one common and multiple secondary resources: An A*/Beam Search based anytime algorithm
artificial intelligence review
IF
4.6
2019-12-01
2
OA
AI
Horn, Matthias; Raidl, Guenther; Blum, Christian
分享
收藏
Multivalued decision diagrams for prize-collecting job sequencing with one common and multiple secondary resources
ANNALS OF OPERATIONS RESEARCH
IF
4.5
2019-11-21
1
OA
AI
Maschler, Johannes; Raidl, Guenther R.
分享
收藏
Solving a selective dial-a-ride problem with logic-based Benders decomposition
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2018-08-01
28
PRE
AI
Riedler, Martin; Raidl, Guenther
分享
收藏
Particle therapy patient scheduling with limited starting time variations of daily treatments
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH
IF
2.9
2018-07-30
6
OA
AI
Maschler, Johannes; Raidl, Guenther R.
分享
收藏
A Genetic Algorithm in Combination with a Solution Archive for Solving the Generalized Vehicle Routing Problem with Stochastic Demands
TRANSPORTATION SCIENCE
IF
4.8
2018-06-01
22
PRE
AI
Biesinger, Benjamin; Bin Hu; Raidl, Guenther R.
分享
收藏
An iterative time-bucket refinement algorithm for a high-resolution resource-constrained project scheduling problem
高分辨率资源受限项目调度问题的迭代时间桶细化算法
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH
IF
2.9
2017-08-21
15
OA
AI
Riedler, Martin; Jatschka, Thomas; Maschler, Johannes; Raidl, Gunther R.
分享
收藏
Large neighborhood search for the most strings with few bad columns problem
大邻域搜索最多的字符串很少坏列问题
SOFT COMPUTING
IF
2.5
2016-10-06
2
PRE
AI
Lizarraga, Evelia; Blesa, Maria J.; Blum, Christian; Raidl, Gunther R.
分享
收藏
Decomposition based hybrid metaheuristics
基于分解的混合元启发式算法
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2015-07-01
44
PRE
AI
Raidl, Guenther R.
分享
收藏
Solving the post enrolment course timetabling problem by ant colony optimization
用蚁群算法求解招生后课程排课问题
ANNALS OF OPERATIONS RESEARCH
IF
4.5
2012-02-09
48
PRE
AI
Nothegger, Clemens; Mayer, Alfred; Chwatal, Andreas; Raidl, Guenther R.
分享
收藏
Hybrid metaheuristics in combinatorial optimization: A survey
APPLIED SOFT COMPUTING
IF
6.6
2011-09-01
573
OA
AI
Blum, Christian; Puchinger, Jakob; Raidl, Guenther R.; Roli, Andrea
分享
收藏
研究方向
暂无研究方向
合作学者
合作期刊
J
Jan‐Michael Peters
H 指数: 95 · 论文数: 210
K
Karl Mechtler
H 指数: 91 · 论文数: 392
F
Frank Eisenhaber
H 指数: 65 · 论文数: 306
A
Alfred M. Mayer
H 指数: 46 · 论文数: 390
O
Ortrun Mittelsten Scheid
H 指数: 45 · 论文数: 122
查看更多