AG Optimierung

Publikationen

2018

  • I. Heinrich, P. Tittmann,
    Neighborhood and Domination Polynomials of Graphs
    Graphs and Combinatorics (2018)

  • D. Baatar, M. Ehrgott, H. W. Hamacher, I. M. Raschendorfer,
    Minimizing the number of apertures in multileaf collimator sequencing with field splitting
    Discrete Applied Mathematics (2018)

  • S. Krumke, C. Thielen, P. Weinschenk, S. Westphal,
    Full Implementation of Social Choice Functions in Dominant Strategies
    International Journal of Game Theory, pp. 1-26 (2018)

  • C. Thielen,
    Duty Rostering for Physicians at a Department of Orthopedics and Trauma Surgery
    Operations Research for Health Care 19, pp. 80-91 (2018)

  • N. Halman, M. Holzhauser, S. O. Krumke,
    An FPTAS for the knapsack problem with parametric weights
    Operations Research Letters 46, pp. 487-491 (2018)

  • A. Herzel, M. Hopf, C. Thielen,
    Multistage Interval Scheduling Games
    Journal of Scheduling (online first), pp. 1-19 (2018)

  • M. Holzhauser, S. O. Krumke,
    A Generalized Approximation Framework for Fractional Network Flow and Packing Problems
    Mathematical Methods of Operations Research 87, pp. 19-50 (2018)

  • S. O. Krumke, E. Schmidt, M. Streicher,
    Robust Multicovers with Budgeted Uncertainty
    European Journal of Operations Research (2018)

  • A. Chassein, M. Goerigk, A. Kasperski, P. Zieliński,
    On recoverable and two-stage robust selection problems with budgeted uncertainty
    European Journal of Operational Research 265, pp. 423-436 (2018)

  • A. Chassein, M. Goerigk,
    On scenario aggregation to approximate robust combinatorial optimization problems
    Optimization Letters 12, pp. 1523-1533 (2018)

  • A. Chassein, M. Goerigk,
    Variable-sized uncertainty and inverse problems in robust optimization
    European Journal of Operational Research 264, pp. 17-28 (2018)

  • M. Gentner, I. Heinrich, S. Jäger, D. Rautenbach,
    Large values of the clustering coefficient
    Discrete Mathematics 341, pp. 119-125 (2018)

  • M. Goerigk, H. W. Hamacher, A. Kinscherff,
    Ranking robustness and its application to evacuation planning
    European Journal of Operational Research 264, pp. 837-846 (2018)
  • M. Goerigk, H. W. Hamacher, S. Schmitt,
    Decision Support Systems for Urban Evacuation Logistics in Practice
    The Palgrave Handbook of Humanitarian Logistics and Supply Chain Management, Springer, pp. 523-546 (2018)

  • S. Ruzika, V. Klöckner, S. Gecks,
    Wie man einen Testsieger kürt
    Digitale Werkzeuge, Simulationen und mathematisches Modellieren, Springer, pp. 229-252 (2018)

  • D. Willems, O. Zehner, S. Ruzika,
    On a Technique for Finding Running Tracks of Specific Length in a Road Network
    Operations Research Proceedings 2017, Springer, pp. 333-338 (2018)

  • F. D. Schwahn, C. Thielen,
    The Complexity of Escaping Labyrinths and Enchanted Forests
    Proceedings of the 9th International Conference on Fun with Algorithms (FUN), LIPIcs (100), pp. 30:1-13 (2018)

  • H. Corsten, M. Hopf, B. Kasper, C. Thielen,
    Regionalized Assortment Planning for Multiple Chain Stores
    Operations Research Proceedings 2016 - Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), pp. 451-457 (2018)

  • F. Gensheimer, T. Dietz, S. Ruzika, K. Kraft, N. Wehn,
    Improved Maximum-Likelihood Decoding Using Sparse Parity-Check Matrices
    2018 25th International Conference on Telecommunications (ICT), pp. 236-240 (2018)

2017

  • M. Bender, C. Thielen, S. Westphal,
    Online Interval Scheduling with a Bounded Number of Failures
    Journal of Scheduling 20, pp. 443-457 (2017)

  • M. Holzhauser, S. O. Krumke, C. Thielen,
    On the Complexity and Approximability of Budget-Constrained Minimum Cost Flows
    Information Processing Letters 126, pp. 24-29 (2017)

  • M. Holzhauser, S. O. Krumke,
    An FPTAS for the parametric knapsack problem
    Information Processing Letter 126, pp. 43-47 (2017)

  • H. Corsten, M. Hopf, B. Kasper, C. Thielen,
    Assortment Planning for Multiple Chain Stores
    OR Spectrum (online first), pp. 1-38 (2017)

  • A. Giudici, P. Halffmann, S. Ruzika, C. Thielen,
    Approximation Schemes For the Parametric Knapsack Problem
    Information Processing Letters 120, pp. 11-15 (2017)

  • P. Halffmann, S. Ruzika, C. Thielen, D. Willems,
    A General Approximation Method for Bicriteria Minimization Problems
    Theoretical Computer Science 695, pp. 1-15 (2017)

  • M. Holzhauser, S. O. Krumke, C. Thielen,
    A Network Simplex Method for the Budget-Constrained Minimum Cost Flow Problem
    European Journal of Operational Research 259, pp. 864-872 (2017)

  • M. Holzhauser, S. O. Krumke, C. Thielen,
    Maximum Flows in Generalized Processing Networks
    Journal of Combinatorial Optimization 33, pp. 1226-1256 (2017)

  • M. Hopf, C. Thielen, O. Wendt,
    Competitive Algorithms for Multistage Online Scheduling
    European Journal of Operational Research 260, pp. 468-481 (2017)

  • A. Chassein, M. Goerigk,
    Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
    European Journal of Operational Research 258, pp. 58-69 (2017)

  • M. Goerigk, M. Schmidt,
    Line planning with user-optimal route choice
    European Journal of Operational Research 259, pp. 424-436 (2017)

  • K. Klamroth, S. Mostaghim, B. Naujoks, S. Poles, R. Purshouse, G. Rudolph, S. Ruzika, S. Sayin, M. M. Wiecek, X. Yao,
    Multiobjective optimization for interwoven systems
    Journal of Multi-Criteria Decision Analysis 24, pp. 71-81 (2017)

  • T. Kuhn, S. Ruzika,
    A coverage-based Box-Algorithm to compute a representation for optimization problems with three objective functions
    Journal of Global Optimization 67, pp. 581-600 (2017)

  • C. Torchiani, J. Ohst, D. Willems, S. Ruzika,
    Shortest Paths with Shortest Detours
    Journal of Optimization Theory and Applications 174, pp. 858-874 (2017)

  • J. Figueira, C. M. Fonseca, P. Halffmann, K. Klamroth, L. Paquete, S. Ruzika, B. Schulze, M. Stiglmayr, D. Willems,
    Easy to say they are Hard, but Hard to see they are Easy - Towards a Categorization of Tractable Multiobjective Combinatorial Optimization Problems
    Journal of Multi-Criteria Decision Analysis 24, pp. 82-98 (2017)

  • S. Ruzika, H. Siller, M. Bracke,
    Evakuierungsszenarien in Modellierungswochen - ein interessantes und spannendes Thema für den Mathematikunterricht
    Neue Materialien für einen realitätsbezogenen Mathematikunterricht 3, Springer, pp. 181-190 (2017)

2016

  • D. H. Biedermann, C. Torchiani, P. M. Kielar, D. Willems, O. Handel, S. Ruzika, A. Borrmann,
    A hybrid and multiscale approach to model and simulate mobility in the context of public events
    Transportation Research Procedia 19, pp. 350-363 (2016)

  • A. Chassein, S. O. Krumke, C. Thielen,
    Capacitated Network Design Games with Weighted Players
    Networks 68, pp. 141-158 (2016)

  • A. Chassein, M. Goerigk,
    A bicriteria approach to robust optimization
    Computers & Operations Research 66, pp. 181-189 (2016)

  • M. Holzhauser, S. O. Krumke, C. Thielen,
    Budget-Constrained Minimum Cost Flows
    Journal of Combinatorial Optimization 31, pp. 1720-1745 (2016)

  • C. Thielen, M. Tiedemann, S. Westphal,
    The Online Knapsack Problem with Incremental Capacity
    Mathematical Methods of Operations Research 83, pp. 207-242 (2016)

  • A. Chassein, M. Goerigk,
    On the recoverable robust traveling salesman problem
    Optimization Letters 10, pp. 1479-1492 (2016)

  • M. Goerigk, S. Knust, X. Le,
    Robust storage loading problems with stacking and payload constraints
    European Journal of Operational Research 253, pp. 51-67 (2016)

  • M. Goerigk, S. Westphal,
    A combined local search and integer programming approach to the traveling tournament problem
    Annals of Operations Research 239, pp. 343-354 (2016)

  • M. Goerigk, I. Ndiaye,
    Robust flows with losses and improvability in evacuation planning
    EURO Journal on Computational Optimization 4, pp. 241-270 (2016)

  • S. Göttlich, S. Kühn, J. Ohst, S. Ruzika,
    Evacuation modeling: a case study on linear and nonlinear network flow models
    EURO journal on computational optimization 4, pp. 219-239 (2016)

  • T. Kuhn, C. M. Fonseca, L. Paquete, S. Ruzika, M. M. Duarte, J. Figueira,
    Hypervolume subset selection in two dimensions: Formulations and algorithms
    Evolutionary Computation 24, pp. 411-425 (2016)

  • P. Heßler, H. W. Hamacher,
    Sink location to find optimal shelters in evacuation planning
    EURO Journal on Computational Optimization 4, pp. 325-347 (2016)

  • U. Pyakurel, M. Goerigk, T. Dhamala, H. W. Hamacher,
    Transit dependent evacuation planning for Kathmandu Valley: a case study
    International Journal of Operational Research/Nepal 5, pp. 49-73 (2016)

  • M. Goerigk, H. W. Hamacher,
    SI: disaster risk management
    EURO Journal on Computational Optimization 4, pp. 215-217 (2016)

  • K. Kölker, C. Mannweiler, C. Thielen, K. Lütjens,
    Time Relaxed Itinerary-Based Route Development for Airline Networks
    Proceedings of the 9th Triennial Symposium on Transportation Analysis (TRISTAN), pp. 1-4 (2016)

  • M. Jung, D. M. Mathew, C. Weis, W. Norbert, I. Heinrich, M. V. Natale, S. O. Krumke,
    ConGen: An Application Specific DRAM Memory Controller Generator
    Proceedings of the Second International Symposium on Memory Systems, pp. 257-267 (2016)

  • A. Raith, C. Thielen, J. Tidswell,
    Modelling and Optimising Fuel Consumption in Traffic Assignment Problems
    Proceedings of the 38th Australasian Transport Research Forum (ATRF), pp. 1-13 (2016)

  • F. Gensheimer, S. Ruzika, S. Scholl, N. Wehn,
    ADMM versus simplex algorithm for LP decoding
    9th International Symposium on Turbo Codes and Iterative Information Processing (ISTC), 2016, pp. 211-215 (2016)

  • D. H. Biedermann, C. Torchiani, P. M. Kielar, D. Willems, O. Handel, S. Ruzika, A. Borrmann,
    A hybrid and multiscale approach to model and simulate mobility in the context of public events
    Transportation Research Procedia (19), pp. 350-363 (2016)

2015

  • C. Torchiani, M. J. Seitz, D. Willems, S. Ruzika, G. Köster,
    Fahrgastwechselzeiten von Shuttlebussen
    H. TUM-I1517. TU München: Universität Koblenz-Landau 2015 (2015)

  • S. Büttner, S. O. Krumke,
    The Canadian Tour Operator Problem on Paths - Tight Bounds and Resource Augmentation
    Journal of Combinatorial Optimization (2015)

  • S. Büttner, S. O. Krumke,
    Robust Optimization for Routing Problems on Trees
    TOP: An Official Journal of the Spanish Society of Statistics and Operations Research (2015)

  • M. Holzhauser, S. O. Krumke, C. Thielen,
    Convex Generalized Flows
    Discrete Applied Mathematics 190-191, pp. 86-99 (2015)

  • M. Bender, C. Thielen, S. Westphal,
    Packing Items Into Several Bins Facilitates Approximating the Separable Assignment Problem
    Information Processing Letters 115, pp. 570-575 (2015)

  • T. Dhamala,
    A survey on models and algorithms for discrete evacuation planning network problems
    Journal of Industrial & Management Optimization 11, pp. 265-289 (2015)

  • M. Goerigk, K. Deghdak, V. T'Kindt,
    A two-stage robustness approach to evacuation planning with buses
    Transportation Research Part B: Methodological 78, pp. 66-82 (2015)

  • M. Goerigk, M. Gupta, J. Ide, A. Schöbel, S. Sen,
    The robust knapsack problem with queries
    Computers & Operations Research 55, pp. 12-22 (2015)

  • L. Turner, D P. Gross, H. W. Hamacher, S. O. Krumke,
    Static and dynamic source locations in undirected networks
    TOP: An Official Journal of the Spanish Society of Statistics and Operations Research 23 (2015)

  • L. Turner, M. Ehrgott, H. W. Hamacher,
    On the generality of the greedy algorithm for solving matroid base problems
    Discrete Applied Mathematics 195, pp. 114-128 (2015)

  • T. L. Werth, S. Büttner, S. O. Krumke,
    Robust Bottleneck Routing Games
    Networks 66, pp. 57-66 (2015)

  • A. B. Chassein, M. Goerigk,
    A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
    European Journal of Operational Research 244, pp. 739-747 (2015)

  • A. Chassein, M. Goerigk,
    Alternative formulations for the ordered weighted averaging objective
    Information Processing Letters 115, pp. 604-608 (2015)

  • M. Goerigk,
    Exact and heuristic approaches to the robust periodic event scheduling problem
    Public Transport 7, pp. 101-119 (2015)

  • K. T. Nguyen, A. Chassein,
    Inverse eccentric vertex problem on networks
    Central European Journal of Operations Research 23, pp. 687-698 (2015)

  • K. Nguyen, A. Chassein,
    The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance
    European Journal of Operational Research 247, pp. 774-781 (2015)

  • S. Ruzika, C. Torchiani,
    Comments on: Static and dynamic source locations in undirected networks
    TOP 23, pp. 655-659 (2015)

  • M. Goerigk, H. W. Hamacher,
    Optimisation models to enhance resilience in evacuation planning
    Civil Engineering and Environmental Systems 32, pp. 90-99 (2015)

  • L. Turner, D. Groß, H. W. Hamacher, S. O. Krumke,
    Rejoinder on: Static and dynamic source locations in undirected networks
    TOP 23, pp. 665-668 (2015)

  • P. Halffmann, S. O. Krumke, A. Quilliot, A. K. Wagler, J. Wegener,
    On the Online Min-Wait Relocation Problem
    Electronic Notes in Discrete Mathematics 50, pp. 281 - 286 (2015)

  • I. Hamling, M. O'Sullivan, C. Thielen, C. Walker,
    Improving Resource Efficiency in Internet Cafés by Virtualization and Optimal User Allocation
    Proceedings of the 8th IEEE/ACM International Conference on Utility and Cloud Computing (UCC), pp. 1-9 (2015)

  • A. Groß, H. W. Hamacher, A. Maier,
    Library of Location and Layout Algorithms (LoLoLA) and Urban Event Planning
    EUROPEAN WORKING GROUP ON LOCATION ANALYSIS MEETING 2015, pp. 59 (2015)

  • P. Heßler, H. W. Hamacher,
    Extended Sink Location Problems
    EUROPEAN WORKING GROUP ON LOCATION ANALYSIS MEETING 2015, pp. 63 (2015)

  • P. Halffmann, S. O. Krumke, A. Quilliot, A. Wagler, J. Wegener,
    On the Online Min-Wait Relocation Problem
    Proceedings of the VIII Latin-American Algorithms, Graphs, and Optimization Symposium, Electronic Notes in Discrete Mathematics (2015)

  • P. Halffmann, S. O. Krumke, A. Quilliot, A. K. Wagler, J. Wegener,
    On the online max-accept relocation problem
    Procedings of 6th International Workshop on Freight Transportation and Logistics (ODYSSEUS 2015) (2015)

  • W. Bock, M. Bracke, J. Kreckler,
    Taxonomy of modelling tasks
    CERME 9-Ninth Congress of the European Society for Research in Mathematics Education, pp. 821-826 (2015)

  • M. Bracke, P. Capraro, J. Kreckler, A. Roth,
    The Fraunhofer MINT-EC Math Talents Programme
    CERME 9-Ninth Congress of the European Society for Research in Mathematics Education, pp. 959-960 (2015)

2014

  • M. Goerigk, K. Deghdak, P. Heßler,
    A comprehensive evacuation planning model and genetic solution algorithm
    Transportation research part E: logistics and transportation review 71, pp. 82-97 (2014)

  • M. Goerigk, A. Schöbel,
    Recovery-to-optimality: A new two-stage approach to robustness with an application to aperiodic timetabling
    Computers & Operations Research 52, pp. 1-15 (2014)

  • U. Pyakurel, H. W. Hamacher, T. Dhamala,
    Generalized maximum dynamic contraflow on lossy network
    International Journal of Operations Research Nepal 3, pp. 27-44 (2014)

  • T. L. Werth, H. Sperber, S. O. Krumke,
    Computation of equilibria and the price of anarchy in bottleneck congestion games
    Central European Jurnal of Operations Research 22, pp. 687-712 (2014)

  • T. L. Werth, M. Holzhauser, S. O. Krumke,
    Atomic routing in a deterministic queuing model
    Operations Research Perspectives 1, pp. 18-41 (2014)

  • F. Bruns, M. Goerigk, S. Knust, A. Schöbel,
    Robust load planning of trains in intermodal transportation
    OR spectrum 36, pp. 631-668 (2014)

  • M. Goerigk,
    A note on upper bounds to the robust knapsack problem with discrete scenarios
    Annals of Operations Research 223, pp. 461-469 (2014)

  • M. Goerigk,
    ROPI--a robust optimization programming interface for C++
    Optimization Methods and Software 29, pp. 1261-1280 (2014)

  • M. Goerigk, B. Grün,
    A robust bus evacuation model with delayed scenario information
    OR spectrum 36, pp. 923-948 (2014)

  • S. Göttlich, S. Kühn, J. Ohst, S. Ruzika,
    Influence of Spreading Hazardous Material in Macroscopic Evacuation Dynamics: A Proof of Concept
    Pedestrian and Evacuation Dynamics 2012, Springer, pp. 275-282 (2014)

  • H. W. Hamacher, B. Grün,
    Von Straßenkarten bis zur Evakuierung von Städten!
    Zukunftsperspektiven des Operations Research, Springer, pp. 203-226 (2014)
  • T. G. Schmitt, S. Worreschk, I. Alves, F. Herold, C. Thielen,
    An Optimization and Decision Support Tool for Long-Term Strategies in the Transformation of Urban Water Infrastructure
    Proceedings of the 11th International Conference on Hydroinformatics (HIC), pp. 1-8 (2014)

  • S. Worreschk, I. Alves, T. G. Schmitt, C. Thielen,
    Optimization of Transformation Processes of Drainage Systems in Rural Areas
    Proceedings of the 13th International Conference on Urban Drainage (ICUD), pp. 1-8 (2014)

  • F. Gensheimer, S. Ruzika, S. Scholl, N. Wehn,
    A simplex algorithm for LP decoding hardware
    Personal, Indoor, and Mobile Radio Communication (PIMRC), 2014 IEEE 25th Annual International Symposium on, pp. 790-794 (2014)

  • M. Helmling, E. Rosnes, S. Ruzika, S. Scholl,
    Efficient maximum-likelihood decoding of linear block codes on binary memoryless channels
    Information Theory (ISIT), 2014 IEEE International Symposium on, pp. 2589-2593 (2014)

  • S. O. Krumke, F. D. Schwahn, C. Thielen,
    Being Negative Makes Life NP-hard (for Product Sellers)
    Proceedings of the 7th International Conference on Fun with Algorithms (FUN), LNCS (8496), pp. 277-288 (2014)

  • M. Goerigk, R. Hoshino, K. Kawarabayashi, S. Westphal,
    Solving the Traveling Tournament Problem by Packing Three-Vertex Paths.
    AAAI, pp. 2271-2277 (2014)

  • J. Kreckler,
    KOMMS: Teacher training courses fostering modelling in schools
    Educating the educators: international approaches to scaling-up professional development in mathematics and science education. Proceedings of the conference hosted jointly by project mascil (mathematics and science for life) and the German Centre for Mathematics Education (DZLM), 15-16 December 2014 in Essen, Germany, pp. 111 (2014)

  • S. O. Krumke, A. Quilliot, A. Wagler, J. Wegener,
    Relocation in Carsharing Systems using Flows in Time-Expanded Networks
    Proceedings of the 5th Annual International Conference on Software Engineering & Applications, LNCS (8504), pp. 87-98 (2014)

  • M. Goerigk, Y. Sabharwal, A. Schöbel, S. Sen,
    Approximation algorithms for the weight-reducible knapsack problem
    International Conference on Theory and Applications of Models of Computation, pp. 203-215 (2014)

  • M. Goerigk, B. Grün, P. Heßler,
    Combining bus evacuation with location decisions: A branch-and-price approach
    Transportation Research Procedia (2), pp. 783-791 (2014)

  • I. Ndiaye, E. Neron, A. Linot, N. Monmarche, M. Goerigk,
    A new model for macroscopic pedestrian evacuation planning with safety and duration criteria
    Transportation Research Procedia (2), pp. 486-494 (2014)

2013

  • M. Bender, S. Büttner, S. O. Krumke,
    Online delay management on a single train line: beyond competitive analysis
    Public Transport 5, pp. 243-266 (2013)

  • S. O. Krumke, C. Thielen,
    The Generalized Assignment Problem with Minimum Quantities
    European Journal of Operational Research 228, pp. 46-55 (2013)

  • S. O. Krumke, C. Zeck,
    Generalized Max Flow in Series-Parallel Graphs
    Discrete Optimization 10, pp. 155-162 (2013)

  • C. Thielen, S. Westphal,
    Complexity and Approximability of the Maximum Flow Problem with Minimum Quantities
    Networks 62, pp. 125-131 (2013)

  • M. Goerigk, M. Schmidt, A. Schöbel, M. Knoth, M. Müller-Hannemann,
    The price of strict and light robustness in timetable information
    Transportation Science 48, pp. 225-242 (2013)

  • H. W. Hamacher, S. Heller, B. Rupp,
    Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning
    Annals of Operations Research 207, pp. 161-180 (2013)

  • T. Vincent, F. Seipp, S. Ruzika, A. Przybylski, X. Gandibleux,
    Multiple objective branch and bound for mixed 0-1 linear programming: Corrections and improvements for the biobjective case
    Computers & Operations Research 40, pp. 498-509 (2013)

  • M. Goerigk, B. Grün, P. Heßler,
    Branch and bound algorithms for the bus evacuation problem
    Computers & Operations Research 40, pp. 3010-3020 (2013)

  • M. Goerigk, M. Schachtebeck, A. Schöbel,
    Evaluating line concepts using travel times and robustness
    Public Transport 5, pp. 267-284 (2013)

  • M. Goerigk, A. Schöbel,
    Improving the modulo simplex algorithm for large-scale periodic timetabling
    Computers & Operations Research 40, pp. 1363-1370 (2013)

  • S. O. Krumke, C. Zeck,
    Generalized max flow in series-parallel graphs
    Discrete Optimization 10, pp. 155-162 (2013)

  • M. Siebert, M. Goerigk,
    An experimental comparison of periodic timetabling models
    Computers & Operations Research 40, pp. 2251-2259 (2013)

  • J. Kreußler, H. W. Hamacher,
    Wie Geometrie zu einem anwendungsbezogenen und alltagsrelevanten Mathematikunterricht beitragen kann
    Universitätsbibliothek Dortmund, (2013)

  • H. W. Hamacher, J. Kreußler,
    Merging educational and applied mathematics: the example of locating bus stops
    Accepted and presented paper at CERME8 (Congress of European Research in Mathematics Education), Antalya, Turkey (2013)

  • L. Turner, M. Ehrgott, H. W. Hamacher,
    On the generality of the greedy algorithm for solving matroid problems.
    CTW, pp. 217-220 (2013)

  • M. Helmling, S. Ruzika,
    Towards combinatorial LP turbo decoding
    2013 IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 1491-1495 (2013)

  • S. Scholl, F. Kienle, M. Helmling, S. Ruzika,
    Integer programming as a tool for analysis of channel codes
    Systems, Communication and Coding (SCC), Proceedings of 2013 9th International ITG Conference on, pp. 1-6 (2013)

  • M. Bender, C. Thielen, S. Westphal,
    A Constant Factor Approximation for the Generalized Assignment Problem with Minimum Quantities and Unit Size Items
    Proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS), LNCS (8087), pp. 135-145 (2013)

  • S. O. Krumke, A. Quilliot, A. Wagler, J. Wegener,
    Models and Algorithms for Carsharing Systems and Related Problems
    Proceedings of the VII Latin-American Algorithms, Graphs, and Optimization Symposium, Electronic Notes in Discrete Mathematics (44), pp. 201-206 (2013)

  • M. Goerigk, S. Heße, M. Müller-Hannemann, M. Schmidt, A. Schöbel,
    Recoverable robust timetable information
    ATMOS-13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems-2013 (33), pp. 1-14 (2013)

2012

  • S. O. Krumke, J. Rambau,
    Stability with Uniform Bounds for On-Line Dial-a-Ride Problems under Reasonable Load
    Lecture Notes in Control and Information Sciences 417, pp. 387-412 (2012)

  • C. Thielen, S. Westphal,
    Approximation Algorithms for TTP(2)
    Mathematical Methods of Operations Research 76, pp. 1-20 (2012)

  • A. Borrmann, A. Kneidl, G. Köster, S. Ruzika, M. Thiemann,
    Bidirectional coupling of macroscopic and microscopic pedestrian evacuation models
    Safety science 50, pp. 1695-1703 (2012)

  • J. Gorski, K. Klamroth, S. Ruzika,
    Generalized multiple objective bottleneck problems
    Operations Research Letters 40, pp. 276-281 (2012)

  • M. Helmling, S. Ruzika, A. Tanatmis,
    Mathematical programming decoding of binary linear codes: Theory and algorithms
    IEEE Transactions on Information Theory 58, pp. 4753-4769 (2012)

  • C. Klamler, U. Pferschy, S. Ruzika,
    Committee selection under weight constraints
    Mathematical Social Sciences 64, pp. 48-56 (2012)

  • S. Ruzika, M. Thiemann,
    Min-Max quickest path problems
    Networks 60, pp. 253-258 (2012)

  • L. Turner,
    Variants of shortest path problems
    Algorithmic Operations Research 6, pp. 91-104 (2012)

  • J. Kreußler, F. Bunke, H. W. Hamacher,
    Motivationssteigerung im Geometrieunterricht anhand von Modellierung kompetitiver Standortplanung
    Universitätsbibliothek Dortmund, (2012)

  • M. Akgül, H. W. Hamacher, S. Tüfekci,
    Combinatorial optimization: new frontiers in theory and practice
    Springer Science & Business Media, 82 (2012)

  • S O. Krumke, H. Noltemeier,
    Graphentheorische Konzepte und Algorithmen
    B.G. Teubner, (2012)

  • N. Leithäuser, I. Schüle, S. O. Krumke,
    Optimierte Abstimmung der Umsteigebeziehungen im ungetakteten ÖPNV unter Berücksichtigung der Umlaufplanung
    Multikonferenz Wirtschaftsinformatik 2012 (2012)

  • S. Scholl, F. Kienle, M. Helmling, S. Ruzika,
    ML vs. BP decoding of binary and non-binary LDPC codes
    Turbo Codes and Iterative Information Processing (ISTC), 2012 7th International Symposium on, pp. 71-75 (2012)

  • K. Küfer, H. W. Hamacher, T. Bortfeld,
    A multicriteria optimization approach for inverse radiotherapy planning
    The Use of Computers in Radiation Therapy: XIIIth International Conference Heidelberg, Germany May 22-25, 2000, pp. 26 (2012)

  • N. Leithäuser, S. O. Krumke, M. Merkert,
    Approximating Infeasible 2VPI-Systems
    Proceedings of the 38th International Workshop on Graph-Theoretic Concepts in Computer Science, LNCS (7551), pp. 225-236 (2012)

2011

  • L. Epstein, S. O. Krumke, A. Levin, H. Sperber,
    Selfish Bincoloring
    Journal of Combinatorial Optimization 22, pp. 531-548 (2011)

  • S. Göttlich, S. Kühn, J. Ohst, S. Ruzika, M. Thiemann,
    Evacuation dynamics influenced by spreading hazardous material
    Networks & Heterogeneous Media 6, pp. 443-464 (2011)

  • S. O. Krumke, C. Thielen, C. Zeck,
    Extensions to Online Delay Management on a Single Train Line: New Bounds for Delay Minimization and Profit Maximization
    Mathematical Methods of Operations Research 74, pp. 53-75 (2011)

  • S. O. Krumke, C. Thielen, S. Westphal,
    Interval Scheduling on Related Machines
    Computers and Operations Research 38, pp. 1836-1844 (2011)

  • S. O. Krumke, C. Thielen,
    Minimum Cost Flows with Minimum Quantities
    Information Processing Letters 111, pp. 533-537 (2011)

  • S. O. Krumke, S. Westphal, A. Taudes,
    Online Scheduling of Weighted Equal-Length Jobs with Hard Deadlines on Parallel Machines
    Computers and Operations Research 38, pp. 1103-1108 (2011)

  • C. Thielen, S. Westphal,
    Complexity of the Traveling Tournament Problem
    Theoretical Computer Science 412, pp. 345-351 (2011)

  • C. Thielen, S. O. Krumke,
    Truthful Mechanisms for Selfish Routing and Two-Parameter Agents
    Theory of Computing Systems 49, pp. 196-223 (2011)

  • D. Elvikis, H. W. Hamacher, V. T'kindt,
    Scheduling two agents on uniform parallel machines with makespan and cost functions
    Journal of Scheduling 14, pp. 471-481 (2011)

  • J. Gorski, K. Klamroth, S. Ruzika,
    Connectedness of efficient solutions in multiple objective combinatorial optimization
    Journal of Optimization Theory and Applications 150, pp. 475-497 (2011)

  • S. Ruzika, H. Sperber, M. Steiner,
    Earliest arrival flows on series-parallel graphs
    Networks 57, pp. 169-173 (2011)

  • L. Turner, A. P. Punnen, Y. P. Aneja, H. W. Hamacher,
    On generalized balanced optimization problems
    Mathematical Methods of Operations Research 73, pp. 19-27 (2011)

  • H. W. Hamacher, S. Heller, W. Klein, G. Köster, S. Ruzika,
    A sandwich approach for evacuation time bounds
    Pedestrian and Evacuation Dynamics, Springer, pp. 503-513 (2011)

  • H. W. Hamacher, K. Leiner, S. Ruzika,
    Quickest cluster flow problems
    Pedestrian and Evacuation Dynamics, Springer, pp. 327-336 (2011)

  • A. Kneidl, M. Thiemann, A. Borrmann, S. Ruzika, H. W. Hamacher, G. Köster, E. Rank,
    Bidirectional coupling of macroscopic and microscopic approaches for pedestrian behavior prediction
    Pedestrian and Evacuation Dynamics, Springer, pp. 459-470 (2011)

  • K. Leiner, S. Ruzika,
    Quickest cluster flow problems on tree networks
    Network Optimization, Springer, pp. 243-255 (2011)

  • S. Ruzika, M. Thiemann,
    Reliable and restricted quickest path problems
    Network Optimization, Springer, pp. 309-314 (2011)

  • L. Turner, H. W. Hamacher,
    On universal shortest paths
    Operations Research Proceedings 2010, Springer, pp. 313-318 (2011)

  • S. Heller, H. W. Hamacher,
    The multi terminal q-FlowLoc problem: A heuristic
    Network Optimization, Springer, pp. 523-528 (2011)

  • S. O. Krumke, C. Thielen, S. Westphal,
    Interval Scheduling on Related Machines: Complexity and Online Algorithms
    Proceedings of the 10th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), pp. 236-238 (2011)

  • J. Frasch, S. O. Krumke, S. Westphal,
    MIP formulations for Flowshop Scheduling with Limited Buffers
    Proceedings of the 1st International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems, LNCS (6595), pp. 127-138 (2011)
Zum Seitenanfang