Pages that link to "Item:Q3564361"
From MaRDI portal
The following pages link to An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems (Q3564361):
Displaying 11 items.
- A hybrid algorithm for a class of vehicle routing problems (Q336559) (← links)
- An effective matheuristic for the capacitated total quantity discount problem (Q336744) (← links)
- An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem (Q439317) (← links)
- Enhanced mixed integer programming techniques and routing problems (Q657574) (← links)
- An ILP improvement procedure for the open vehicle routing problem (Q991364) (← links)
- The time constrained maximal covering salesman problem (Q1631991) (← links)
- An ILP-based local search procedure for the VRP with pickups and deliveries (Q1698289) (← links)
- An integer programming-based local search for the covering salesman problem (Q1761202) (← links)
- Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems (Q2294623) (← links)
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
- Hybridizations of evolutionary algorithms with large neighborhood search (Q6158769) (← links)
