Pages that link to "Item:Q892384"
From MaRDI portal
The following pages link to A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows (Q892384):
Displaying 14 items.
- Thirty years of heterogeneous vehicle routing (Q320861) (← links)
- Modeling and solving profitable location and distribution problems (Q375987) (← links)
- Relaxation heuristics for the set multicover problem with generalized upper bound constraints (Q1652583) (← links)
- Exact solutions for the collaborative pickup and delivery problem (Q1787916) (← links)
- A grouping genetic algorithm for multi depot pickup and delivery problems with time windows and heterogeneous vehicle fleets (Q2057127) (← links)
- Design of a heuristic algorithm for the generalized multi-objective set covering problem (Q2149956) (← links)
- Optimal logistics strategy to distribute medicines in clinics and hospitals (Q2311185) (← links)
- A branch-and-cut-and-price algorithm for the multi-trip separate pickup and delivery problem with time windows at customers and facilities (Q2315637) (← links)
- The team orienteering pick-up and delivery problem with time windows and its applications in fleet sizing (Q2826662) (← links)
- Verification of Correctness of Parallel Algorithms in Practice (Q4609778) (← links)
- Iterative Column Generation Algorithm for Generalized Multi-Vehicle Covering Tour Problem (Q4689379) (← links)
- Branch-and-Price Approaches for Real-Time Vehicle Routing with Picking, Loading, and Soft Time Windows (Q5106417) (← links)
- Modeling and Solving Vehicle Routing Problems with Many Available Vehicle Types (Q5270509) (← links)
- Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem (Q6106496) (← links)
