Polynomial Algorithms for a Class of Discrete Minmax Linear Programming Problems

DOI10.1057/JORS.1995.68MaRDI QIDQ4838218zbMATH OpenOpenAlexFDO

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

Publication date 24 July 1995

Published in The 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

NP-completepolynomial algorithmsminmax linear programmingminmax transportation problem

Mathematics Subject Classification ID

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

Recommendations

• A class of minimax problems solvable in polynomial time.
• A strongly polynomial-time algorithm for a class of integer programming problems
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• On the integer max-linear programming problem
• scientific article; zbMATH DE number 3959128

Cited in

(6)

• Discrete minimization with levels of claims
• Polynomial algorithms for m (m+1) integer programs and m (m+k) diophantine systems
• scientific article; zbMATH DE number 193877 (Why is no real title available?)
• Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints
• A strongly polynomial-time algorithm for a class of integer programming problems
• A class of minimax problems solvable in polynomial time.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4838218)