The following pages link to Verena Schmid (Q246501):
Displaying 12 items.
- Hybrid large neighborhood search for the bus rapid transit route design problem (Q296775) (← links)
- Hybrid column generation and large neighborhood search for the dial-a-ride problem (Q339608) (← links)
- A large neighbourhood based heuristic for two-echelon routing problems (Q342576) (← links)
- Ambulance location and relocation problems with time-dependent travel times (Q613443) (← links)
- Integrated timetabling and vehicle scheduling with balanced departure times (Q747749) (← links)
- Hybridization of very large neighborhood search for ready-mixed concrete delivery problems (Q1038296) (← links)
- An effective large neighborhood search for the team orienteering problem with time windows (Q1691647) (← links)
- Variable neighbourhood search for the variable sized bin packing problem (Q1762087) (← links)
- Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming (Q1926680) (← links)
- Rich routing problems arising in supply chain management (Q2253448) (← links)
- Variable neighborhood search for the stochastic and dynamic vehicle routing problem (Q5963105) (← links)
- Dynamic assignment of a multi-skilled workforce in job shops: an approximate dynamic programming approach (Q6106764) (← links)
