A class of minimax problems solvable in polynomial time.
From MaRDI portal
Publication:5942839
zbMath1168.90559MaRDI QIDQ5942839
Publication date: 30 July 2002
Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Management decision making, including multiple objectives (90B50) Boolean programming (90C09)
This page was built for publication: A class of minimax problems solvable in polynomial time.