Pages that link to "Item:Q2242245"

The following pages link to A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (Q2242245):

Displaying 8 items.

• Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads (Q724007) (← links)
• Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (Q1652698) (← links)
• An exact algorithm for the Split-Demand One-Commodity Pickup-And-Delivery Travelling Salesman problem (Q1661892) (← links)
• A route decomposition approach for the single commodity split pickup and split delivery vehicle routing problem (Q2029263) (← links)
• Research on improved ant colony optimization for traveling salesman problem (Q2688415) (← links)
• A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs (Q6064162) (← links)
• A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem (Q6065616) (← links)
• A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints (Q6080619) (← links)