Rolf H. Möhring
Rolf H. Möhring
Professor für Mathematik, Technische Universität Berlin
E-mail megerősítve itt: tu-berlin.de - Kezdőlap
Hivatkozott rá
Hivatkozott rá
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, 199-240, 1988
GOR Publications
R Kolisch, RE Burkard, B Fleischmann, K Inderfurth, RH Möhring
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: Models and techniques for …, 2009
Substitution decomposition for discrete structures and connections with combinatorial optimization
RH Möhring, FJ Radermacher
Annals of Discrete Mathematics 19, 257-356, 1984
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
Algorithmic aspects of comparability graphs and interval graphs
RH Möhring
Graphs and order: the role of graphs in the theory of ordered sets and its …, 1985
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
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
Shortest Paths: Ninth DIMACS Implementation Challenge, DIMACS Book. American …, 2008
An incremental linear-time algorithm for recognizing interval graphs
N Korte, RH Möhring
SIAM Journal on Computing 18 (1), 68-81, 1989
The pathwidth and treewidth of cographs
HL Bodlaender, RH Möhring
SIAM Journal on Discrete Mathematics 6 (2), 181-188, 1993
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
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
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
Stochastic scheduling problems I—General strategies
RH Möhring, FJ Radermacher, G Weiss
Zeitschrift für Operations Research 28, 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, 195-225, 1985
Scheduling with AND/OR precedence constraints
RH Möhring, M Skutella, F Stork
SIAM Journal on Computing 33 (2), 393-415, 2004
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–20