Pages that link to "Item:Q2242245"
From MaRDI portal
The following pages link to A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (Q2242245):
Displaying 3 items.
- Research on improved ant colony optimization for traveling salesman problem (Q2688415) (← 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)
