Anita Schöbel

Linda Sieber

Oper. Res. Forum, December, 2023

A trajectory based heuristic for the planar p-median problem.

[BibT_eX]

[DOI]

Zvi Drezner

Comput. Oper. Res., October, 2023

Location Problems with Cutoff.

[BibT_eX]

[DOI]

Raoul Müller

Dominic Schuhmacher

Asia Pac. J. Oper. Res., June, 2023

Obituary for Professor Emeritus Jakob Kraurp.

[BibT_eX]

[DOI]

David Pisinger

Dorit S. Hochbaum

Eur. J. Oper. Res., 2023

Recoverable Robust Periodic Timetabling.

[BibT_eX]

[DOI]

Vera Grafe

Proceedings of the 23rd Symposium on Algorithmic Approaches for Transportation Modelling, 2023

2022

Quantum Fourier Transformation in Industrial Applications.

[BibT_eX]

[DOI]

Valeria Bartsch

Matthias Kabel

ERCIM News, 2022

Integrated optimization of sequential processes: General analysis and application to public transport.

[BibT_eX]

[DOI]

Philine Schiewe

EURO J. Transp. Logist., 2022

The Edge Investment Problem: Upgrading Transit Line Segments with Multiple Investing Parties.

[BibT_eX]

[DOI]

Proceedings of the 22nd Symposium on Algorithmic Approaches for Transportation Modelling, 2022

Delay Management with Integrated Decisions on the Vehicle Circulations.

[BibT_eX]

[DOI]

Vera Grafe

Proceedings of the 22nd Symposium on Algorithmic Approaches for Transportation Modelling, 2022

2021

When closest is not always the best: The distributed p-median problem.

[BibT_eX]

[DOI]

Andrea Maier

J. Oper. Res. Soc., 2021

The price of multiobjective robustness: Analyzing solution sets to uncertain multiobjective problems.

[BibT_eX]

[DOI]

Yue Zhou-Kangas

Eur. J. Oper. Res., 2021

Estimating the Robustness of Public Transport Systems Using Machine Learning.

[BibT_eX]

[DOI]

CoRR, 2021

Towards Improved Robustness of Public Transport by a Machine-Learned Oracle.

[BibT_eX]

[DOI]

Proceedings of the 21st Symposium on Algorithmic Approaches for Transportation Modelling, 2021

Solving the Periodic Scheduling Problem: An Assignment Approach in Non-Periodic Networks.

[BibT_eX]

[DOI]

Vera Grafe

Proceedings of the 21st Symposium on Algorithmic Approaches for Transportation Modelling, 2021

A Phase I Simplex Method for Finding Feasible Periodic Timetables.

[BibT_eX]

[DOI]

Felix Spühler

Proceedings of the 21st Symposium on Algorithmic Approaches for Transportation Modelling, 2021

2020

Periodic Timetabling with Integrated Routing: Toward Applicable Approaches.

[BibT_eX]

[DOI]

Philine Schiewe

Transp. Sci., 2020

The blockwise coordinate descent method for integer programs.

[BibT_eX]

[DOI]

Sven Jäger

Math. Methods Oper. Res., 2020

Generating Valid Linear Inequalities for Nonlinear Programs via Sums of Squares.

[BibT_eX]

[DOI]

Sönke Behrends

J. Optim. Theory Appl., 2020

Approximate cutting plane approaches for exact solutions to robust optimization problems.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2020

On the <i>p</i>-hub interdiction problem.

[BibT_eX]

[DOI]

Thomas Ullmert

Stefan Ruzika

Comput. Oper. Res., 2020

Cheapest Paths in Public Transport: Properties and Algorithms.

[BibT_eX]

[DOI]

Reena Urban

Proceedings of the 20th Symposium on Algorithmic Approaches for Transportation Modelling, 2020

2019

Min-ordering and max-ordering scalarization methods for multi-objective robust optimization.

[BibT_eX]

[DOI]

Lisa Thom

Eur. J. Oper. Res., 2019

Dominance for multi-objective robust optimization concepts.

[BibT_eX]

[DOI]

Marco Botte

Eur. J. Oper. Res., 2019

The Trickle-In Effect: Modeling Passenger Behavior in Delay Management.

[BibT_eX]

[DOI]

Jörg P. Müller

Proceedings of the 19th Symposium on Algorithmic Approaches for Transportation Modelling, 2019

2018

Extensions of labeling algorithms for multi-objective uncertain shortest path problems.

[BibT_eX]

[DOI]

Networks, 2018

Norm bounds and underestimators for unconstrained polynomial integer minimization.

[BibT_eX]

[DOI]

Sönke Behrends

Ruth Hübner

Math. Methods Oper. Res., 2018

Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2018

The Weber obnoxious facility location model: A Big Arc Small Arc approach.

[BibT_eX]

[DOI]

Tammy Drezner

Zvi Drezner

Comput. Oper. Res., 2018

Peat and pots: An application of robust multiobjective optimization to a mixing problem in agriculture.

[BibT_eX]

[DOI]

Comput. Electron. Agric., 2018

Cost-Minimal Public Transport Planning.

[BibT_eX]

[DOI]

Proceedings of the 18th Workshop on Algorithmic Approaches for Transportation Modelling, 2018

Robustness as a Third Dimension for Evaluating Public Transport Plans.

[BibT_eX]

[DOI]

Markus Friedrich

Proceedings of the 18th Workshop on Algorithmic Approaches for Transportation Modelling, 2018

2017

Line pool generation.

[BibT_eX]

[DOI]

Philine Gattermann

Jonas Harbering

Public Transp., 2017

Decision uncertainty in multiobjective optimization.

[BibT_eX]

[DOI]

Gabriele Eichfelder

Corinna Krüger

Maria Cruz López de los Mozos Martin

J. Glob. Optim., 2017

The Travelers Route Choice Problem Under Uncertainty: Dominance Relations Between Strategies.

[BibT_eX]

[DOI]

Oper. Res., 2017

A general approach for the location of transfer points on a network with a trip covering criterion and mixed distances.

[BibT_eX]

[DOI]

Juan A. Mesa

Eur. J. Oper. Res., 2017

A unified approach to uncertain optimization.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2017

A biobjective approach to recoverable robustness based on location planning.

[BibT_eX]

[DOI]

Emilio Carrizosa

Eur. J. Oper. Res., 2017

Look-Ahead Approaches for Integrated Planning in Public Transportation.

[BibT_eX]

[DOI]

Proceedings of the 17th Workshop on Algorithmic Approaches for Transportation Modelling, 2017

Robustness Tests for Public Transport Planning.

[BibT_eX]

[DOI]

Markus Friedrich

Proceedings of the 17th Workshop on Algorithmic Approaches for Transportation Modelling, 2017

Integrating Passengers' Assignment in Cost-Optimal Line Planning.

[BibT_eX]

[DOI]

Proceedings of the 17th Workshop on Algorithmic Approaches for Transportation Modelling, 2017

2016

Algorithm Engineering in Robust Optimization.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering - Selected Results and Surveys, 2016

Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts.

[BibT_eX]

[DOI]

OR Spectr., 2016

Minimizing the passengers' traveling time in the stop location problem.

[BibT_eX]

[DOI]

Emilio Carrizosa

Jonas Harbering

J. Oper. Res. Soc., 2016

Bi-objective robust optimisation.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2016

Algorithmic Methods for Optimization in Public Transport (Dagstuhl Seminar 16171).

[BibT_eX]

[DOI]

Leo G. Kroon

Dorothea Wagner

Dagstuhl Reports, 2016

Improvable Knapsack Problems.

[BibT_eX]

[DOI]

CoRR, 2016

A Matching Approach for Periodic Timetabling.

[BibT_eX]

[DOI]

Proceedings of the 16th Workshop on Algorithmic Approaches for Transportation Modelling, 2016

Integrating Passengers' Routes in Periodic Timetabling: A SAT approach.

[BibT_eX]

[DOI]

Proceedings of the 16th Workshop on Algorithmic Approaches for Transportation Modelling, 2016

2015

Delay Management Including Capacities of Stations.

[BibT_eX]

[DOI]

Transp. Sci., 2015

Ellipsoid Bounds for Convex Quadratic Integer Programming.

[BibT_eX]

[DOI]

Christoph Buchheim

Ruth Hübner

SIAM J. Optim., 2015

Timetabling with passenger routing.

[BibT_eX]

[DOI]

OR Spectr., 2015

The complexity of integrating passenger routing decisions in public transportation models.

[BibT_eX]

[DOI]

Networks, 2015

Selecting vertex disjoint paths in plane graphs.

[BibT_eX]

[DOI]

Networks, 2015

On models for continuous facility location with partial coverage.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2015

Locating a median line with partial coverage distance.

[BibT_eX]

[DOI]

Robert Schieweck

J. Glob. Optim., 2015

Algorithm Engineering in Robust Optimization.

[BibT_eX]

[DOI]

CoRR, 2015

The robust knapsack problem with queries.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2015

Erratum: Competitive Analysis for Multi-objective Online Algorithms.

[BibT_eX]

[DOI]

Morten Tiedemann

Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

Competitive Analysis for Multi-objective Online Algorithms.

[BibT_eX]

[DOI]

Morten Tiedemann

Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

2014

The Price of Strict and Light Robustness in Timetable Information.

[BibT_eX]

[DOI]

Transp. Sci., 2014

Rules of thumb: practical online-strategies for delay management.

[BibT_eX]

[DOI]

Reinhard Bauer

Public Transp., 2014

Robust load planning of trains in intermodal transportation.

[BibT_eX]

[DOI]

OR Spectr., 2014

Generalized light robustness and the trade-off between robustness and nominal quality.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2014

A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables.

[BibT_eX]

[DOI]

Daniel Scholz

Eur. J. Oper. Res., 2014

When is rounding allowed in integer nonlinear optimization?

[BibT_eX]

[DOI]

Ruth Hübner

Eur. J. Oper. Res., 2014

Minmax robustness for multi-objective optimization problems.

[BibT_eX]

[DOI]

Matthias Ehrgott

Eur. J. Oper. Res., 2014

Recovery-to-optimality: A new two-stage approach to robustness with an application to aperiodic timetabling.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2014

Location of speed-up subnetworks.

[BibT_eX]

[DOI]

Annika Eickhoff-Schachtebeck

Ann. Oper. Res., 2014

Approximation Algorithms for the Weight-Reducible Knapsack Problem.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2014

Mathematik in der Biologie.

[BibT_eX]

[DOI]

Springer, ISBN: 978-3-642-41843-3, 2014

2013

Evaluating line concepts using travel times and robustness.

[BibT_eX]

[DOI]

Michael Schachtebeck

Public Transp., 2013

Improving the modulo simplex algorithm for large-scale periodic timetabling.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2013

Passenger route choice in case of disruptions.

[BibT_eX]

[DOI]

Proceedings of the 16th International IEEE Conference on Intelligent Transportation Systems, 2013

Recoverable Robust Timetable Information.

[BibT_eX]

[DOI]

Sacha Heße

Proceedings of the 13th Workshop on Algorithmic Approaches for Transportation Modelling, 2013

The Stop Location Problem with Realistic Traveling Time.

[BibT_eX]

[DOI]

Emilio Carrizosa

Jonas Harbering

Proceedings of the 13th Workshop on Algorithmic Approaches for Transportation Modelling, 2013

2012

Delay Management with Rerouting of Passengers.

[BibT_eX]

[DOI]

Transp. Sci., 2012

Line planning in public transportation: models and methods.

[BibT_eX]

[DOI]

OR Spectr., 2012

Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances.

[BibT_eX]

[DOI]

Inf. Sci., 2012

Minsum hyperspheres in normed spaces.

[BibT_eX]

[DOI]

Horst Martini

Discret. Appl. Math., 2012

2011

Geometric fit of a point set by generalized circles.

[BibT_eX]

[DOI]

J. Glob. Optim., 2011

An approximation algorithm for convex multi-objective programming problems.

[BibT_eX]

[DOI]

Matthias Ehrgott

Lizhen Shao

J. Glob. Optim., 2011

A global optimization procedure for the location of a median line in the three-dimensional space.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2011

Locating a general minisum 'circle' on the plane.

[BibT_eX]

[DOI]

4OR, 2011

Engineering the Modulo Network Simplex Heuristic for the Periodic Timetabling Problem.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

A Scenario-Based Approach for Robust Linear Optimization.

[BibT_eX]

[DOI]

Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011

The Price of Robustness in Timetable Information.

[BibT_eX]

[DOI]

Martin Knoth

Proceedings of the ATMOS 2011, 2011

Delay Management including Capacities of Stations.

[BibT_eX]

[DOI]

Twan Dollevoet

Proceedings of the ATMOS 2011, 2011

2010

To Wait or Not to Wait - And Who Goes First? Delay Management with Priority Decisions.

[BibT_eX]

[DOI]

Michael Schachtebeck

Transp. Sci., 2010

The theoretical and empirical rate of convergence for geometric branch-and-bound methods.

[BibT_eX]

[DOI]

Daniel Scholz

J. Glob. Optim., 2010

Erratum to "Locating a minisum circle in the plane" [Discrete Appl. Math. 157 (5) (2009) 901-912].

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

The big cube small cube solution method for multidimensional facility location problems.

[BibT_eX]

[DOI]

Daniel Scholz

Comput. Oper. Res., 2010

Computing delay resistant railway timetables.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2010

The Complexity of Integrating Routing Decisions in Public Transportation Models.

[BibT_eX]

[DOI]

Proceedings of the ATMOS 2010, 2010

An Empirical Analysis of Robustness Concepts for Timetabling.

[BibT_eX]

[DOI]

Proceedings of the ATMOS 2010, 2010

Vertex Disjoint Paths for Dispatching in Railways.

[BibT_eX]

[DOI]

Proceedings of the ATMOS 2010, 2010

2009

A Bicriteria Approach for Robust Timetabling.

[BibT_eX]

[DOI]

Albrecht Kratz

Proceedings of the Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems, 2009

Recoverable Robustness in Shunting and Timetabling.

[BibT_eX]

[DOI]

Proceedings of the Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems, 2009

Capacity constraints in delay management.

[BibT_eX]

[DOI]

Public Transp., 2009

Integrating line planning, timetabling, and vehicle scheduling: a customer-oriented heuristic.

[BibT_eX]

[DOI]

Mathias Michaelis

Public Transp., 2009

Locating a minisum circle in the plane.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

The Continuous Stop Location Problem in Public Transportation Networks.

[BibT_eX]

[DOI]

Asia Pac. J. Oper. Res., 2009

General minisum circle location.

[BibT_eX]

[DOI]

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

Delay Management with Re-Routing of Passengers.

[BibT_eX]

[DOI]

Proceedings of the ATMOS 2009, 2009

2008

The path player game - A network game from the point of view of the network providers.

[BibT_eX]

[DOI]

Justo Puerto

Silvia Schwarze

Math. Methods Oper. Res., 2008

IP-based Techniques for Delay Management with Priority Decisions.

[BibT_eX]

[DOI]

Michael Schachtebeck

Proceedings of the ATMOS 2008, 2008

Dynamic Algorithms for Recoverable Robustness Problems.

[BibT_eX]

[DOI]

Proceedings of the ATMOS 2008, 2008

2007

To Wait or Not to Wait? The Bicriteria Delay Management Problem in Public Transportation.

[BibT_eX]

[DOI]

Andreas Ginkel

Transp. Sci., 2007

Locating a Circle on a Sphere.

[BibT_eX]

[DOI]

Oper. Res., 2007

2006

A Game-Theoretic Approach to Line Planning.

[BibT_eX]

[DOI]

Silvia Schwarze

Proceedings of the ATMOS 2006, 2006

Optimization in Public Transportation - Stop Location, Delay Management and Tariff Zone Design in a Public Transportation Network.

[BibT_eX]

[DOI]

Optimization and its applications 3, Springer, ISBN: 978-0-387-32896-6, 2006

2005

Locating Stops Along Bus or Railway Lines - A Bicriteria Problem.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2005

The Computational Complexity of Delay Management.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Dominance and Equilibria in the Path Player Game.

[BibT_eX]

[DOI]

Silvia Schwarze

Proceedings of the Operations Research Proceedings 2005, 2005

Line Planning with Minimal Traveling Time.

[BibT_eX]

[DOI]

Susanne Scholl

Proceedings of the 5th Workshop on Algorithmic Methods and Models for Optimization of Railways, 2005

Station Location - Complexity and Approximation.

[BibT_eX]

[DOI]

Steffen Mecke

Dorothea Wagner

Proceedings of the 5th Workshop on Algorithmic Methods and Models for Optimization of Railways, 2005

2004

Design of Zone Tariff Systems in Public Transportation.

[BibT_eX]

[DOI]

Horst W. Hamacher

Oper. Res., 2004

Continuous location of dimensional structures.

[BibT_eX]

[DOI]

José Miguel Díaz-Báñez

Juan A. Mesa

Eur. J. Oper. Res., 2004

Set covering with almost consecutive ones property.

[BibT_eX]

[DOI]

Nikolaus Ruf

Discret. Optim., 2004

Integer Programming Approaches for Solving the Delay Management Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Methods for Railway Optimization, 2004

2003

Anchored Hyperplane Location Problems.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2003

On Center Cycles in Grid Graphs.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2003

Properties of Three-Dimensional Median Line Location Models.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2003

2002

Linear Facility Location in Three Dimensions - Models and Solution Methods.

[BibT_eX]

[DOI]

Oper. Res., 2002

Covering Population Areas by Railway Stops.

[BibT_eX]

[DOI]

Michael Schröder

Proceedings of the Operations Research Proceedings 2002, 2002

2001

A Model for the Delay Management Problem based on Mixed-Integer-Programming.

[BibT_eX]

[DOI]

Proceedings of the Workshop on Algorithmic MeThods and Models for Optimization of RailwayS, 2001

Locating New Stops in a Railway Network.

[BibT_eX]

[DOI]

Proceedings of the Workshop on Algorithmic MeThods and Models for Optimization of RailwayS, 2001

Median and center hyperplanes in Minkowski spaces--a unified approach.

[BibT_eX]

[DOI]

Horst Martini

Discret. Math., 2001

1999

A Geometric Approach to Global Optimization.

[BibT_eX]

[DOI]

Stefan Nickel

J. Glob. Optim., 1999

Solving Restricted Line Location Problems via a Dual Interpretation.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1999

1998

Locating least-distant lines in the plane.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 1998

Median Hyperplanes in Normed Spaces - A Survey.

[BibT_eX]

[DOI]

Horst Martini

Discret. Appl. Math., 1998

1997

A note on center problems with forbidden polyhedra.

[BibT_eX]

[DOI]

Horst W. Hamacher