Pages that link to "Item:Q406496"

The following pages link to A set-covering based heuristic algorithm for the periodic vehicle routing problem (Q406496):

Displaying 16 items.

• A-priori upper bounds for the set covering problem (Q271942) (← links)
• Consolidating home meal delivery with limited operational disruption (Q319069) (← links)
• An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen (Q1652283) (← links)
• The flexible periodic vehicle routing problem (Q1652351) (← links)
• Iterated local search and column generation to solve arc-routing as a permutation set-covering problem (Q1752200) (← links)
• Probabilistic time-dependent vehicle routing problem (Q1788926) (← links)
• Consistent vehicle routing problem with service level agreements: a case study in the pharmaceutical distribution sector (Q1991272) (← links)
• Exact solution methods for the multi-period vehicle routing problem with due dates (Q2002858) (← links)
• A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints (Q2010923) (← links)
• Set covering problem with conflict constraints (Q2147026) (← links)
• Column-generation based bounds for the homogeneous areas problem (Q2356280) (← links)
• A survey on matheuristics for routing problems (Q2513752) (← links)
• An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion (Q5057998) (← links)
• Primal Heuristics for Branch and Price: The Assets of Diving Methods (Q5138257) (← links)
• New Notation and Classification Scheme for Vehicle Routing Problems (Q5247680) (← links)
• Biased‐randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility (Q6066586) (← links)