An algorithm is developd from the associated generator trees of basic dual solutions of a two-step transportation problem. This is completely appropiate for the “Balinski signature method” for the obtention of prime solutions of the two-step transportation problem

In recent years, flexible manufacturing system as a response to market demands has been proposed to increase product diversity, optimum utilization of machines andperiods of short-term products.The development of computer systems has provided the ability to build machines with high functionality and the necessary flexibility to perform various operations. However, due to the complexity and the ...

electrostatic potential as well as the local volume charge density are computed for a macromolecule by solving the poisson-boltzmann equation (pbe) using the finite element method (fem). as a verification, our numerical results for a one dimensional pbe, which corresponds to an infinite-length macromolecule, are compared with the existing analytical solution and good agreement is found. as a ma...

The ceaselessly increasing number of trips on urban highways and major arterial roads have caused serious congestion and air pollution problems. Thus many transportation agencies have persevered in their efforts not only to alleviate such problems, but also to minimize social costs. However, the complex nature of such problems has strongly hindered transportation agencies’ ability to consider a...

Flow cover inequalities are among the most effective valid inequalities for solving capacitated fixed-charge network flow problems. These valid inequalities are implications on the flow quantity on the cut arcs of a two-partitioning of the network, depending on whether some of the cut arcs are open or closed. As the implications are only on the cut arcs, flow cover inequalities can be modeled b...

Network Design problems concern the selection of arcs in a graph in order to satisfy, at minimum cost, some flow requirements, usually expressed in the form of origin-destination pair demands. Benders decomposition methods, based on the idea of partition and delayed constraint generation, have been successfully applied to many of these problems. This article presents a review of these applicati...

Flow cover inequalities are among the most effective valid inequalities for capacitated fixed-charge network flow problems. These valid inequalities are based on implications for the flow quantity on the cut arcs of a two-partitioning of the network, depending on whether some of the cut arcs are open or closed. As the implications are only on the cut arcs, flow cover inequalities can be obtaine...