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 35 items.
- Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows (Q320995) (← links)
- Multiobjective vehicle routing problem with fixed delivery and optional collections (Q375980) (← links)
- Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery (Q376001) (← links)
- Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery (Q408394) (← links)
- Admission policies for the customized stochastic lot scheduling problem with strict due-dates (Q545109) (← links)
- Heuristic and exact algorithms for a min-max selective vehicle routing problem (Q622161) (← links)
- A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows (Q892384) (← links)
- An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles (Q1040998) (← links)
- A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints (Q1198141) (← links)
- A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen (Q1617109) (← links)
- The bi-objective insular traveling salesman problem with maritime and ground transportation costs (Q1653384) (← links)
- A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands (Q1730662) (← 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)
- A new branching strategy for time constrained routing problems with application to backhauling (Q1908295) (← links)
- A branch-and-price algorithm for a vehicle routing with demand allocation problem (Q1991157) (← links)
- Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows (Q2147164) (← links)
- A branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution system (Q2160517) (← links)
- Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach (Q2184040) (← links)
- Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network (Q2197321) (← links)
- Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints (Q2256169) (← 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)
- A branch-and-price-and-check model for the vehicle routing problem with location congestion (Q2398439) (← links)
- The single vehicle routing problem with deliveries and selective pickups (Q2475847) (← links)
- A branch-and-price algorithm for a routing problem with inbound and outbound requests (Q2676292) (← links)
- A survey of resource constrained shortest path problems: exact solution approaches (Q2811308) (← links)
- The team orienteering pick-up and delivery problem with time windows and its applications in fleet sizing (Q2826662) (← links)
- An Exact Algorithm for the Pickup and Delivery Problem with Time Windows (Q3098764) (← links)
- Non-Elementary Formulations for Single Vehicle Routing Problems with Pickups and Deliveries (Q4602474) (← 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)
- Branch and price algorithm for route optimization on customized bus service (Q6546992) (← links)
