The following pages link to Ralf Borndörfer (Q210497):
Displaying 50 items.
- On the path avoiding forbidden pairs polytope (Q324839) (← links)
- An extended network interdiction problem for optimal toll control (Q325471) (← links)
- Optimizing the simplon railway corridor (Q475174) (← links)
- Robust allocation of operating rooms: a cutting plane approach to handle lognormal case durations (Q724114) (← links)
- (Q1383120) (redirect page) (← links)
- Frequency assignment in cellular phone networks (Q1383122) (← links)
- Set packing relaxations of some integer programs (Q1587935) (← links)
- Hall's and Kőnig's theorem in graphs and hypergraphs (Q1660258) (← links)
- The graph segmentation problem (Q1742196) (← links)
- Metric inequalities for routings on direct connections with application to line planning (Q1751129) (← links)
- Models for fare planning in public transport (Q1759833) (← links)
- A set partitioning approach to shunting (Q1759839) (← links)
- Train rotation optimization (Q2086332) (← links)
- Separation of cycle inequalities in periodic timetabling (Q2299981) (← links)
- The hypergraph assignment problem (Q2339846) (← links)
- Fair ticket pricing in public transport as a constrained cost allocation game (Q2341202) (← links)
- Optimal duty rostering for toll enforcement inspectors (Q2398431) (← links)
- The Steiner connectivity problem (Q2434988) (← links)
- An improved multiobjective shortest path algorithm (Q2669519) (← links)
- An Approximation Result for Matchings in Partitioned Hypergraphs (Q2806888) (← links)
- The Cycle Embedding Problem (Q2806986) (← links)
- PolySCIP (Q2819226) (← links)
- A Set Partitioning Approach to Shunting (Q2840563) (← links)
- A Stackelberg Game to Optimize the Distribution of Controls in Transportation Networks (Q2840937) (← links)
- A Hypergraph Model for Railway Vehicle Rotation Planning (Q2917269) (← links)
- Railway track allocation by rapid branching (Q2917283) (← links)
- Line Planning on Paths and Tree Networks with Applications to the Quito Trolebús System (Q2917355) (← links)
- Models for Railway Track Allocation (Q2917369) (← links)
- A Direct Connection Approach to Integrated Line Planning and Passenger Routing (Q2918961) (← links)
- Planning Problems in Public Transit (Q3064910) (← links)
- (Q3416571) (← links)
- (Q3416575) (← links)
- (Q3416594) (← links)
- (Q3525409) (← links)
- (Q3525436) (← links)
- Balancing Efficiency and Robustness – A Bi-criteria Optimization Approach to Railway Track Allocation (Q3556546) (← links)
- Decomposing Matrices into Blocks (Q4229489) (← links)
- (Q4384127) (← links)
- (Q4450520) (← links)
- Network spot‐checking games: Theory and application to toll enforcing in transportation networks (Q4565763) (← links)
- The Modulo Network Simplex with Integrated Passenger Routing (Q4596525) (← links)
- Separation of Cycle Inequalities for the Periodic Timetabling Problem (Q4606290) (← links)
- On Finding Subpaths With High Demand (Q4685775) (← links)
- Demand-Driven Line Planning with Selfish Routing (Q4685844) (← links)
- Timetable Sparsification by Rolling Stock Rotation Optimization (Q4685854) (← links)
- An approximation algorithm for the Steiner connectivity problem (Q4686669) (← links)
- (Q4699387) (← links)
- Line planning on tree networks with applications to the Quito Trolebús system (Q4910665) (← links)
- (Q4950119) (← links)
- Minimum Cost Hyperassignments with Applications to ICE/IC Rotation Planning (Q5176281) (← links)
