swMATH18215MaRDI QIDQ30061FDOQ30061
Author name not available (Why is that?)
Official website: https://www.sintef.no/projectweb/top/nearp/cbmix-benchmark/
Cited In (14)
- Branch-price-and-cut for the mixed capacitated general routing problem with time windows
- Efficient frameworks for greedy split and new depth first search split procedures for routing problems
- Two-phase branch-and-cut for the mixed capacitated general routing problem
- A lower bound for the node, edge, and arc routing problem
- Modeling and solving the mixed capacitated general routing problem
- A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection
- The bi-objective mixed capacitated general routing problem with different route balance criteria
- Hybrid evolutionary search for the traveling repairman problem with profits
- METSlib
- HotFrame
- New notation and classification scheme for vehicle routing problems
- A unified solution framework for multi-attribute vehicle routing problems
- ArcRoutingLibrary
- A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem
This page was built for software: CBMix
