A problem in vision that is polynomially solvable

MaRDI QIDQ806846zbMATH OpenFDO

Authors R. Chandrasekaran, Santosh N. Kabadi, Lakshmi S. Narasimhan

Publication date 1991

Published in Opsearch (Search for Journal in Brave)

Mathematics Subject Classification ID

Inequalities and extremum problems involving convexity in convex geometry (52A40) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Production models (90B30) Continuous location (90B85) Nonlinear programming (90C30) Abstract computational complexity for mathematical programming problems (90C60) Applications of mathematical programming (90C90) Mathematical programming (90C99)

Cited in

(1)

• Minimum dispersion problems

This page was built for publication: A problem in vision that is polynomially solvable

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