Pages that link to "Item:Q5326796"
From MaRDI portal
The following pages link to Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route (Q5326796):
Displaying 6 items.
- Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm (Q1622797) (← links)
- Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem (Q1703462) (← links)
- Exact algorithms for the equitable traveling salesman problem (Q1753595) (← links)
- Polynomial-time separation of enhanced reverse multistar inequalities (Q2450623) (← links)
- Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm (Q4994165) (← links)
- New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems (Q6109802) (← links)
