We present a branch-and-cut algorithm to solve the single commodity uncapacitated fixed charge network flow problem, which includes the Steiner tree problem, uncapacitated lot-sizing problems, and the fixed charge transportation problem as special cases. The cuts used are simple dicut...

In this paper we present a new approximation for computing lower bound for the fixed charge transportation problem (FCTP). The lower bounds thus generated delivered 87% optimal solutions for 56 randomly generated small, up to 6×10 in size, problems in an experimental design. For somewhat...

We present a hierarchy of semidefinite programming (SDP) relaxations for solving the concave cost transportation problem (CCTP), which is known to be NP-hard, with p suppliers and q demanders. In particular, we study cases in which the cost function is quadratic or square-root concave. The key...

In this note we investigate the computational complexity of the transportation problem with a permutable demand vector, TP-PD for short. In the TP-PD, the goal is to permute the elements of the given integer demand vector b=(b <Subscript>1</Subscript>,…,b <Subscript>n</Subscript>) in order to minimize the overall transportation costs....</subscript></subscript>

We consider two person zero-sum repeated games with lack of information on one side and with payoffs of special “separable” form. The solutions for these games are reduced to the solutions for families of special transportation type problems with recursive structure. We illustrate our...

LetG=(U,V,E) be a bipartite graph with weights of its edgesc <Subscript> ij </Subscript>. For the assignment and transportation problem given by such a graph we propose efficient procedures for partitioning the edge setE into three classes:E <Subscript>o</Subscript> is the set of edgesij withx <Subscript> ij </Subscript>=0 for each optimum solution (0-persistent...</subscript></subscript></subscript>

In this note we investigate the computational complexity of the transportation problem with a permutable demand vector, TP-PD for short. In the TP-PD, the goal is to permute the elements of the given integer demand vector b=(b 1 ,…,b n ) in order to minimize the overall transportation costs....

В статье определена зависимость между конкурентной стратегией и оперативным уровнем управления логистической системой предприятия. Представлено решение...

The problem of finding an appropriate transportation plan for a transport company collaborating with a window manufacturer to reduce transport costs by minimizing the total distance travelled and provide a minimum car fleet is presented in this paper. The problem involves 3 major manufacturing...

The factored transportation problem is one having cost coefficients of the form c_ij = u_iv_j. The main result proven in this paper is that if rows are arranged according to nonincreasing u_i and columns by nondecreasing v_j, then the northwest corner rule provides an optimal solution. Applications...