| 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 | 6325 | 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 | 603 | 1988 |
| 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 | 490 | 2009 |
| Substitution decomposition for discrete structures and connections with combinatorial optimization RH Möhring, FJ Radermacher Annals of Discrete Mathematics 19, 257-356, 1984 | 384 | 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 | 356 | 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 | 313 | 1985 |
| Minimizing costs of resource requirements in project networks subject to a fixed completion time RH Möhring Operations Research 32 (1), 89-120, 1984 | 306 | 1984 |
| Solving project scheduling problems by minimum cut computations RH Möhring, AS Schulz, F Stork, M Uetz Management science 49 (3), 330-350, 2003 | 292 | 2003 |
| 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 | 285 | 2008 |
| Computationally tractable classes of ordered sets RH Möhring Algorithms and order, 105-193, 1989 | 285 | 1989 |
| 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 | 268 | 2007 |
| An incremental linear-time algorithm for recognizing interval graphs N Korte, RH Möhring SIAM Journal on Computing 18 (1), 68-81, 1989 | 262 | 1989 |
| The pathwidth and treewidth of cographs HL Bodlaender, RH Möhring SIAM Journal on Discrete Mathematics 6 (2), 181-188, 1993 | 251 | 1993 |
| 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 | 249 | 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 | 229 | 1999 |
| Stochastic scheduling problems I—General strategies RH Möhring, FJ Radermacher, G Weiss Zeitschrift für Operations Research 28 (7), 193-260, 1984 | 217 | 1984 |
| Graph problems related to gate matrix layout and PLA folding RH Möhring Computational graph theory, 17-51, 1990 | 202 | 1990 |
| Scheduling with AND/OR precedence constraints RH Möhring, M Skutella, F Stork SIAM Journal on Computing 33 (2), 393-415, 2004 | 166* | 2004 |
| 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 | 163 | 1985 |
| Stochastic scheduling problems II-set strategies RH Möhring, FJ Radermacher, G Weiss Zeitschrift für Operations Research 29 (3), 65-104, 1985 | 150 | 1985 |
Andreas S. SchulzTechnische Universität MünchenVerified email at tum.de
