Bum Hwan Park

Learn More
We propose an algorithm forfinding a multicast tree in packet-switched networks. The objective is to minimize total cost incurred at the multicast path. The routing model is based on the minimum cost Steiner tree problem The Steiner problem is extended, in our papes to incorpomte two additional requirements. First , the delay experienced along the path from(More)
We propose railway line planning optimization models that determines the frequency of each train so that it can meet passenger origindestination demands while minimizing the related costs. Most line planning models assume that all trains on a supply network stop at all intermediate stations. However to minimize passenger travelling time and provide train(More)
  • 1