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):
Displayed 30 items.
- 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)
- The pyramidal capacitated vehicle routing problem (Q2270294) (← links)
- A memetic algorithm with dynamic population management for an integrated production-distribution problem (Q2378412) (← links)
- A unified exact method for solving different classes of vehicle routing problems (Q2390996) (← links)
- Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation (Q2465657) (← links)
- A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands (Q2467454) (← links)
- A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem (Q3057116) (← links)
- Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs (Q3057117) (← links)
- Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
- Column Generation Algorithms for the Capacitated m-Ring-Star Problem (Q3511375) (← links)
- An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems (Q3564361) (← links)
- Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems (Q3564362) (← links)
- Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows (Q3564367) (← links)
- Combinatorial optimization and green logistics (Q5900891) (← links)
- Combinatorial optimization and green logistics (Q5925286) (← links)