Pages that link to "Item:Q635160"
From MaRDI portal
The following pages link to Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model (Q635160):
Displayed 26 items.
- Rich vehicle routing problems: from a taxonomy to a definition (Q299767) (← links)
- Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows (Q320995) (← links)
- Using the primal-dual interior point algorithm within the branch-price-and-cut method (Q336429) (← links)
- A tabu search algorithm for the multi-period inspector scheduling problem (Q337536) (← links)
- Skewed general variable neighborhood search for the location routing scheduling problem (Q337608) (← links)
- A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration (Q483728) (← links)
- Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
- The multiple trip vehicle routing problem with backhauls: formulation and a two-level variable neighbourhood search (Q1652112) (← links)
- Column generation based approaches for combined routing and scheduling (Q1742215) (← links)
- Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints (Q1751662) (← links)
- Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization (Q2029254) (← links)
- Multi-trip time-dependent vehicle routing problem with time windows (Q2029965) (← links)
- Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
- A mixed-integer linear programming model for optimal vessel scheduling in offshore oil and gas operations (Q2411169) (← links)
- Solving network design problems via iterative aggregation (Q2516352) (← links)
- An exact framework for the discrete parallel machine scheduling location problem (Q2668759) (← links)
- New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem (Q2669599) (← links)
- Multi-trip vehicle routing problem with order release time (Q5059403) (← links)
- An Exact Solution Framework for Multitrip Vehicle-Routing Problems with Time Windows (Q5130490) (← links)
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems (Q5139850) (← links)
- Оптимальное планирование пассажирских перевозок в региональной авиатранспортной сети (Q5141814) (← links)
- Vehicle routing problems with multiple trips (Q5890960) (← links)
- Vehicle routing problems with multiple trips (Q5915965) (← links)
- A two‐tier urban delivery network with robot‐based deliveries (Q6065839) (← links)
- An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem (Q6066724) (← links)
- Solving vehicle routing problems with intermediate stops using VRPSolver models (Q6179690) (← links)