Polynomial Algorithms for a Class of Discrete Minmax Linear Programming Problems

DOI10.1057/jors.1995.68zbMath0834.90096OpenAlexW2035279967MaRDI QIDQ4838218

K. P. K. Nair, Abraham P. Punnen

Publication date: 24 July 1995

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1995.68

zbMATH Keywords

polynomial algorithmsNP-completeminmax linear programmingminmax transportation problem

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

This page was built for publication: Polynomial Algorithms for a Class of Discrete Minmax Linear Programming Problems