Pages that link to "Item:Q948965"
From MaRDI portal
The following pages link to An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts (Q948965):
Displaying 50 items.
- All-integer column generation for set partitioning: basic principles and extensions (Q296975) (← links)
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem (Q319445) (← links)
- A hybrid approach for the vehicle routing problem with three-dimensional loading constraints (Q336326) (← links)
- Minimum cost VRP with time-dependent speed data and congestion charge (Q337447) (← links)
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints (Q439444) (← links)
- Routing problems with loading constraints (Q610992) (← links)
- Heuristic and exact algorithms for a min-max selective vehicle routing problem (Q622161) (← links)
- Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem (Q633484) (← links)
- Recent advances in vehicle routing exact algorithms (Q926561) (← links)
- Exact algorithms for routing problems under vehicle capacity constraints (Q970191) (← links)
- An exact solution framework for a broad class of vehicle routing problems (Q993700) (← links)
- Managing platelet supply through improved routing of blood collection vehicles (Q1651648) (← links)
- Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems (Q1651704) (← links)
- The vehicle routing problem with service level constraints (Q1681277) (← links)
- Optimally solving the joint order batching and picker routing problem (Q1683118) (← links)
- Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs (Q1695015) (← links)
- New benchmark instances for the capacitated vehicle routing problem (Q1752871) (← links)
- The demand weighted vehicle routing problem (Q1754023) (← links)
- Modelling transfer line design problem via a set partitioning problem (Q1758032) (← links)
- A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints (Q1761159) (← links)
- A computational comparison of flow formulations for the capacitated location-routing problem (Q1799384) (← links)
- The close-open mixed vehicle routing problem (Q1926744) (← links)
- A hybrid algorithm for the heterogeneous fleet vehicle routing problem (Q1926856) (← links)
- Improved lower bounds and exact algorithm for the capacitated arc routing problem (Q1942278) (← links)
- The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time (Q1991101) (← links)
- A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints (Q2010923) (← links)
- A lower bound for the adaptive two-echelon capacitated vehicle routing problem (Q2012880) (← links)
- Avoiding redundant columns by adding classical Benders cuts to column generation subproblems (Q2019426) (← links)
- Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning (Q2028802) (← links)
- Solving bin packing problems using VRPSolver models (Q2033390) (← links)
- Solving the time-discrete winter runway scheduling problem: a column generation and constraint programming approach (Q2077940) (← links)
- Two-echelon vehicle routing problems: a literature review (Q2079391) (← links)
- Robust drone selective routing in humanitarian transportation network assessment (Q2083969) (← links)
- Robust vehicle routing under uncertainty via branch-price-and-cut (Q2101653) (← links)
- A unified exact approach for clustered and generalized vehicle routing problems (Q2108132) (← links)
- The arc-item-load and related formulations for the cumulative vehicle routing problem (Q2172084) (← links)
- On the exact solution of vehicle routing problems with backhauls (Q2189917) (← links)
- An integrated bi-objective optimization model and improved genetic algorithm for vehicle routing problems with temporal and spatial constraints (Q2190260) (← links)
- A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
- Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints (Q2256169) (← links)
- Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems (Q2294623) (← links)
- An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem (Q2337401) (← links)
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints (Q2339816) (← links)
- A branch-and-cut algorithm for the capacitated profitable tour problem (Q2339836) (← links)
- A compact transformation of arc routing problems into node routing problems (Q2341211) (← links)
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
- A heuristic for cumulative vehicle routing using column generation (Q2357169) (← links)
- A unified exact method for solving different classes of vehicle routing problems (Q2390996) (← links)
- Improved branch-cut-and-price for capacitated vehicle routing (Q2398107) (← links)
- An integer optimality condition for column generation on zero-one linear programs (Q2419361) (← links)
