A branch and cut algorithm for the hierarchical network design problem

Mathematics

• Binary Variables 25%
• Branch-and-bound 50%
• Branch-and-cut 82%
• Costs 15%
• Cutting Planes 79%
• Fractional 15%
• Graph in graph theory 9%
• Hierarchical Networks 100%
• Model 6%
• Network Design 78%
• Optimization 15%
• Path 28%
• Valid 15%
• Vertex of a graph 23%

Business & Economics

• Ad Hoc 21%
• Branch-and-bound 52%
• Costs 16%
• Cutting Planes 92%
• Graph 21%
• Network Design 73%
• Node 40%

Engineering & Materials Science

• Costs 8%