Construction and algebraic characterizations of a planar four-index transportation problem equivalent to a circularization network flow problem

Author： Bulut H.   Bulut S.A.  

Publisher： Taylor & Francis Ltd

ISSN： 0020-7160

Source： International Journal of Computer Mathematics, Vol.80, Iss.11, 2003-11, pp. : 1373-1383

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Further results on the algebraic characterizations of a minimum cost network flow problem equivalent to the transportation problem

By özel Mustafa    

International Journal of Computer Mathematics, Vol. 82, Iss. 5, 2005-05 ,pp. : 609-616

Taylor & Francis Ltd

Access to resources Recommend Favorite

Some new results on the algebraic characterizations of an equality constrained optimization problem equivalent to the transportation problem

By  

International Journal of Computer Mathematics, Vol. 84, Iss. 7, 2007-07 ,pp. : 1021-1026

Taylor & Francis Ltd

Access to resources Recommend Favorite

Characterization of the types of maximum noninteger vertices in the relaxation polyhedron of the four-index axial assignment problem

By Kravtsov M.   Kravtsov V.  

Computational Mathematics and Mathematical Physics, Vol. 53, Iss. 5, 2013-05 ,pp. : 655-665

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Arnold diffusion in a restricted planar four-body problem

By  

Nonlinearity, Vol. 27, Iss. 12, 2014-12 ,pp. : 2887-2908

IOP Publishing

Access to resources Recommend Favorite

An algorithm to solve the proportional network flow problem

By Morrison David   Sauppe Jason   Jacobson Sheldon  

Optimization Letters, Vol. 8, Iss. 3, 2014-03 ,pp. : 801-809

Springer Publishing Company

Access to resources Recommend Favorite