Learn More
To ensure uninterrupted service, telecommunication networks contain excess (spare) capacity for rerouting traffic in the event of a link failure. We study the NP-hard capacity planning problem of economically installing spare capacity on a network with steady-state working flows to permit link restoration. We present a spare capacity planning model that(More)
When cargo carriers form an alliance, sharing network capacity in order to improve profitability, a key issue is how to provide incentive for carriers to make decisions that are optimal for the alliance as a whole. We propose a mechanism that allocates both alliance resources and profits by appropriately setting prices for the resources. Clearly the(More)
This paper presents a detailed description of a particular class of deterministic single product maritime inventory routing problems (MIRPs), which we call deep-sea MIRPs with inventory tracking at every port. This class involves vessel travel times between ports that are significantly longer than the time spent in port and require inventory levels at all(More)
Under the Open Shortest Path First (OSPF) protocol, traffic flow in an Internet Protocol (IP) network is routed on the shortest paths between each source and destination. The shortest path is calculated based on pre-assigned weights on the network links. The OSPF weight setting problem is to determine a set of weights such that, if the flow is routed based(More)
We present two decomposition algorithms for single product deep-sea maritime inventory routing problems (MIRPs) that possess a core substructure common in many real-world applications. The problem involves routing vessels, each belonging to a particular vessel class, between loading and discharging ports, each belonging to a particular region. Our(More)