Strongly polynomial algorithms for the quadratic transportation problem with a fixed number of sourcesCOSARES, S; HOCHBAUM, D. S.Mathematics of operations research. 1994, Vol 19, Num 1, pp 94-111, issn 0364-765XArticle

The A-forest iteration method for the stochastic generalized transportation problemLIQUN QI.Mathematics of operations research. 1987, Vol 12, Num 1, pp 1-21, issn 0364-765XArticle

The factored transportation problemEVANS, J. R.Management science. 1984, Vol 30, Num 8, pp 1021-1024, issn 0025-1909Article

Variables duales dans un programme continu de transport = Dual variables in continous program of transportationDUBUC, S; TANGUAY, M.Cahiers du Centre d'études de recherche opérationnelle. 1984, Vol 26, Num 1-2, pp 17-23, issn 0008-9737Article

Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costsOHUCHI, A; KAJI, I.Networks (New York, NY). 1984, Vol 14, Num 4, pp 515-530, issn 0028-3045Article

Estimation des paramètres des réseaux à structure complexeLITVAK, E. I; USHAKOV, I. A.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1984, Num 3, pp 3-17, issn 0002-3388Article

Some branch-and-bound procedures for fixed-cost transportation problemsCABOT, A. V; ERENGUE, S. S.Naval research logistics quarterly. 1984, Vol 31, Num 1, pp 145-154, issn 0028-1441Article

A simple, easily programmed method for locating Rook's tours in the transportation problemWILSDON, C. E.The Journal of the Operational Research Society. 1990, Vol 41, Num 9, pp 879-880, issn 0160-5682Article

Resolution of degeneracy in transportation problemsSHAFAAT, A; GOYAL, S. K.The Journal of the Operational Research Society. 1988, Vol 39, Num 4, pp 411-413, issn 0160-5682Article

A note on a proof of SPT optimality for single-machine sequencing problems via the transportation problemCHENG, T. C. E.Computers & operations research. 1990, Vol 17, Num 4, pp 425-426, issn 0305-0548, 2 p.Article

A discrete mass transportation problem for infinitely many sites, and general representant systems for infinite familiesPINELIS, Iosif.Mathematical methods of operations research (Heidelberg). 2003, Vol 58, Num 1, pp 105-129, issn 1432-2994, 25 p.Article

A quick sufficient solution to the more-for-less paradox in the transportation problemADLAKHA, V; KOWALSKI, K.Omega (Oxford). 1998, Vol 26, Num 4, pp 541-547, issn 0305-0483Article

A vehicle routing improvement algorithm comparison of a «greedy» and a matching implementation for inventory routingDROR, M; LEVY, L.Computers & operations research. 1986, Vol 13, Num 1, pp 33-45, issn 0305-0548Article

Computational experience with a polynomial-time dual simplex algorithm for the transportation problemIKURA, Y; NEMHAUSER, G. L.Discrete applied mathematics. 1986, Vol 13, Num 2-3, pp 239-248, issn 0166-218XArticle

Invariant sets of arcs in network flow problemsANSTEE, R. P.Discrete applied mathematics. 1986, Vol 13, Num 1, pp 1-7, issn 0166-218XArticle

A note on «the assignment problem under categorized jobs»INTRATOR, J.European journal of operational research. 1985, Vol 20, Num 1, pp 115-116, issn 0377-2217Article

Problème du flot maximal dans les goulots d'étranglementAKULICH, F. E.Vesci Akademii navuk BSSR. Seryâ fizika-matematyčnyh navuk. 1983, Num 3, pp 17-20, issn 0002-3574Article

Monge's transport problem on a Riemannian manifoldFELDMAN, Mikhail; MCCANN, Robert J.Transactions of the American Mathematical Society. 2002, Vol 354, Num 4, pp 1667-1697, issn 0002-9947Article

A note on the stochastic shortest route problemKAMBUROWSKI, J.Operations research. 1985, Vol 33, Num 3, pp 696-698, issn 0030-364XArticle

On transportation problems with upper bounds on leading rectanglesBARNES, E. R; HOFFMAN, A. J.SIAM journal on algebraic and discrete methods. 1985, Vol 6, Num 3, pp 487-496, issn 0196-5212Article

Un problème de flot avec des contraintes sur le nombre de transitsKUZ'MIN, S. L.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1985, Num 2, pp 77-83, issn 0002-3388Article

The Caterer problemSZWARC, W; POSNER, M. E.Operations research. 1985, Vol 33, Num 6, pp 1215-1224, issn 0030-364XArticle

Faces of dual transportation polyhedraBALINSKI, M. L; RUSSAKOFF, A.Mathematical programming study. 1984, Num 22, pp 1-8, issn 0303-3929Article

On multicommodity flows in planar graphsHASSIN, R.Networks (New York, NY). 1984, Vol 14, Num 2, pp 225-235, issn 0028-3045Article

Solution structures and sensitivity of special assignment problemsEISELT, H. A; GERCHAK, Y.Computers & operations research. 1984, Vol 11, Num 4, pp 397-399, issn 0305-0548Article