A branch and cut algorithm for the hierarchical network design problem

Matemáticas

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

Economía y empresa

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

Ingeniería y ciencia de los materiales

• Costs 8%