Pages that link to "Item:Q2492675"
From MaRDI portal
The following pages link to Robust branch-and-cut-and-price for the capacitated vehicle routing problem (Q2492675):
Displaying 50 items.
- Efficient elementary and restricted non-elementary route pricing (Q297071) (← 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)
- Improved bounds for large scale capacitated arc routing problem (Q336459) (← links)
- A hybrid algorithm for a class of vehicle routing problems (Q336559) (← links)
- A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands (Q337090) (← links)
- Exact algorithms for the double vehicle routing problem with multiple stacks (Q342039) (← links)
- Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem (Q375997) (← links)
- Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery (Q376001) (← links)
- Single vehicle routing problems with a predefined customer sequence, compartmentalized load and stochastic demands (Q439377) (← links)
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints (Q439444) (← links)
- Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW (Q439557) (← links)
- Exact hybrid algorithms for solving a bi-objective vehicle routing problem (Q441036) (← links)
- A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand (Q519091) (← links)
- Routing problems with loading constraints (Q610992) (← links)
- Comments on: Routing Problems with loading constraints (Q610994) (← links)
- A note on branch-and-cut-and-price (Q613321) (← links)
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems (Q621754) (← links)
- Heuristic and exact algorithms for a min-max selective vehicle routing problem (Q622161) (← links)
- A library of local search heuristics for the vehicle routing problem (Q708775) (← links)
- Recent advances in vehicle routing exact algorithms (Q926561) (← links)
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts (Q948965) (← links)
- Combined route capacity and route length models for unit demand vehicle routing problems (Q951110) (← links)
- EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem (Q953302) (← links)
- Exact algorithms for routing problems under vehicle capacity constraints (Q970191) (← links)
- Improved lower bounds for the split delivery vehicle routing problem (Q991469) (← links)
- An exact solution framework for a broad class of vehicle routing problems (Q993700) (← links)
- Developing work schedules for an inter-city transit system with multiple driver types and fleet types (Q1011229) (← links)
- Exploiting sparsity in pricing routines for the capacitated arc routing problem (Q1013413) (← links)
- A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands (Q1043246) (← links)
- A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen (Q1617109) (← 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)
- Vehicle routing with probabilistic capacity constraints (Q1651706) (← links)
- The vehicle routing problem with service level constraints (Q1681277) (← links)
- Optimally solving the joint order batching and picker routing problem (Q1683118) (← links)
- Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems (Q1694814) (← links)
- Optimization of vehicle routing with pickup based on multibatch production (Q1727038) (← links)
- Limited memory rank-1 cuts for vehicle routing problems (Q1728212) (← links)
- A stochastic reverse logistics production routing model with environmental considerations (Q1730592) (← links)
- An efficient computational method for large scale surgery scheduling problems with chance constraints (Q1744896) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- New benchmark instances for the capacitated vehicle routing problem (Q1752871) (← links)
- Solving the team orienteering arc routing problem with a column generation approach (Q1754007) (← links)
- The demand weighted vehicle routing problem (Q1754023) (← links)
- A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints (Q1754109) (← links)
- A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem (Q1759849) (← 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)
- Exact algorithms for the chance-constrained vehicle routing problem (Q1800993) (← links)
