MCMCMMarkov Chain Monte Carlo Methods
References in periodicals archive ?
Using the hierarchy concept, the MCMCM problem can easily be re-formulated as follows.
The MCMCM problem consists in finding the multi-constrained minimum partial directed spanning hierarchy containing at most one directed path p(s, [d.sub.j]) from the source to each destination [d.sub.j] [member of] D, with respect to the constraints: w(p(s,[d.sub.j]))[??]L.
In the following, we present a Branch and Bound algorithm that exactly solves the MCMCM problem.