The constrained gravity model with power function as a cost function.
The determination of necessary and sufficient conditions for the existence of a solution to the multi-index problem
Modifications to a procedure for determining necessary and sufficient conditions for the existence of a solution to the multi-index problem are described. These modifications reduce the computation required to such an extent that necessary and sufficient conditions for the existence of a solution to the 3x3x3 multi-index problem can now be determined. These conditions are given in this paper.
Three Dimensional Fixed Charge Bi-Criterion Indefinite Quadratic Transportation Problem
Time Minimizing Transportation Problem with Fractional Bottleneck Objective Function
Total Time Minimizing Transportation Problem
Transportation Technique for a Particular Convex Programming Problem
Transports industriels routiers, un problème d'affectation avec réemploi sous contraintes
Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem
In this paper we deal with the preemptive asymmetric stacker crane problem in a heuristic way. We first present some theoretical results which allow us to turn this problem into a specific tree design problem. We next derive from this new representation an integer linear programming model together with simple and efficient greedy and local search heuristics. We conclude by presenting experimental results which aim at both testing the efficiency of our heuristic and evaluating the impact of the...
Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem
In this paper we deal with the preemptive asymmetric stacker crane problem in a heuristic way. We first present some theoretical results which allow us to turn this problem into a specific tree design problem. We next derive from this new representation an integer linear programming model together with simple and efficient greedy and local search heuristics. We conclude by presenting experimental results which aim at both testing the efficiency of our heuristic and evaluating the impact of the...
Trivial cases for the Kantorovitch problem
Trivial Cases for the Kantorovitch Problem
Let X and Y be two compact spaces endowed with respective measures μ and ν satisfying the condition µ(X) = v(Y). Let c be a continuous function on the product space X x Y. The mass transfer problem consists in determining a measure ξ on X x Y whose marginals coincide with μ and ν, and such that the total cost ∫ ∫ c(x,y)dξ(x,y) be minimized. We first show that if the cost function c is decomposable, i.e., can be represented as the sum of two continuous functions defined on X and Y, respectively,...