Candidate Intermediary Node Deployment Under the Linear Threshold Model: A Branch-and-Benders-Cut Approach
This paper proposes a scenario-decomposed branch-and-Benders-cut algorithm that solves the finite-scenario SAA model to optimality and establishes distributional equivalence between sampling on the potential graph and then restricting each scenario to the deployed induced network, and sampling directly on the deployed...