On the Complexity of the Production-Transportation Problem

DOI10.1137/0806014zbMath0845.90087OpenAlexW2073363775MaRDI QIDQ4877515

Dorit S. Hochbaum, Sung-Pil Hong

Publication date: 13 May 1996

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/d57943fb74a569242c8c6fb4979eecece2aae2aa

zbMATH Keywords

polynomial algorithmMonge sequenceproduction-transportation problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Nonconvex programming, global optimization (90C26) Production models (90B30) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10)

Related Items (4)

Approximation algorithms for general one-warehouse multi-retailer systems ⋮ Network equilibrium of production, transportation and pricing for multi-product multi-market ⋮ Solving the production transportation problem via a deterministic annealing neural network method ⋮ Complexity and algorithms for nonlinear optimization problems

This page was built for publication: On the Complexity of the Production-Transportation Problem