Pages that link to "Item:Q2811328"
From MaRDI portal
The following pages link to Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments (Q2811328):
Displaying 10 items.
- Solving the truck and trailer routing problem based on a simulated annealing heuristic (Q959516) (← links)
- Daily aircraft routing for amphibious ready groups (Q1639311) (← links)
- Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows (Q1652285) (← links)
- The line-haul feeder vehicle routing problem: mathematical model formulation and heuristic approaches (Q1754738) (← links)
- Column generation for vehicle routing problems with multiple synchronization constraints (Q1991183) (← links)
- Approximation of the capacitated vehicle routing problem with a limited number of routes in metric spaces of fixed doubling dimension (Q2048811) (← links)
- Vehicle routing with transportable resources: using carpooling and walking for on-site services (Q2315653) (← links)
- A Time-Indexed Generalized Vehicle Routing Model and Stabilized Column Generation for Military Aircraft Mission Planning (Q5270519) (← links)
- Optimization of two-echelon last-mile delivery via cargo tunnel and a delivery person (Q6164323) (← links)
- Synchronisation in vehicle routing: classification schema, modelling framework and literature review (Q6555167) (← links)
