The following pages link to Vera C. Hemmelmayr (Q319011):
Displaying 15 items.
- Sequential and parallel large neighborhood search algorithms for the periodic location routing problem (Q319012) (← links)
- Lower and upper bounds for the two-echelon capacitated location-routing problem (Q339668) (← links)
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics (Q339671) (← links)
- (Q406494) (redirect page) (← links)
- A set-covering based heuristic algorithm for the periodic vehicle routing problem (Q406496) (← links)
- (Q841584) (redirect page) (← links)
- Delivery strategies for blood products supplies (Q841585) (← links)
- Vendor managed inventory for environments with stochastic product usage (Q1040988) (← links)
- Variable neighbourhood search for the variable sized bin packing problem (Q1762087) (← links)
- Multi-objective optimization of a two-echelon vehicle routing problem with vehicle synchronization and `grey zone' customers arising in urban logistics (Q2029268) (← links)
- Integrated express shipment service network design with customer choice and endogenous delivery time restrictions (Q2239996) (← links)
- A variable neighborhood search heuristic for periodic routing problems (Q2378420) (← links)
- Synchronizing vans and cargo bikes in a city distribution network (Q2401319) (← links)
- A lexicographic maximin approach to the selective assessment routing problem (Q6103191) (← links)
- Transition towards sustainable mobility: the role of transport optimization (Q6558658) (← links)
