The following pages link to Anita Schöbel (Q178535):
Displaying 50 items.
- Timetabling with passenger routing (Q2260893) (← links)
- The relationship between multi-objective robustness concepts and set-valued optimization (Q2264185) (← links)
- Approximate cutting plane approaches for exact solutions to robust optimization problems (Q2301927) (← links)
- Locating a median line with partial coverage distance (Q2349526) (← links)
- Set covering with almost consecutive ones property (Q2386204) (← links)
- Mathematics in biology (Q2434721) (← links)
- When is rounding allowed in integer nonlinear optimization? (Q2514870) (← links)
- Twins of powerful numbers (Q2637428) (← links)
- On the \(p\)-hub interdiction problem (Q2664408) (← links)
- Hub location problems in urban traffic networks (Q2776481) (← links)
- A unified approach for different concepts of robustness and stochastic programming via non-linear scalarizing functionals (Q2841149) (← links)
- The price of robustness in timetable information (Q2917261) (← links)
- Delay management including capacities of stations (Q2917262) (← links)
- Vertex disjoint paths for dispatching in railways (Q2917287) (← links)
- An empirical analysis of robustness concepts for timetabling (Q2917293) (← links)
- The complexity of integrating routing decisions in public transportation models (Q2917296) (← links)
- Delay management with re-routing of passengers (Q2917323) (← links)
- IP-based techniques for delay management with priority decisions (Q2917358) (← links)
- Dynamic algorithms for recoverable robustness problems (Q2917363) (← links)
- A game-theoretic approach to line planning (Q2917398) (← links)
- Line planning with minimal traveling time (Q2917410) (← links)
- Station location -- complexity and approximation (Q2917411) (← links)
- Ellipsoid Bounds for Convex Quadratic Integer Programming (Q2954394) (← links)
- A Scenario-Based Approach for Robust Linear Optimization (Q2999341) (← links)
- (Q3147656) (← links)
- Locating a Circle on a Sphere (Q3392112) (← links)
- (Q3404170) (← links)
- (Q3416584) (← links)
- THE CONTINUOUS STOP LOCATION PROBLEM IN PUBLIC TRANSPORTATION NETWORKS (Q3632030) (← links)
- Linear Facility Location in Three Dimensions—Models and Solution Methods (Q3635162) (← links)
- Recoverable Robustness in Shunting and Timetabling (Q3649158) (← links)
- A Bicriteria Approach for Robust Timetabling (Q3649162) (← links)
- (Q4254951) (← links)
- (Q4352989) (← links)
- (Q4359761) (← links)
- Selecting vertex disjoint paths in plane graphs (Q4642445) (← links)
- The complexity of integrating passenger routing decisions in public transportation models (Q4642454) (← links)
- Extensions of labeling algorithms for multi‐objective uncertain shortest path problems (Q4687213) (← links)
- (Q4836313) (← links)
- (Q4889085) (← links)
- Competitive Analysis for Multi-objective Online Algorithms (Q5176585) (← links)
- A Matching Approach for Periodic Timetabling (Q5240219) (← links)
- Integrating Passengers' Routes in Periodic Timetabling: A SAT approach. (Q5240221) (← links)
- (Q5301729) (← links)
- Design of Zone Tariff Systems in Public Transportation (Q5322005) (← links)
- Recoverable Robust Timetable Information (Q5397837) (← links)
- The Stop Location Problem with Realistic Traveling Time (Q5397846) (← links)
- Approximation Algorithms for the Weight-Reducible Knapsack Problem (Q5410644) (← links)
- The Travelers Route Choice Problem Under Uncertainty: Dominance Relations Between Strategies (Q5739121) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897558) (← links)
