A pseudo-polynomial primal-dual algorithm for globally solving a production-transportation problem
From MaRDI portal
Publication:1365379
DOI10.1023/A:1008278625289zbMath0886.90168OpenAlexW1492736567MaRDI QIDQ1365379
Takahiro Utsunomiya, Takahito Kuno
Publication date: 12 May 1998
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008278625289
primal-dual algorithmpseudo-polynomial algorithmminimum linear-cost flow problemproduction-transportation problems
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items
An iterative algorithm for two level hierarchical time minimization transportation problem ⋮ A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem ⋮ Minimizing a linear multiplicative-type function under network flow constraints ⋮ A general purpose exact solution method for mixed integer concave minimization problems ⋮ A fuzzy goal programming and meta heuristic algorithms for solving integrated production: distribution planning problem ⋮ Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints
