Pages that link to "Item:Q1278251"
From MaRDI portal
The following pages link to A new subtour elimination constraint for the vehicle routing problem (Q1278251):
Displaying 12 items.
- Exact hybrid algorithms for solving a bi-objective vehicle routing problem (Q441036) (← links)
- A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem (Q596294) (← links)
- The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations (Q814246) (← links)
- A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations (Q1908292) (← links)
- Vehicle routing with subtours (Q2010917) (← links)
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints (Q2276891) (← links)
- The subdivision-constrained routing requests problem (Q2436672) (← links)
- Two exact algorithms for the distance-constrained vehicle routing problem (Q3325496) (← links)
- Optimal Routing under Capacity and Distance Restrictions (Q3694981) (← links)
- On the vehicle routing problem (Q4378935) (← links)
- New Notation and Classification Scheme for Vehicle Routing Problems (Q5247680) (← links)
- Branch and cut methods for network optimization (Q5936762) (← links)