Pages that link to "Item:Q976316"
From MaRDI portal
The following pages link to A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows (Q976316):
Displaying 13 items.
- Multiobjective vehicle routing problem with fixed delivery and optional collections (Q375980) (← links)
- Admission policies for the customized stochastic lot scheduling problem with strict due-dates (Q545109) (← links)
- The bi-objective insular traveling salesman problem with maritime and ground transportation costs (Q1653384) (← links)
- Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach (Q1730665) (← links)
- Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem (Q1751783) (← links)
- Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach (Q2184040) (← links)
- Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints (Q2256169) (← links)
- A survey of resource constrained shortest path problems: Exact solution approaches (Q2811308) (← links)
- A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services (Q4634326) (← links)
- A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants (Q4995082) (← links)
- New Notation and Classification Scheme for Vehicle Routing Problems (Q5247680) (← links)
- Exact Approach for Integrated Delivery Optimization of E-Commerce and Online-to-Offline Parcels (Q6053530) (← links)
- A branch‐and‐price‐and‐cut algorithm for the truck‐drone routing problem with simultaneously delivery and pickup (Q6150242) (← links)
