Answer Happy

network optimization :
Let beanetwork, beastrictlypositivecostassignedtoeachlink,and the given link capacities. Let be a multicast demand, from node to nodes
in set . Write a flow-link formulation that finds the multicast tree satisfying , which minimizes the sum of the costs in the traversed links. Let be a set of multicast trees satisfying . Modify the previous formulation to forbid returning any multicast tree in (that is, with exactly the same set of traversed links that a tree in ). Devise an algorithm which uses previous formulation to solve the -shortest multicast tree problem. Implement such algorithm in a Java function, solving the formulations with JOM.
Let C(N, E) be a network, (c.ee &) be a strictly positive cost assigned to each link, and (u.ee) the given link capacities. Let d be a multicast demand, from node a(d) to nodes in set b(d). Write a flow-link formulation that finds the multicast tree satisfying d, which minimizes the sum of the costs in the traversed links. Let P be a set of multicast trees satisfying d. Modify the previous formulation to forbid returning any multicast tree in p (that is, with exactly the same set of traversed links that a tree in P). Devise an algorithm which uses previous formulation to solve the k-shortest multicast tree problem. Implement such algorithm in a Java function, solving the formulations with JOM.

OPTIMIZATION OF COMPUTER NETWORKS Modeling and Algorithms A Hands-On Approach Pablo Pavón Mariño WILEY