Pages that link to "Item:Q2490341"

The following pages link to Formulations and valid inequalities for the heterogeneous vehicle routing problem (Q2490341):

Displaying 26 items.

• Thirty years of heterogeneous vehicle routing (Q320861) (← links)
• The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation (Q337237) (← links)
• Exact algorithms for routing problems under vehicle capacity constraints (Q970191) (← links)
• Industrial aspects and literature survey: fleet composition and routing (Q991360) (← links)
• A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem (Q1014948) (← links)
• Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems (Q1651704) (← links)
• Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems (Q1694814) (← links)
• Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem (Q1703462) (← links)
• A skewed general variable neighborhood search algorithm with fixed threshold for the heterogeneous fleet vehicle routing problem (Q1730626) (← links)
• A hybrid algorithm for the heterogeneous fleet vehicle routing problem (Q1926856) (← links)
• Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network (Q1991177) (← links)
• The multi-zone location-routing problem with pricing: a flow-based formulation and two heuristic approaches (Q2156989) (← links)
• Vehicle routing for milk collection with gradual blending: a case arising in Chile (Q2160533) (← links)
• A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem (Q2378413) (← links)
• A unified exact method for solving different classes of vehicle routing problems (Q2390996) (← links)
• Requiem for the Miller-Tucker-Zemlin subtour elimination constraints? (Q2514734) (← links)
• The electric location-routing problem with heterogeneous fleet: formulation and Benders decomposition approach (Q2668681) (← links)
• Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments (Q2811328) (← 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)
• Mathematical Models and Search Algorithms for the Capacitated <i>p</i>-Center Problem (Q3386776) (← links)
• Robust Optimization of a Broad Class of Heterogeneous Vehicle Routing Problems Under Demand Uncertainty (Q3386790) (← links)
• Routing a Heterogeneous Fleet of Vehicles (Q3564347) (← links)
• Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems (Q3564362) (← links)
• Lifting for the integer knapsack cover polyhedron (Q6102182) (← links)
• The capacitated family traveling salesperson problem (Q6195021) (← links)