Pages that link to "Item:Q723922"

The following pages link to Solving the family traveling salesman problem (Q723922):

Displaying 10 items.

• A covering traveling salesman problem with profit in the last mile delivery (Q2070135) (← links)
• A transformation technique for the clustered generalized traveling salesman problem with applications to logistics (Q2183848) (← links)
• Corrigendum to: ``Solving the family traveling salesman problem'' (Q2239977) (← links)
• Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems (Q2676463) (← links)
• Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule (Q6065592) (← links)
• The family traveling salesman problem with incompatibility constraints (Q6065853) (← links)
• Heuristic approaches for the family traveling salesman problem (Q6070420) (← links)
• The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods (Q6085888) (← links)
• An adaptive memory matheuristic for the set orienteering problem (Q6112827) (← links)
• The capacitated family traveling salesperson problem (Q6195021) (← links)