The following pages link to Timo Gschwind (Q319922):
Displaying 16 items.
- A comparison of column-generation approaches to the synchronized pickup and delivery problem (Q319923) (← links)
- A note on symmetry reduction for circular traveling tournament problems (Q531484) (← links)
- Stabilized branch-and-price algorithms for vector packing problems (Q724108) (← links)
- Maximum weight relaxed cliques and Russian doll search revisited (Q1686057) (← links)
- Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster (Q1753599) (← links)
- Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems (Q1754114) (← links)
- The pickup and delivery problem with time windows, multiple stacks, and handling operations (Q2140213) (← links)
- Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network (Q2197321) (← links)
- Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities (Q2362175) (← links)
- Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier (Q2422737) (← links)
- Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem (Q2424767) (← links)
- Dual Inequalities for Stabilized Column Generation Revisited (Q2806874) (← links)
- A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques (Q5085477) (← links)
- Resource-Window Reduction by Reduced Costs in Path-Based Formulations for Routing and Scheduling Problems (Q6202345) (← links)
- Route feasibility testing and forward time slack for the Synchronized Pickup and Delivery Problem (Q6483634) (← links)
- Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff (Q6667800) (← links)
