Pairwise solutions and the core of transportation situationsSANCHEZ-SORIANO, Joaquin.European journal of operational research. 2006, Vol 175, Num 1, pp 101-110, issn 0377-2217, 10 p.Article

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

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

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

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

Capacitated transportation problem with bounds on RIM conditionsDAHIYA, Kalpana; VERMA, Vanita.European journal of operational research. 2007, Vol 178, Num 3, pp 718-737, issn 0377-2217, 20 p.Article

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

Distance matrix and Laplacian of a tree with attached graphsBAPAT, R. B.Linear algebra and its applications. 2005, Vol 411, pp 295-308, issn 0024-3795, 14 p.Article

A simple heuristic for solving small fixed-charge transportation problemsADLAKHA, Veena; KOWALSKI, Krzysztof.Omega (Oxford). 2003, Vol 31, Num 3, pp 205-211, issn 0305-0483, 7 p.Article

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

Optimal solution of a Monge-Kantorovitch transportation problemABDELLAOUI, T.Journal of computational and applied mathematics. 1998, Vol 96, Num 2, pp 149-161, issn 0377-0427Article

Transportation problems which can be solved by the use of Hirsch-paths for the dual problemsKLEINSCHMIDT, P; LEE, C. W; SCHANNATH, H et al.Mathematical programming. 1987, Vol 37, Num 2, pp 153-168, issn 0025-5610Article

Multi-terminal maximum flows in node-capacitated networksGRANOT, F; HASSIN, R.Discrete applied mathematics. 1986, Vol 13, Num 2-3, pp 157-163, issn 0166-218XArticle

A fertilizer transportation problemSCHMIDT, G.Zeitschrift für Operations Research. 1986, Vol 30, Num 6, pp B135-B145, issn 0373-790XArticle

A hybrid algorithm for solving convexe separable network flow problemsBELLING-SEIB, K.Zeitschrift für Operations Research. 1985, Vol 29, Num 3, pp 105-123, issn 0373-790XArticle

A unified framework for primal-dual methods in minimum cost network flow problemsBERTSEKAS, D. P.Mathematical programming. 1985, Vol 32, Num 2, pp 125-145, issn 0025-5610Article