Rolf H. Möhring
Orcid: 0000-0003-3766-8728Affiliations:
- Technical University of Berlin, Department of Mathematics, Germany
According to our database1,
Rolf H. Möhring
authored at least 91 papers
between 1983 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
On csauthors.net:
Bibliography
2024
Preface - Special Issue: Research in Combinatorial Optimization and Applications of COCOA 2021.
Int. J. Found. Comput. Sci., September, 2024
Approximation Algorithms for Robust Clustering Problems Using Local Search Techniques.
Proceedings of the Theory and Applications of Models of Computation, 2024
2023
Math. Oper. Res., August, 2023
Math. Program., May, 2023
2022
Introduction to the special section on parallel and distributed computing, algorithms, programming, applications and technologies (VSI-pdcat4).
Comput. Electr. Eng., 2022
2021
2020
Outliers Detection Is Not So Hard: Approximation Algorithms for Robust Clustering Problems Using Local Search Techniques.
CoRR, 2020
CoRR, 2020
2019
2018
Stochastic runtime analysis of a Cross-Entropy algorithm for traveling salesman problems.
Theor. Comput. Sci., 2018
2017
IEEE Trans. Evol. Comput., 2017
2016
Integrating Sequencing and Scheduling: A Generic Approach with Two Exemplary Industrial Applications.
Proceedings of the Algorithm Engineering - Selected Results and Surveys, 2016
2015
2013
Int. J. Game Theory, 2013
2012
2011
Theory Comput. Syst., 2011
INFORMS J. Comput., 2011
Proceedings of the Algorithms Unplugged, 2011
2010
Proceedings of the Scheduling, 14.02. - 19.02.2010, 2010
Proceedings of the Scheduling, 14.02. - 19.02.2010, 2010
A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2010
2009
The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications.
Proceedings of the Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems, 2009
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009
Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009
Proceedings of the Models and Algorithms for Optimization in Logistics, 21.06., 2009
Proceedings of the Models and Algorithms for Optimization in Logistics, 21.06., 2009
Proceedings of the Models and Algorithms for Optimization in Logistics, 21.06., 2009
2008
Proceedings of the Taschenbuch der Algorithmen, 2008
Proceedings of the Scheduling, 10.02. - 15.02.2008, 2008
Proceedings of the Scheduling, 10.02. - 15.02.2008, 2008
Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments, 2008
2007
Proceedings of the Algorithms, 2007
2006
Proceedings of the Shortest Path Problem, 2006
2005
System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion.
Oper. Res., 2005
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005
Proceedings of the Algorithms for Optimization with Incomplete Information, 2005
05031 Abstracts Collection - Algorithms for Optimization with Incomplete Information.
Proceedings of the Algorithms for Optimization with Incomplete Information, 2005
ATMOS 2005 Abstracts Collection - Selected Papers from the 5th Workshop on Algorithmic Methods and Models for Optimization of Railways.
Proceedings of the 5th Workshop on Algorithmic Methods and Models for Optimization of Railways, 2005
Proceedings of the 5th Workshop on Algorithmic Methods and Models for Optimization of Railways, 2005
2004
Proceedings of the Operations Research, 2004
The Modeling Power of the Periodic Event Scheduling Problem: Railway Timetables - and Beyond.
Proceedings of the Algorithmic Methods for Railway Optimization, 2004
2003
Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003
2002
Proceedings of the Algorithmic Methods and Models for Optimization of Railways, 2002
2001
A Computational Study on Bounding the Makespan Distribution in Stochastic Project Networks.
Ann. Oper. Res., 2001
Proceedings of the Computational Discrete Mathematics, Advanced Lectures, 2001
2000
Math. Methods Oper. Res., 2000
Algorithmica, 2000
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2000
1999
Parallel Comput., 1999
J. ACM, 1999
Resource-constrained project scheduling: Notation, classification, models, and methods.
Eur. J. Oper. Res., 1999
Stochastic Machine Scheduling: Performance Guarantees for LP-based Priority Policies.
Proceedings of the Randomization, 1999
Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems.
Proceedings of the Algorithms, 1999
Verteilte Verbindungssuche im öffentlichen Personenverkehr Graphentheoretische Modelle und Algorithmen.
Proceedings of the Angewandte Mathematik, 1999
1997
Mesh refinement via bidirected flows: modeling, complexity, and computational results.
J. ACM, 1997
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997
1996
Scheduling Jobs with Communication Delays: Using Infeasible Solutions for Approximation (Extended Abstract).
Proceedings of the Algorithms, 1996
1995
Advanced DSS for scheduling: software engineering aspects and the role of Eigenmodels.
Ann. Oper. Res., 1995
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995
1994
SIAM J. Discret. Math., 1994
1993
1991
1989
SIAM J. Comput., 1989
Design aspects of an advanced model-oriented DSS for scheduling problems in civil engineering.
Decis. Support Syst., 1989
1988
1987
On some complexity properties of N-free posets and posets with bounded decomposition diameter.
Discret. Math., 1987
1986
Proceedings of the Graphtheoretic Concepts in Computer Science, International Workshop, 1986
1985
1984
Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time.
Oper. Res., 1984
1983