Pages that link to "Item:Q4018534"
From MaRDI portal
The following pages link to A Branch and Bound Algorithm for a Class of Asymmetrical Vehicle Routeing Problems (Q4018534):
Displaying 8 items.
- The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm (Q1083379) (← links)
- Generalized travelling salesman problem through n sets of nodes: The asymmetrical case (Q1096550) (← links)
- A heuristic algorithm for the asymmetric capacitated vehicle routing problem (Q1266654) (← links)
- A new subtour elimination constraint for the vehicle routing problem (Q1278251) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- New exact method for large asymmetric distance-constrained vehicle routing problem (Q2253580) (← links)
- An exact algorithm for the asymmetrical capacitated vehicle routing problem (Q3786261) (← links)
- Branch and cut methods for network optimization (Q5936762) (← links)