Pages that link to "Item:Q1652283"
From MaRDI portal
The following pages link to An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen (Q1652283):
Displaying 17 items.
- A new approach for solution of vehicle routing problem with hard time window: an application in a supermarket chain (Q1637720) (← links)
- Designing a sustainable supply chain network integrated with vehicle routing: a comparison of hybrid swarm intelligence metaheuristics (Q2002867) (← links)
- Models and algorithms for the delivery and installation routing problem (Q2029957) (← links)
- The vehicle allocation problem: alternative formulation and branch-and-price method (Q2147070) (← links)
- An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots (Q2240065) (← links)
- Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products (Q2286968) (← links)
- A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem (Q2289918) (← links)
- Robust optimization for the vehicle routing problem with multiple deliverymen (Q2323425) (← links)
- Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen (Q2664412) (← links)
- A branch-and-price algorithm for nanosatellite task scheduling to improve mission quality-of-service (Q2673569) (← links)
- Robust Team Orienteering Problem with Decreasing Profits (Q5060796) (← links)
- Improving energy aware nanosatellite task scheduling by a branch-cut-and-price algorithm (Q6106600) (← links)
- The paired mail carrier problem (Q6112565) (← links)
- An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands (Q6167539) (← links)
- A hybrid mathematical model for flying sidekick travelling salesman problem with time windows (Q6200792) (← links)
- Branch-and-price based heuristic algorithm for fuzzy multi-depot bus scheduling problem (Q6535293) (← links)
- An exact method for a last-mile delivery routing problem with multiple deliverymen (Q6572895) (← links)
