Security-constrained unit commitment: A decomposition approach embodying Kron reduction

•We solve the security constrained unit commitment problem via decomposition.•The proposed hybrid decomposition interchanges both dual and primal information.•The master problem is efficiently solved using Kron reduction.•Subproblems can be efficiently solved in parallel.•The proposed decomposition outperforms commercial branch-and-cut solvers.