Pages that link to "Item:Q585095"
From MaRDI portal
The following pages link to A branch and bound algorithm for the capacitated vehicle routing problem (Q585095):
Displaying 38 items.
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem (Q319445) (← links)
- The vehicle routing problem with demand range (Q867541) (← links)
- A mixed constrained (identical) vehicle routing problem for time minimisation (Q998682) (← links)
- A cutting plane procedure for the travelling salesman problem on road networks (Q1072449) (← links)
- Polyhedral results for a vehicle routing problem (Q1176821) (← links)
- Vehicle routing with split deliveries (Q1327209) (← links)
- Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems (Q1651704) (← links)
- A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints (Q1754109) (← links)
- Stronger \(K\)-tree relaxations for the vehicle routing problem (Q1827647) (← links)
- A compact model and tight bounds for a combined location-routing problem (Q1886846) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time (Q1991101) (← links)
- Encoding binary arithmetic operations in integer programming formulations (Q2016465) (← links)
- Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning (Q2028802) (← links)
- Strong cuts from compatibility relations for the dial-a-ride problem (Q2065792) (← links)
- Capacitated vehicle routing problem on line with unsplittable demands (Q2082210) (← 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)
- An overview of graph covering and partitioning (Q2142633) (← links)
- A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
- An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem (Q2337401) (← links)
- A compact transformation of arc routing problems into node routing problems (Q2341211) (← links)
- Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots (Q2427108) (← links)
- A new mixed integer linear model for a rich vehicle routing problem with docking constraints (Q2430607) (← links)
- Solving an urban waste collection problem using ants heuristics (Q2475858) (← links)
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem (Q2492675) (← links)
- Projection results for vehicle routing (Q2583125) (← links)
- Routing and scheduling field service operation by P-graph (Q2669568) (← links)
- A POPMUSIC matheuristic for the capacitated vehicle routing problem (Q2669570) (← links)
- An improved formulation for the inventory routing problem with time-varying demands (Q2672144) (← links)
- A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (Q2688881) (← links)
- A SCATTER SEARCH FOR MULTI-DEPOT VEHICLE ROUTING PROBLEM WITH WEIGHT-RELATED COST (Q3013562) (← links)
- New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows (Q4599317) (← links)
- A branch-and-cut embedded matheuristic for the inventory routing problem (Q6047912) (← links)
- Estimating the marginal cost to deliver to individual customers (Q6088526) (← links)
- The two-echelon stochastic multi-period capacitated location-routing problem (Q6106489) (← links)
- Planning robust drone-truck delivery routes under road traffic uncertainty (Q6112843) (← links)
- Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem (Q6180050) (← links)