We formulate the minimum spanning tree problem with resource allocation (MSTRA) in two ways, as discrete and continuous optimization problems (d-MSTRA/c-MSTRA), prove these to be NP-hard, and present algorithms to solve these problems to optimality. We reformulate d-MSTRA as the knapsack...

This paper presents a sequential solution method to discover efficient trades in an electricity market model. The market model represents deregulated electricity market consisting of four types of participants: independent power producers, retailers, public utilities, and consumers. Our model is...