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 on the OSPF protocol, some measure of ...

This paper addresses the multicommodity capacitated fixed-charge network design problem with nonbifurcated flows and hop constraints. We present and compare mathematical programming formulations for this problem and we study different relaxations: linear programming relaxations, Lagrangean relaxations and partial relaxations of the integrality constraints. In particular, for the hop-indexed for...

many efforts have been made to model the the hot deformation (dynamic recrystallization) flow curves of different materials. phenomenological constitutive models, physical-based constitutive models and artificial neural network (ann) models are the main methods used for this purpose. however, there is no report on the modeling of warm deformation (dynamic spheroidization) flow curves of any kin...

In this work the management of truck arrivals in a maritime terminal is investigated as possible strategy to be used for obtaining a reduction in congestion and gate queues. In particular, a non-mandatory Truck Appointment System (TAS) is considered. Inspired by the work of Zehedner and Feillet 2013, we propose a multi-commodity network flow model for representing a maritime terminal. We solve ...

We present a programming methodology and runtime performance case study comparing the declarative data flow coordination language S-NET with Intel’s Concurrent Collections (CnC). As a coordination language S-NET achieves a near-complete separation of concerns between sequential software components implemented in a separate algorithmic language and their parallel orchestration in an asynchronous...

In the generalized max flow problem, the aim is to find a maximum flow in a generalized network, i.e., a network with multipliers on the arcs that specify which portion of the flow entering an arc at its tail node reaches its head node. We consider this problem for the class of series-parallel graphs. First, we study the continuous case of the problem and prove that it can be solved using a gre...

A general discrete hub network model that accounts for fixed, capacity, and operating/congestion costs on links and at hubs, with both economies and diseconomies of scale, selects hubs and links, determines their capacities, and assigns O-D flows over paths, while minimizing all system costs. Initially formulated as a mixed-integer non-linear program, the model is transformed into a mixed-integ...

Inverse maximum flow (IMDF), is among the most important problems in the field ofdynamic network flow, which has been considered the Euclidean norms measure in previousresearches. However, recent studies have mainly focused on the inverse problems under theHamming distance measure due to their practical and important applications. In this paper,we studies a general approach for handling the inv...

The existing works considering the flow-based discount factor in the hub and spoke problems, assume that increasing the amount of flow passing through each edge of network continuously decreases the unit flow transportation cost. Although a higher volume of flow allows for using wider links and consequently cheaper transportation, but the unit of flow enjoys more discounts, quite like replacing...