Branch Cut and Price Applications

Information on the following applications, including source code for a solver implemented using SYMPHONY, is available:

• Traveling Salesman Problem
• Vehicle Routing Problem
• Set Partitioning Problem (basic and advanced)
• Mixed Postman Problem
• Matching Problem
• Capacitated Network Routing Problem includes as special cases:
• Minimum Latency Problem
• Cable-Trench Problem
• Capacitated Minimum Spanning Tree Problem
• Steiner Tree Problem
• Multi-Criteria Knapsack Problem
• Reference Materials

This page maintained by Ted Ralphs (ted@branchandcut.org)

Last updated January 11, 2005