CBMix

swMATH18215MaRDI QIDQ30061FDOQ30061

Author name not available (Why is that?)

Cited In (11)

• Branch-price-and-cut for the mixed capacitated general routing problem with time windows
• New Notation and Classification Scheme for Vehicle Routing Problems
• 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
• A unified solution framework for multi-attribute vehicle routing problems
• A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem

This page was built for software: CBMix