Các bài viết có thể truy cập công khai - Rolf H. MöhringTìm hiểu thêm
Có tại một số nơi: 22
The modeling power of the periodic event scheduling problem: railway timetables—and beyond
C Liebchen, RH Möhring
Algorithmic Methods for Railway Optimization: International Dagstuhl …, 2007
Các cơ quan ủy nhiệm: German Research Foundation
Partitioning graphs to speedup Dijkstra's algorithm
RH Möhring, H Schilling, B Schütz, D Wagner, T Willhalm
Journal of Experimental Algorithmics (JEA) 11, 2.8-es, 2007
Các cơ quan ủy nhiệm: German Research Foundation
Characterizing the Existence of Potential Functions in Weighted Congestion Games
T Harks, M Klimm, RH Möhring
Theory of Computing Systems 49 (1), 46-70, 2011
Các cơ quan ủy nhiệm: German Research Foundation
A constraint integer programming approach for resource-constrained project scheduling
T Berthold, S Heinz, ME Lübbecke, RH Möhring, J Schulz
Integration of AI and OR Techniques in Constraint Programming for …, 2010
Các cơ quan ủy nhiệm: German Research Foundation
Ship traffic optimization for the Kiel Canal
E Lübbecke, ME Lübbecke, RH Möhring
Operations Research 67 (3), 791-812, 2019
Các cơ quan ủy nhiệm: German Research Foundation
Conflict-free vehicle routing: Load balancing and deadlock prevention
E Gawrilow, M Klimm, RH Möhring, B Stenzel
EURO journal on transportation and logistics 1 (1), 87-111, 2012
Các cơ quan ủy nhiệm: German Research Foundation
Solutions to real-world instances of PSPACE-complete stacking
FG König, M Lübbecke, R Möhring, G Schäfer, I Spenke
European Symposium on Algorithms, 729-740, 2007
Các cơ quan ủy nhiệm: German Research Foundation
Computing network tolls with support constraints
T Harks, I Kleinert, M Klimm, RH Möhring
Networks 65 (3), 262-285, 2015
Các cơ quan ủy nhiệm: German Research Foundation
Strong equilibria in games with the lexicographical improvement property
T Harks, M Klimm, RH Möhring
International Journal of Game Theory, 1-22, 2012
Các cơ quan ủy nhiệm: German Research Foundation
A constant FPT approximation algorithm for hard-capacitated k-means
Y Xu, RH Möhring, D Xu, Y Zhang, Y Zou
Optimization and Engineering 21, 709-722, 2020
Các cơ quan ủy nhiệm: National Natural Science Foundation of China
Sequencing and scheduling for filling lines in dairy production
T Gellert, W Höhn, RH Möhring
Optimization Letters 5, 491-504, 2011
Các cơ quan ủy nhiệm: German Research Foundation
Selfishness need not be bad
Z Wu, RH Möhring, Y Chen, D Xu
Operations Research 69 (2), 410-435, 2021
Các cơ quan ủy nhiệm: National Natural Science Foundation of China
The modeling power of the periodic event scheduling problem: railway timetables—and beyond
C Liebchen, RH Möhring
Computer-aided Systems in Public Transport, 117-150, 2008
Các cơ quan ủy nhiệm: German Research Foundation
Integrated sequencing and scheduling in coil coating
W Höhn, FG König, RH Möhring, ME Lübbecke
Management Science 57 (4), 647-666, 2011
Các cơ quan ủy nhiệm: German Research Foundation
A model and fast optimization method for signal coordination in a network
RH Möhring, K Nökel, G Wuünsch
IFAC Proceedings Volumes 39 (12), 73-78, 2006
Các cơ quan ủy nhiệm: German Research Foundation
A convergence analysis of the price of anarchy in atomic congestion games
Z Wu, RH Möhring, C Ren, D Xu
Mathematical Programming 199 (1), 937-993, 2023
Các cơ quan ủy nhiệm: US National Science Foundation, National Natural Science Foundation of China
Optimization of signalized traffic networks
E Köhler, RH Möhring, K Nökel, G Wünsch
Mathematics–Key Technology for the Future: Joint Projects Between …, 2008
Các cơ quan ủy nhiệm: German Research Foundation
A Sensitivity Analysis of the Price of Anarchy in Nonatomic Congestion Games
Z Wu, RH Möhring
Mathematics of Operations Research 48 (3), 1364-1392, 2023
Các cơ quan ủy nhiệm: National Natural Science Foundation of China
Quickest Flows: A practical model
E Köhler, RH Möhring, I Spenke
Các cơ quan ủy nhiệm: German Research Foundation
Stochastic project scheduling under limited resources: A branch and bound algorithm based on a new class of policies
RH Möhring, F Stork
Các cơ quan ủy nhiệm: German Research Foundation
Chương trình máy tính sẽ tự động xác định thông tin xuất bản và thông tin về nhà tài trợ