SYMPHONY Applications

The following applications, including source code for a solver implemented using SYMPHONY, are 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 (tkralphs@lehigh.edu)

Last updated March 29, 2019