Institute for Numerical and Applied Mathematics - Research Group Optimization

Publications by the Research Group Optimization





Books




  • J. Harbering. 2016. Planning a Public Transportation System with a View Towards Passengers' Convenience. Universität Göttingen.
  • M. Schmidt. 2014. Integrating Routing Decisions in Public Transportation Problems89: Springer.
  • J. Manitz. 2014. Statistical Inference for Propagation Processes on Complex Networks. Universität Göttingen.
  • J. Ide. 2014. Concepts of Robustness for Uncertain Multi-Objective Optimization. Universität Göttingen.
  • R. Hübner. 2013. A level set approach to integer nonlinear optimization. Universität Göttingen.
  • T. Krempasky. 2012. Locating median lines and hyperplanes with a restriction on the slope. Universität Göttingen.
  • M. Goerigk. 2012. Algorithms and Concepts for Robust Optimization. Universität Göttingen.
  • D. Scholz. 2012. Deterministic Global Optimization: Geometric Branch-and-bound Methods and Their Applications. Springer, New York.
  • M.-C. Körner. 2011. Minisum Hyperspheres. Springer.
  • M. Schachtebeck. 2010. Delay Management in Public Transportation: Capacities, Robustness, and Integration. Universität Göttingen.
  • M.-C. Körner, A. Schöbel. 2010. Gene, Graphen, Organismen - Modellierungs- und Analysemethoden in der Systembiologie. Shaker.
  • A. Schöbel, D. Scholz. 2010. Evolution und Epidemie -- Spieltheorie in der Biophysik. Shaker.
  • M.-C. Körner, J. Geldermann, A. Schöbel. 2010. Erträge, Diagramme und Algorithmen - Operations Research in der Praxis. Shaker.
  • M. Krüsemann, M. Schachtebeck, A. Schöbel. 2010. Bahn, Bus, PKW -- Optimierung in der Verkehrsplanung. Shaker.
  • S. Schwarze. 2008. Path Player Games: Analysis and Applications. Springer.
  • C. Conte. 2008. Identifying dependencies among delays. Universität Göttingen.
  • F. Geraets, L. Kroon, A. Schöbel, D. Wagner, C. Zaroliagis. 2007. Algorithmic Methods for Railway Optimization4359: Springer.
  • A. Schöbel. 2006. Optimization in public transportation. Stop location, delay management and tariff planning from a customer-oriented point of view. Springer.
  • S. Scholl. 2005. Customer-oriented line planning. Technische Universität Kaiserslautern.
  • D. Scholz. 2004. Differential- und Integralrechung I und II. Cuvillier Verlag, Göttingen.
  • A. Schöbel. 1999. Locating Lines and Hyperplanes -- Theory and Algorithms. Kluwer.
  • H.W. Hamacher, A. Schöbel. 1997. Public Transportation and Waste Management in a municipial context (in German). Shaker Verlag, Aachen.



Refereed journal publications




  • P. Gattermann, J. Harbering, A. Schöbel. 2017. Line Pool Generation. Public Transport 9(1-2): 7-32.
  • M.C. L\'opez-de-los-Mozos, J. A. Mesa, A. Schöbel. 2017. A general approach for the location of transfer points on a network with a trip covering criterion and mixed distances. European Journal of Operational Research 260(1): 108-121.
  • M. Schmidt, L. Kroon, A. Schöbel, P. Bouman. 2017. The Traveler's Route Choice Problem under Uncertainty: Dominance Relations between Strategies. Operations Research 65(1): 184-199.
  • K. Klamroth, E. Köbis, A. Schöbel, C. Tammer. 2017. A unified approach to uncertain optimization. European Journal of Operational Research 260(2): 403-420.
  • J. Manitz, J. Harbering, M. Schmidt, T. Kneib, A. Schöbel. 2017. Source Estimation for Propagation Processes on Complex Networks with an Application to Delays in Public Transportation Systems. Journal of the Royal Statistical Society: Series C 66: 521-536.
  • J. Harbering. 2017. Delay Resistant Line Planning with a View Towards Passenger Transfers. TOP. accepted.
  • G. Eichfelder, C. Krüger, A. Schöbel. 2017. Decision uncertainty in multiobjective optimization. Journal of Global Optimization. 1-26. online first.
  • E. Carrizosa, M. Goerigk, A. Schöbel. 2017. A biobjective approach to recovery robustness based on location planning. European Journal of Operational Research 261: 421-435.
  • A. Schöbel. 2017. An Eigenmodel for Iterative Line Planning, Timetabling and Vehicle Scheduling in Public Transportation. Transportation Research C 74: 348-365.
  • M. Goerigk, A. Schöbel. 2016. Algorithm Engineering in Robust Optimization. In Algorithm Engineering: Selected Results and Surveys9220: 245-279.
  • K. Kuhn, A. Raith, M. Schmidt, A. Schöbel. 2016. Bicriteria robust optimization. European Journal of Operational Research 252: 418-431.
  • J. Ide, A. Schöbel. 2016. Robustness for uncertain multi-objective optimization: A survey and analysis of different concepts. OR Spectrum 38(1): 235-271.
  • J. Geldermann, L. Kolbe, A. Schöbel, M. Schumann. 2016. Ressourceneffizienz in Unternehmensnetzwerken – Methoden zur betrieblichen und überbetrieblichen Planung für die Nutzung erneuerbarer Rohstoffe. In Nachhaltiges Entscheiden. Springer. Festschrift zum 65. Geburtstag von Prof. H. Dyckhoff.
  • E. Carrizosa, J. Harbering, A. Schöbel. 2016. Minimizing the passengers' traveling time in the stop location problem. Journal of the Operational Research Society 67(10): 1325-1337.
  • T. Dollevoet, D. Huisman, L. Kroon, M. Schmidt, A. Schöbel. 2015. Delay Management including capacities of stations. Transportation Science 49(2): 185-203.
  • M. Schmidt, A. Schöbel. 2015. Timetabling with Passenger Routing. OR Spectrum 37: 75-97.
  • M. Schmidt, A. Schöbel. 2015. The complexity of integrating routing decisions in public transportation models. Networks 65(3): 228-243.
  • M. Goerigk. 2015. Exact and heuristic approaches to the robust periodic event scheduling problem. Public Transport 7(1): 101-119.
  • M. Goerigk, M. Gupta, J. Ide, A. Schöbel, S. Sen. 2015. The Robust Knapsack Problem with Queries. Computers and Operations Research 55: 12-22.
  • J. Ide, M. Tiedemann, S. Westphal, F. Haiduk. 2015. An application of deterministic and robust optimization in the wood cutting industry. 4OR 13(1): 35-57.
  • J. Brimberg, R. Schieweck, A. Schöbel. 2015. Locating a median line with partial coverage distance. Journal of Global Optimization 62(2): Springer. 371-389.
  • J. Brimberg, H. Juel, M.-C. Körner, A. Schöbel. 2015. On Models for Continuous Facility Location with Partial Coverage. Journal of the Operational Research Society 66(1): 33-43.
  • H. Flier, M. Mihalak, P. Widmayer, A. Zych, Y. Kobayashi, A. Schöbel. 2015. Selecting vertex disjoint paths in plane graphs. Networks 66(2): 136-144.
  • C. Buchheim, R. Hübner, A. Schöbel. 2015. Ellipsoid bounds for convex quadratic integer programming. SIAM journal on optimization 25(2): 741-769.
  • A. Schöbel. 2015. Location of Dimensional Facilities in a Continuous Space. In Location Science. Springer. 63-103.
  • A. Fischer, F. Fischer. 2015. An extended approach for lifting clique tree inequalities. Journal of Combinatorial Optimization 30(3): 489-519.
  • A. Fischer, F. Fischer, G. Jäger, J. Keilwagen, P. Molitor, I. Grosse. 2015. Computational Recognition of RNA Splice Sites by Exact Algorithms for the Quadratic Traveling Salesman Problem. Computation 3(2): 285-298.
  • R. Hübner, A. Schöbel. 2014. When is rounding allowed in integer nonlinear optimization?. European Journal of Operational Research 237: 404-410.
  • R. Bauer, A. Schöbel. 2014. Rules of Thumb -- Practical online strategies for delay management. Public Transport 6(1): 85-105.
  • M.-C. Körner, J.A. Mesa, F. Perea, A. Schöbel, D. Scholz. 2014. A Maximum Trip Covering Location Problem with an Alternative Mode of Transportation on Tree Networks and Segments. TOP 22(1): 227-253.
  • M. Schmidt, A. Schöbel. 2014. Location of speed-up networks. Annals of Operations Research 223(1): 379-401.
  • M. Goerigk, M. Knoth, M. Müller-Hannemann, M. Schmidt, A. Schöbel. 2014. The Price of Strict and Light Robustness in Timetable Information. Transportation Science 48: 225-242.
  • M. Goerigk, A. Schöbel. 2014. Recovery-to-Optimality: A new two-stage approach to robustness with an application to aperiodic timetabling. Computers and Operations Research 52: 1-15.
  • M. Ehrgott, J. Ide, A. Schöbel. 2014. Minmax Robustness for Multi-objective Optimization Problems. European Journal of Operational Research 239: 17-31.
  • J. Ide, E. Köbis. 2014. Concepts of Efficiency for Uncertain Multi-Objective Optimization Problems based on Set Order Relations. Mathematical Methods of Operations Research. Springer Berlin Heidelberg. 1-29.
  • J. Ide, E. Köbis, D. Kuroiwa, A. Schöbel, C. Tammer. 2014. The relationship between multi-objective robustness concepts and set valued optimization. Fixed Point Theory and Applications 2014(83):
  • J. Brimberg, H. Juel, M.-C. Körner, A. Schöbel. 2014. Locating an axis-parallel rectangle on a Manhattan plane. TOP 22(1): 185-207.
  • F. Bruns, M. Goerigk, S. Knust, A. Schöbel. 2014. Robust load planning of trains in intermodal transportation. OR Spectrum 36: 631-668.
  • A. Schöbel. 2014. Generalized light robustness and the trade-off between robustness and nominal quality. MMOR 80(2): 161-191.
  • A. Schöbel, D. Scholz. 2014. A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables. European Journal of Operational Research 232(2): 266-275.
  • A. Fischer. 2014. An Analysis of the Asymmetric Quadratic Traveling Salesman Polytope. SIAM Journal on Discrete Mathematics 28(1): 240-276.
  • A. Fischer, F. Fischer, G. Jäger, J. Keilwagen, P. Molitor, I. Grosse. 2014. Exact algorithms and heuristics for the Quadratic Traveling Salesman Problem with an application in bioinformatics. Discrete Applied Mathematics 166: 97-114.
  • V. Blomer, A. Schöbel. 2013. Twins of powerful numbers. Functiones et Approximatio Commentarii Mathematici 49(2): 349-356.
  • M. Siebert, M. Goerigk. 2013. An Experimental Comparison of Periodic Timetabling Models. Computers and Operations Research 40(10): 2251-2259.
  • M. Schmidt. 2013. Simultaneous Optimization of Delay Management Decisions and Passenger Routes. Public Transport 5(1): 125-147.
  • M. Goerigk, M. Schachtebeck, A. Schöbel. 2013. Evaluating Line Concepts using Travel Times and Robustness: Simulations with the \sf Lintim toolbox. Public Transport 5(3):
  • M. Goerigk, A. Schöbel. 2013. Improving the Modulo Simplex Algorithm for Large-Scale Periodic Timetabling. Computers and Operations Research 40(5): 1363-1370.
  • M. Bender, S. Westphal. 2013. An optimal randomized online algorithm for the k-Canadian Traveller Problem on node-disjoint paths. Journal of Combinatorial Optimization. Springer.
  • M. Bender, S. Büttner, S.O. Krumke. 2013. Online delay management on a single train line: beyond competitive analysis. Public Transport 5(3): Springer Berlin Heidelberg. 243-266.
  • K. Klamroth, E. Köbis, A. Schöbel, C. Tammer. 2013. A unified approach for different concepts of robustness and stochastic programming via nonlinear scalarizing functionals. Optimization 62(5): 649-671.
  • A. Schöbel, S. Schwarze. 2013. Finding Delay-Resistant Line Concepts using a Game-Theoretic Approach. Netnomics 14(3): 95-117.
  • A. Fischer, F. Fischer. 2013. Complete description for the spanning tree problem with one linearised quadratic term. Operations Research Letters 41(6): 701-705.
  • A. Fischer, C. Helmberg. 2013. The symmetric quadratic traveling salesman problem. Mathematical Programming 142(1): 205-254.
  • T. Dollevoet, D. Huisman, M. Schmidt, A. Schöbel. 2012. Delay Management with Rerouting of Passengers. Transportation Science 46(1): 74-89.
  • S. Westphal, K. Noparlik. 2012. A 5.875-approximation for the Traveling Tournament Problem. Annals of Operations Research. Springer Netherlands. 1-14. 10.1007/s10479-012-1061-1.
  • S. Cicerone, G. Di Stefano, M. Schachtebeck, A. Schöbel. 2012. Multi-Stage Recovery Robustness for Optimization Problems: A new Concept for Planning under Disturbances. Information Sciences 190: 107-126.
  • M.-C. Körner, H. Martini, A. Schöbel. 2012. Minisum Hyperspheres in Normed Spaces. Discrete Applied Mathematics 16(15): 2221-2233.
  • D. Scholz. 2012. Theoretical rate of convergence for interval inclusion functions. Journal of Global Optimization 53: 749-767.
  • D. Scholz. 2012. Geometric branch-and-bound methods for constrained global optimization problems. Journal of Global Optimization. DOI 10.1007/s10898-012-9961-9.
  • A. Schöbel. 2012. Line planning in public transportation: models and methods. OR Spectrum 34(3): 491-510.
  • S. Krumke, A. Taudes, S. Westphal. 2011. Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines. Computers and Operations Research 38: 1103-1108.
  • R. Blanquero, E. Carrizosa, A. Schöbel, D. Scholz. 2011. Location of a line in the three-dimensional space. EJOR 215: 14-20.
  • M.-C. Körner, J. Brimberg, H. Juel, A. Schöbel. 2011. Geometric fit of a point set by generalized circles. Journal of Global Optimization 51(1): 115-132.
  • M. Ehrgott, L. Shao, A. Schöbel. 2011. An Approximation Algorithm for Convex Multi-objective Programming Problems. Journal of Global Optimization. 397-516.
  • J. Geldermann, A. Schöbel. 2011. On the similarities of some Multi-Ciriteria Decision Analysis Methods. Multi-criteria decision analysis 18(3-4): 219-230.
  • J. Brimberg, H. Juel, M.-C. Körner, A. Schöbel. 2011. Locating a general minisum `circle' on the plane. 4OR 9(4): 351-370.
  • Frasch, Janick, Krumke, Sven, Westphal, Stephan. 2011. MIP Formulations for Flowshop Scheduling with Limited Buffers. In Theory and Practice of Algorithms in (Computer) Systems6595: Springer Berlin / Heidelberg. 127-138. 10.1007/978-3-642-19754-3\_14.
  • D. Scholz. 2011. General further discarding tests in geometric branch-and-bound methods for non-convex multicriteria optimization problems. Journal of Multi-Criteria Decision Analysis 18: 65-75.
  • C. Thielen, S. Westphal. 2011. Interval Scheduling on related machines. Computers and Operations Research 38(4-5): 1836-1844.
  • C. Thielen, S. Westphal. 2011. Complexity of the Traveling Tournament Problem. Theoretical Computer Science 412(4-5): 345-351.
  • Thielen, Clemens, Westphal, Stephan. 2010. Approximating the Traveling Tournament Problem with Maximum Tour Length 2. In Algorithms and Computation6507: Springer Berlin / Heidelberg. 303-314.
  • M.-C. Körner, A. Schöbel. 2010. Weber problems with highway distances. TOP 18(1): 223-241.
  • M. Schachtebeck, A. Schöbel. 2010. To wait or not to wait and who goes first? Delay Management with Priority Decisions. Transportation Science 44(3): 307-321.
  • D. Scholz. 2010. The multicriteria big cube small cube method. TOP 18: 286-302.
  • D. Scholz, A. Schöbel. 2010. The theoretical and empirical rate of convergence for geometric branch-and-bound methods. Journal of Global Optimization 48(3): 473-495.
  • C. Liebchen, M. Schachtebeck, A. Schöbel, S. Stiller, A. Prigge. 2010. Computing delay-resistant railway timetables. Computers and Operations Research 37: 857-868.
  • A. Schöbel, D. Scholz. 2010. The Big Cube Small Cube solution method for multidimensional facility location problems. Computers and Operations Research 37: 115-122.
  • S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni, A. Navarra, M. Schachtebeck, A. Schöbel. 2009. Recoverable robustness in shunting and timetabling. In Robust and online large-scale optimization5868: Springer. 28-60.
  • M. Michaelis, A. Schöbel. 2009. Integrating Line Planning, Timetabling, and Vehicle Scheduling: A customer-oriented approach. Public Transport 1(3): 211-232.
  • J. Brimberg, H. Juel, A. Schöbel. 2009. Locating a minisum circle in the plane. Discrete Applied Mathematics 157: 901-912.
  • J. Brimberg, H. Juel, A. Schöbel. 2009. Locating a circle on the plane using the minimax criterion. Studies in Locational Analysis 17: 46-60.
  • I. Fink, S. O. Krumke, S. Westphal. 2009. New lower bounds for online k-server routing problems. Information Processing Letters 109(11): 563-567.
  • D. Poetranto, H.W. Hamacher, S. Horn, A. Schöbel. 2009. Stop Location Design in Public Transportation Networks: Covering and Accessibility Objectives. TOP 17(2): 335-346.
  • A. Schöbel. 2009. Capacity constraints in delay management. Public Transport 1(2): 135-154.
  • A. Schöbel, H.W. Hamacher, A. Liebers, D. Wagner. 2009. The continuous stop location problem in public transportation. Asia-Pacific Journal of Operational Research 26(1): 13-30.
  • A. Schöbel, A. Kratz. 2009. A bicriteria approach for robust timetabling. In Robust and online large-scale optimization5868: Springer. 119-144.
  • S. Westphal. 2008. A note on the k-Canadian Traveller Problem. Information Processing Letters 106(3): 87-89.
  • S. Westphal, S. O. Krumke. 2008. Pruning in Column Generation for service vehicle dispatching. Annals of Operations Research 159(1):
  • S. O. Krumke, S. Saliba, T. Vredeveld, S. Westphal. 2008. Approximation Algorithms for a vehicle routing problem. Mathematical Methods of Operations Research 68(2): 333-359.
  • S. O. Krumke, A. Schwahn, R. van Stee, S. Westphal. 2008. A monotone approximation algorithm for scheduling with precedence constraints. Operations Research Letters 36: 247-249.
  • J. Puerto, A. Schöbel, S. Schwarze. 2008. The path player game: A network game from the point of view of the network providers. Mathematical Methods of Operations Research 68(1): 1-20.
  • J. Brimberg, H. Juel, A. Schöbel. 2007. Locating a circle on a sphere. Operations Research 55(4): 782-791.
  • A. Schöbel. 2007. Integer Programming approaches for solving the delay management problem. In Algorithmic Methods for Railway Optimization. Springer. 145-170.
  • A. Ginkel, A. Schöbel. 2007. To wait or not to wait? The bicriteria delay management problem in public transportation. Transportation Science 41(4): 527-538.
  • S. Westphal, S. O. Krumke, R. van Stee. 2006. Online-Optimization of Large-Scale Vehicle Dispatching Problems. Electronic Notes in Discrete Mathematics. Elsevier. 145-146.
  • S. Westphal, S. O. Krumke, R. van Stee. 2006. Competitive Algorithms for Cottage Rental. Electronic Notes in Discrete Mathematics. Elsevier. 187-188.
  • D. Scholz, M. Weyrauch. 2006. A note on the Zassenhaus product formula. Journal of Mathematical Physics 47: 033505.
  • N. Bissantz, S. Güttler, J. Jacobs, S. Kuy, T. Schaer, A. Schöbel, S. Scholl. 2005. DisKon - Laborversion eines flexiblen, modularen und automatischen Dispositionsassistenzsystems. Eisenbahntechnische Rundschau (ETR) 45(12): 809-821. (in German).
  • A. Schöbel. 2005. Locating stops along bus or railway lines -- a bicriteria problem. Annals of Operations Research 136: 211-227.
  • N. Ruf, A. Schöbel. 2004. Set covering problems with almost consecutive ones property. Discrete Optimization 1(2): 215-228.
  • J. M. Díaz-Bánez, J.A. Mesa, A. Schöbel. 2004. Continuous Location of Dimensional Structures. European Journal of Operational Research 152: 22-44.
  • H.W. Hamacher, A. Schöbel. 2004. Design of Zone Tariff Systems in Public Transportation. OR 52(6): 897-908.
  • L. Foulds, H.W. Hamacher, A. Schöbel, T. Yamaguchi. 2003. On center cycles in grid graphs. Annals of Operations Research 122: 163-175.
  • J. Brimberg, H. Juel, A. Schöbel. 2003. Properties of 3-dimensional line location models. Annals of Operations Research 122: 71-85.
  • A. Schöbel. 2003. Anchored hyperplane location problems. Discrete & Computational Geometry 29(2): 229-238.
  • Z. Drezner, K. Klamroth, A. Schöbel, G. Wesolowsky. 2002. The Weber Problem. In Facility Location - Applications and Theory. Springer. 1-36.
  • J. Brimberg, H. Juel, A. Schöbel. 2002. Linear Facility Location in Three Dimensions - Models and Solution Methods. Operations Research 50(6): 1050-1057.
  • H.W. Hamacher, A. Liebers, A. Schöbel, D. Wagner, F. Wagner. 2001. Locating new stops in a railway network. Electronic Notes in Theoretical Computer Science 50(1):
  • H. Martini, A. Schöbel. 2001. Median and Center hyperplanes in Minkowski spaces -- a unifying approach. Discrete Mathematics 241: 407-426.
  • A. Schöbel. 2001. A Model for the Delay Management Problem based on Mixed-Integer Programming. Electronic Notes in Theoretical Computer Science 50(1):
  • S. Nickel, A. Schöbel, T. Sonneborn. 2000. Hub Location Problems in Urban Traffic Networks. In Mathematical Methods and Optimization in Transportation Systems. KLUWER academic publishers. 95-107.
  • S. Nickel, A. Schöbel. 1999. A geometric approach to global optimization. Journal of Global Optimization 15: 109-126.
  • H. Martini, A. Schöbel. 1999. Hyperplane transversals of homothetical, centrally symmetric polytopes. Periodica Mathematica Hungaria 39: 73-81.
  • H. Martini, A. Schöbel. 1999. A characterization of smooth norms. Geometriae Dedicata 77: 173-183.
  • A. Schöbel. 1999. Solving restricted line location problems via a dual interpretation. Discrete Applied Mathematics 93: 109-125.
  • H. Martini, A. Schöbel. 1998. Median hyperplanes in normed spaces -- a survey. Discrete Applied Mathematics 89: 181-195.
  • A. Schöbel. 1998. Locating least distant lines in the plane. European Journal of Operational Research 106(1): 152-159.
  • M. Ehrgott, H.W. Hamacher, K. Klamroth, S. Nickel, A. Schöbel, M.M. Wiecek. 1997. A Note on the Equivalence of Balance Points and Pareto Solutions in Multiple-Objective Programming. JOTA 92(1): 209-212.
  • H.W. Hamacher, A. Schöbel. 1997. A Note on Center Problems with forbidden Polyhedra. ORL 20: 165-169.
  • A. Schöbel. 1997. Locating line segments with vertical distances. Studies in Locational Analysis 11: 143-158.
  • A. Schöbel. 1996. Zone Planning in Public Transportation. In Advanced Methods in Transportation Analysis. Springer Verlag. 117-134.
  • A. Schöbel. 1996. Locating least-distant lines with block norms. Studies in Locational Analysis 10: 139-150.
  • H.W. Hamacher, A. Schöbel. 1995. On fair zone design in public transportation. In Computer-Aided Transit Scheduling. Springer. 8-22.



Refereed conference proceedings




  • M. Friedrich, M. Hartl, A. Schiewe, A. Schöbel. 2017. Angebotsplanung im öffentlichen Verkehr - planerische und algorithmische Lösungen. In Heureka'17.
  • P. Gattermann, P. Großmann, K. Nachtigall, A. Schöbel. 2016. Integrating Passengers' Routes in Periodic Timetabling: A SAT approach. In 16th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2016)54: Schloss Dagstuhl-Leibniz-Zentrum für Informatik. 1-15.
  • P. Gattermann, A. Schiewe, A. Schöbel. 2016. An Iterative Approach for Integrated Planning in Public Transportation. In 9th Triennial Symposium on Transportation Analysis.
  • J. Pätzold, A. Schöbel. 2016. A Matching Approach for Periodic Timetabling. In 16th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2016)54: Schloss Dagstuhl-Leibniz-Zentrum für Informatik. 1-15.
  • A. Schiewe, A. Schöbel. 2016. A Matching Approach for Line Planning. In 9th Triennial Symposium on Transportation Analysis.
  • M. Tiedemann, J. Ide, A. Schöbel. 2015. Competitive Analysis for Multi-Objective Online Algorithms. In Proceedings of the 9th International Workshop on Algorithms and Computation WALCOM 2015. LNCS 8973, Springer. 210-221.
  • J. Harbering, A. Ranade, M. Schmidt. 2015. Single Track Train Scheduling. In Proceedings of the fifth Multidisciplinary International Scheduling Conference: Theory and Applications MISTA.
  • M. Schmidt. 2014. Integrating Routing Decisions in Network Problems. In Operations Research Proceedings 2012. Springer International Publishing. 21-26.
  • M. Goerigk, Y. Sabharwal, A. Schöbel, S. Sen. 2014. Approximation Algorithms for the Weight-Reducible Knapsack Problem. In Proceedings of TAMC.
  • M. Bender, S. Westphal. 2014. Maximum Generalized Assignment with Convex Costs. In Proceedings of the 3rd International Symposium on Combinatorial Optimization8596: Springer. 75-86.
  • P. Bouman, M. Schmidt, L. Kroon, A. Schöbel. 2013. Passenger Route Choice in Case of Disruptions. In Proceedings of the 16th International IEEE Conference on Intelligent Transport Systems (IEEE-ITSC). http://www.computr.eu/wp-content/uploads/2013/10/IEEE-ITS2013-PassengerChoice.pdf.
  • M. Goerigk, S. Heße, M. Müller-Hannemann, M. Schmidt, A. Schöbel. 2013. Recoverable Robust Timetable Information. In 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems33: Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. 1-14.
  • M. Bender, C. Thielen, S. Westphal. 2013. A Constant Factor Approximation for the Generalized Assignment Problem with Minimum Quantities and Unit Size Items. In Mathematical Foundations of Computer Science 20138087: Springer. 135-145.
  • J. Ide, M. Tiedemann. 2013. Resource Efficiency in Veneer Production: Optimization of a Complex Cutting Problem. In Proceedings of the First International Conference on Resource Efficiency in Interorganizational Networks ResEff. Universitätsverlag Göttingen. 248-258.
  • J. Ide, M. Tiedemann. 2013. An Application of Minmax Robust Efficiency in the Wood Processing Industry. In Proceedings of the First International Conference on Resource Efficiency in Interorganizational Networks ResEff. Universitätsverlag Göttingen. 259-269.
  • E. Carrizosa, J. Harbering, A. Schöbel. 2013. The Stop Location Problem with Realistic Traveling Time. In 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems33: Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. 80-93.
  • M. Goerigk, S. Westphal. 2012. A Combined Local Search and Integer Programming Approach to the Traveling Tournament Problem. In Proceedings of PATAT. SINTEF.
  • T. Dollevoet, M. Schmidt, A. Schöbel. 2011. Delay Management including Capacities of Stations. In 11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems20: Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. 88-99.
  • M. Goerigk, M. Knoth, M. Müller-Hannemann, M. Schmidt, A. Schöbel. 2011. The Price of Robustness in Timetable Information. In 11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems20: Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. 76-87.
  • M. Goerigk, A. Schöbel. 2011. Engineering the Modulo Network Simplex Heuristic for the Periodic Timetabling Problem. In Proceedings of the 10th International Symposium on Experimental Algorithms (SEA)6630: Springer. 181-192.
  • M. Goerigk, A. Schöbel. 2011. A Scenario-Based Approach for Robust Linear Optimization. In Proceedings of the 1st International ICST Conference on Practice and Theory of Algorithms in (Computer) Systems (TAPAS). Springer. 139-150.
  • M. Schmidt, A. Schöbel. 2010. The Complexity of Integrating Routing Decisions in Public Transportation Models. In Proceedings of ATMOS1014: Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. 156-169.
  • M. Goerigk, A. Schöbel. 2010. An Empirical Analysis of Robustness Concepts for Timetabling. In Proceedings of ATMOS1014: Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. 100-113.
  • H. Flier, M. Mihalák, A. Schöbel, P. Widmayer, A. Zych. 2010. Vertex Disjoint Paths for Dispatching in Railways. In Proceedings of ATMOS1014: Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. 61-73.
  • C. Thielen, S. Westphal. 2010. A Combinatorial Algorithm for Strong Implementation of Social Choice Functions. In Proceedings of the 3rd International Workshop on Computational Social Choice (COMSOC 2010).
  • T. Dollevoet, M. Schmidt, A. Schöbel. 2009. Delay Management with Re-Routing of Passengers. In ATMOS 2009.
  • M.-C. Körner, J. Brimberg, H. Juel, A. Schöbel. 2009. General circle location. In Proceedings of the 21st Canadian Conference on Computational Geometry (CCCG2009). 111-114.
  • S. Cicerone, G. Di Stefano, M. Schachtebeck, A. Schöbel. 2008. Dynamic Algorithms for Recoverable Robustness Problems. In ATMOS 2008 - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems.
  • M. Schachtebeck, A. Schöbel. 2008. IP-based Techniques for Delay Management with Priority Decisions. In ATMOS 2008 - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems.
  • K. Bauer, Th. Fischer, S. O. Krumke, K. Gerhardt, S. Westphal, P. Merz. 2008. Improved Construction Heuristics and Local Search for the Routing and Wavelength Assignment Problem. In Proceedings of EvoCOP 2008 - Eight European Conference on Evolutionary Computation in Combinatorial Optimisation4972: Springer. 158-169.
  • C. Conte, A. Schöbel. 2007. Identifying dependencies among delays. In proceedings of IAROR 2007. ISBN 978-90-78271-02-4.
  • S. O. Krumke, S. Saliba, T. Vredeveld, S. Westphal. 2006. Approximation of a Real-World Vehicle Dispatching Problem. In International Conference on Operations Research. 181.
  • S. Mecke, A. Schöbel, D. Wagner. 2006. Stop location - complexity and approximation issues. In 5th workshop on algorithmic methods and models for optimization of railways.
  • A. Schöbel, S. Schwarze. 2006. Dominance and equilibria in the path player game. In Proceedings of OR 2005, Bremen. Springer. 489-494.
  • A. Schöbel, S. Schwarze. 2006. A game-theoretic approach to Line Planning. In 6th workshop on algorithmic methods and models for optimization of railways.
  • A. Schöbel, S. Scholl. 2006. Line Planning with Minimal Travel Time. In 5th Workshop on Algorithmic Methods and Models for Optimization of Railways.
  • S. Westphal, S. O. Krumke. 2005. Improved Pruning in Column Generation of a Vehicle Routing Problem. In Proceedings of the 2nd Multidisciplinary International Conference on Scheduling: Theory and Applications. 705-722.
  • R. Velasquez, M. Ehrgott, D. Ryan, A. Schöbel. 2005. A set-packing aproach to routing trains through railway stations. In 40th Annual Conference of the Operations Research Society of New Zealand. 305-314.
  • M. Gatto, R. Jacob, L. Peeters, A. Schöbel. 2005. The Computational Complexity of Delay Management. In Graph-Theoretic Concepts in Computer Science: 31st International Workshop (WG 2005)3787:
  • M. Schröder, A. Schöbel. 2003. AnSiM -- GIS-gestützte Optimierung von Anschlusssicherungsmaßnahmen. In Angewandte geographische Informationsverarbeitung XV. Wichmann Verlag. 465-473.
  • A. Schöbel, M. Schröder. 2003. Covering population areas by railway stops. In Proceedings of OR 2002, Klagenfurt. Springer. 187-192.
  • A. Schöbel. 1994. Fair Zone Design in Public Transportation Networks. In Operations Research Proceedings 1994. Springer Verlag. 191-196.



Submitted articles




Some of these articles can be found at the Preprint-Reihe of the Institute for Numerical and Applied Mathematics.


  • T. Bajbar, S. Behrends. 2017. How fast do coercive polynomials grow?. Preprint-Reihe, Institut für Numerische und Angewandte Mathematik, Georg-August Universität Göttingen.
  • Krüger, C., Schöbel, A., Wiecek, M.M.. 2017. The robustness gap for uncertain multiobjective optimization. Preprint-Reihe, Institut für Numerische und Angewandte Mathematik, Georg-August Universität Göttingen.
  • A. Raith, M. Schmidt, A. Schöbel, L. Thom. 2017. Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty. Arxiv. https://arxiv.org/abs/1701.06317v1.
  • A. Raith, M. Schmidt, A. Schöbel, L. Thom. 2017. Extensions of Labeling Algorithms for Multi-objective Uncertain Shortest Path Problems. Preprint-Reihe, Institut für Numerische und Angewandte Mathematik, Georg-August Universität Göttingen.
  • O. Aichholzer, A. Fischer, F. Fischer, J.F. Meier, U. Pferschy, A. Pilz, R. Stan\vek. 2016. Minimization and Maximization Versions of the Quadratic Traveling Salesman Problem. Preprint-Reihe, Institut für Numerische und Angewandte Mathematik, Georg-August Universität Göttingen.
  • M.F. Anjos, A. Fischer, P. Hungerländer. 2016. Solution Approaches for Equidistant Double- and Multi-Row Facility Layout Problems. Les Cahiers du GERAD.
  • M. Botte, A. Schöbel. 2016. Dominance for Multi-Objective Robust Optimization Concepts. Preprint-Reihe, Institut für Numerische und Angewandte Mathematik, Georg-August Universität Göttingen.
  • A. Fischer, F. Fischer, S.T. McCormick. 2016. Matroid Optimisation Problems with Nested Non-linear Monomials in the Objective Function. Preprint-Reihe, Institut für Numerische und Angewandte Mathematik, Georg-August Universität Göttingen.
  • S. Behrends, R. Hübner, A. Schöbel. 2015. Norm Bounds and Underestimators for Unconstrained Polynomial Integer Minimization. arXiv. https://arxiv.org/abs/1502.05107.
  • J. Harbering, O. Sinnen, A. Ranade, M. Schmidt. 2015. Single Track Train Scheduling. Prinprint-Reihe, Institut für Numerische und Angewandte Mathematik, Universität Göttingen.
  • A. Fischer, F. Fischer, P. Hungerländer. 2015. New exact approaches to row layout problems. Preprint-Reihe, Institut für Numerische und Angewandte Mathematik, Georg-August Universität Göttingen.
  • P. Gattermann, A. Schiewe, M. Schmidt. 2014. The line planning routing game. Working Paper.
  • J. Harbering, F. Kirchhoff, M. Kolonko, A. Schöbel. 2014. Delay Propagation in Public Transport. Working Paper.
  • R. Schieweck. 2013. Lower bounds for line location problems via demand regions. Institut für Numerische und Angewandte Mathematik, Universität Göttingen.



Download these publications as a single BibTeX-file: publications.bib

Arbeitsgruppe Optimierung

 
   

Contact



   Research Group Optimization
   Prof. Dr. Anita Schöbel
   Lotzestraße 16-18
   37083 Göttingen
   Germany
 
   Phone +49 551-39-12237
   Fax: +49 551-39-33944