Pages that link to "Item:Q834971"

The following pages link to Exact algorithms for the minimum latency problem (Q834971):

Displaying 12 items.

• Heuristics for the traveling repairman problem with profits (Q336352) (← links)
• The delivery man problem with time windows (Q429673) (← links)
• Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem (Q548680) (← links)
• Profit-based latency problems on the line (Q943793) (← links)
• An effective memetic algorithm for the cumulative capacitated vehicle routing problem (Q975996) (← links)
• A new formulation for the traveling deliveryman problem (Q1003469) (← links)
• The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach (Q1926737) (← links)
• A simple and effective metaheuristic for the minimum latency problem (Q1926884) (← links)
• Variable neighborhood search for the travelling deliveryman problem (Q1942008) (← links)
• Solving the traveling repairman problem with profits: a novel variable neighborhood search approach (Q1999008) (← links)
• A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (Q2514732) (← links)
• An efficient two-phase metaheuristic algorithm for the time dependent traveling Salesman problem (Q5242274) (← links)