An Efficient Benders Decomposition Approach for Optimal Large-Scale Network Slicing

Computer Science

• Network Slicing 100%
• Routing Traffic 50%
• Valid Inequality 50%
• Feedback Information 16%
• Virtual Networks 16%
• Network Resource 16%
• Service Requirement 16%
• Algorithm Converges 16%
• Network Infrastructure 16%
• Large-Scale Problem 16%
• Service Function 16%
• Globally Optimal Solution 16%

Engineering

• Subproblem 100%
• Scale Network 100%
• Nodes 33%
• Feedback Information 16%
• Scale Problem 16%
• Service Requirement 16%
• Infrastructure 16%
• Network Resource 16%
• Connecting Path 16%

Mathematics

• Benders Decomposition 100%
• Subproblem 100%
• Decomposition Algorithms 33%
• Scale Problem 16%