The following pages link to CBMix (Q30061):
Displaying 11 items.
- Two-phase branch-and-cut for the mixed capacitated general routing problem (Q319006) (← links)
- The bi-objective mixed capacitated general routing problem with different route balance criteria (Q322701) (← links)
- A lower bound for the node, edge, and arc routing problem (Q340291) (← links)
- Modeling and solving the mixed capacitated general routing problem (Q375984) (← links)
- Efficient frameworks for greedy split and new depth first search split procedures for routing problems (Q613510) (← links)
- A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection (Q1652522) (← links)
- Branch-price-and-cut for the mixed capacitated general routing problem with time windows (Q1754228) (← links)
- A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem (Q1792021) (← links)
- Hybrid evolutionary search for the traveling repairman problem with profits (Q2224863) (← links)
- A unified solution framework for multi-attribute vehicle routing problems (Q2514767) (← links)
- New Notation and Classification Scheme for Vehicle Routing Problems (Q5247680) (← links)
