Pages that link to "Item:Q3980515"

The following pages link to Capacitated Vehicle Routing on Trees (Q3980515):

Displaying 33 items.

• Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
• The school bus problem on trees (Q378249) (← links)
• A new destructive bounding scheme for the bin packing problem (Q610978) (← links)
• An approximation algorithm for the pickup and delivery vehicle routing problem on trees (Q860395) (← links)
• New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation (Q868985) (← links)
• New bin packing fast lower bounds (Q883309) (← links)
• On the approximation of the generalized capacitated tree-routing problem (Q988692) (← links)
• Exploiting sparsity in pricing routines for the capacitated arc routing problem (Q1013413) (← links)
• Branch-and-bound algorithms for the multi-product assembly line balancing problem (Q1194733) (← links)
• BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem (Q1362971) (← links)
• Lower bounds for a bin packing problem with linear usage cost (Q1755229) (← links)
• An analysis of lower bound procedures for the bin packing problem (Q1886845) (← links)
• The split delivery vehicle scheduling problem with time windows and grid network distances (Q1892675) (← links)
• Routing problems: A bibliography (Q1908308) (← links)
• Bin packing problem with conflicts and item fragmentation (Q2026980) (← links)
• Approximation algorithms for the load-balanced capacitated vehicle routing problem (Q2043586) (← links)
• Capacitated vehicle routing problem on line with unsplittable demands (Q2082210) (← links)
• Packing-based branch-and-bound for discrete malleable task scheduling (Q2093190) (← links)
• A tight approximation algorithm for multi-vehicle CVRP with unsplittable demands on a line (Q2109294) (← links)
• A fast \((2 + \frac{2}{7})\)-approximation algorithm for capacitated cycle covering (Q2118143) (← links)
• Improved approximations for capacitated vehicle routing with unsplittable client demands (Q2164702) (← links)
• Improved approximation algorithms for cumulative VRP with stochastic demands (Q2181250) (← links)
• An analytical bound on the fleet size in vehicle routing problems: a dynamic programming approach (Q2183219) (← links)
• SALSA: combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing (Q2242373) (← links)
• A three-dimensional bin-packing model: exact multicriteria solution and computational complexity (Q2404356) (← links)
• State-of-the-art exact and heuristic solution procedures for simple assembly line balancing (Q2569059) (← links)
• Computing the asymptotic worst-case of bin packing lower bounds (Q2643960) (← links)
• Approximation Algorithms for Cumulative VRP with Stochastic Demands (Q2795944) (← links)
• Approximation algorithms for distance constrained vehicle routing problems (Q2892157) (← links)
• The preemptive swapping problem on a tree (Q3100688) (← links)
• Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand (Q3105744) (← links)
• Balancing profits and costs on trees (Q5326788) (← links)
• Minimizing the maximum flow time in the online food delivery problem (Q6130315) (← links)