Rolf H. Möhring
Rolf H. Möhring
Professor für Mathematik, Technische Universität Berlin
Verified email at - Homepage
Cited by
Cited by
Resource-constrained project scheduling: Notation, classification, models, and methods
P Brucker, A Drexl, RH Möhring, K Neumann, E Pesch
European Journal on Operational Research 12 (1), 3-41, 1999
Scheduling project networks with resource constraints and time windows
M Bartusch, RH Möhring, FJ Radermacher
Annals of operations Research 16 (1), 199-240, 1988
GOR■ Publications
R Kolisch, RE Burkard, B Fleischmann, K Inderfurth, RH Möhring
Substitution decomposition for discrete structures and connections with combinatorial optimization
RH Möhring, FJ Radermacher
Annals of Discrete Mathematics 19, 257-356, 1984
The concept of recoverable robustness, linear programming recovery, and railway applications
C Liebchen, M Lübbecke, R Möhring, S Stiller
Robust and online large-scale optimization, 1-27, 2009
Algorithmic aspects of comparability graphs and interval graphs
RH Möhring
Graphs and Order, 41-101, 1985
System-optimal routing of traffic flows with user constraints in networks with congestion
O Jahn, RH Möhring, AS Schulz, NE Stier-Moses
Operations research 53 (4), 600-616, 2005
Solving project scheduling problems by minimum cut computations
RH Möhring, AS Schulz, F Stork, M Uetz
Management science 49 (3), 330-350, 2003
Minimizing costs of resource requirements in project networks subject to a fixed completion time
RH Möhring
Operations Research 32 (1), 89-120, 1984
An incremental linear-time algorithm for recognizing interval graphs
N Korte, RH Möhring
SIAM Journal on Computing 18 (1), 68-81, 1989
Computationally tractable classes of ordered sets
RH Möhring
Algorithms and order, 105-193, 1989
Fast point-to-point shortest path computations with arc-flags
M Hilger, E Köhler, RH Möhring, H Schilling
The Shortest Path Problem: Ninth DIMACS Implementation Challenge 74, 41-72, 2009
The pathwidth and treewidth of cographs
HL Bodlaender, RH Möhring
SIAM Journal on Discrete Mathematics 6 (2), 181-188, 1993
Approximation in stochastic scheduling: the power of LP-based priority policies
RH Möhring, AS Schulz, M Uetz
Journal of the ACM (JACM) 46 (6), 924-942, 1999
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
The modeling power of the periodic event scheduling problem: railway timetables—and beyond
C Liebchen, RH Möhring
Algorithmic methods for railway optimization, 3-40, 2007
Stochastic scheduling problems I—General strategies
RH Möhring, FJ Radermacher, G Weiss
Zeitschrift für Operations Research 28 (7), 193-260, 1984
Graph problems related to gate matrix layout and PLA folding
RH Möhring
Computational graph theory, 17-51, 1990
Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and boolean functions
RH Möhring
Annals of Operations Research 4 (1), 195-225, 1985
Stochastic scheduling problems II-set strategies
RH Möhring, FJ Radermacher, G Weiss
Zeitschrift für Operations Research 29 (3), 65-104, 1985
The system can't perform the operation now. Try again later.
Articles 1–20