Pages that link to "Item:Q3057116"
From MaRDI portal
The following pages link to A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem (Q3057116):
Displaying 22 items.
- Thirty years of heterogeneous vehicle routing (Q320861) (← links)
- Orienteering problem: a survey of recent variants, solution approaches and applications (Q323527) (← links)
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems (Q621754) (← links)
- Exact algorithms for routing problems under vehicle capacity constraints (Q970191) (← links)
- Improved lower bounds for the split delivery vehicle routing problem (Q991469) (← links)
- Task assignment with start time-dependent processing times for personnel at check-in counters (Q1617296) (← links)
- Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
- Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems (Q1651704) (← links)
- Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem (Q1703462) (← links)
- A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet (Q1730643) (← links)
- Solving the team orienteering arc routing problem with a column generation approach (Q1754007) (← links)
- A hybrid algorithm for the heterogeneous fleet vehicle routing problem (Q1926856) (← links)
- The time dependent traveling salesman problem: polyhedra and algorithm (Q1947199) (← links)
- Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints (Q2256169) (← links)
- An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem (Q2337401) (← links)
- Improved branch-cut-and-price for capacitated vehicle routing (Q2398107) (← links)
- A hybrid adaptive large neighborhood search heuristic for the team orienteering problem (Q2664363) (← links)
- A POPMUSIC matheuristic for the capacitated vehicle routing problem (Q2669570) (← links)
- Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments (Q2811328) (← links)
- New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows (Q4599317) (← links)
- An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems (Q5139849) (← links)
- A branch‐and‐price‐and‐cut algorithm for the truck‐drone routing problem with simultaneously delivery and pickup (Q6150242) (← links)
