Pages that link to "Item:Q1751767"

The following pages link to The traveling purchaser problem and its variants (Q1751767):

Displaying 13 items.

• The bi-objective traveling purchaser problem with deliveries (Q1622816) (← links)
• A stochastic programming model for a tactical solid waste management problem (Q1622822) (← links)
• New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty (Q1628038) (← links)
• The bi-objective insular traveling salesman problem with maritime and ground transportation costs (Q1653384) (← links)
• A generalized bin packing problem for parcel delivery in last-mile logistics (Q1755394) (← links)
• Prioritized single nurse routing and scheduling for home healthcare services (Q2029260) (← links)
• A tailored Benders decomposition approach for last-mile delivery with autonomous robots (Q2077920) (← links)
• Parameterized algorithms and complexity for the traveling purchaser problem and its variants (Q2084609) (← links)
• A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand (Q2208355) (← links)
• The traveling purchaser problem with fast service option (Q2669765) (← links)
• A quick method to compute sparse graphs for traveling salesman problem using random frequency quadrilaterals (Q5024637) (← links)
• Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand (Q6056092) (← links)
• A GRASP/Path‐Relinking algorithm for the traveling purchaser problem (Q6056165) (← links)