This paper considers the Red-Blue Transportation Problem (Red-Blue TP), a generalization of the transportation problem where supply nodes are partitioned into two sets and socalled exclusionary constraints are imposed. We encountered a special case of this problem in a hospital context, where patients need to be assigned to rooms. We establish the problem’s complexity, and we compare two intege...

Abstract: This paper considers an extended version of the Capacitated Arc Routing Problem (E-CARP), obtained by adding realistic constraints like prohibited turns to the basic CARP. Two integer linear models are presented, a mono-objective version and a biobjective one. A cutting plane method for the first version provides either an optimum or a lower bound that are used to benchmark a genetic ...

We report here two recent developments in the theory of optimal transportation. The first is a proof for the existence of optimal mappings to the Monge mass transportation problem [16]. The other is an application of optimal transportation in geometric optics [19]. The optimal transportation problem, in general, deals with the redistribution of materials in the most economical way. The original...

In this paper we give the solution methods for a multicriterial transportation problem of a nonlinear type. We would like to note that the problems of this type do not have any classical solution algorithms. The article consists of two parts dealing with 2 and 3 objectives respectively, one being non-linear of “bottleneck” type, and the rest being linear ones. Definitions of efficient and extre...

Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined — a synthesis of classical TSP and classical Transportation Problem. Algorithms based on Integer Programming cutting-plane methods and Branch and Bound Techniques are obvious. Mathematics Subject Classification 2000: 91A05, 91A06, 91A10, 91A44, 90C...