A problem in vision that is polynomially solvable
zbMATH Open0729.90853MaRDI QIDQ806846FDOQ806846
Authors: R. Chandrasekaran, Santosh N. Kabadi, Lakshmi S. Narasimhan 
Publication date: 1991
Published in: Opsearch (Search for Journal in Brave)
Applications of mathematical programming (90C90) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60) Inequalities and extremum problems involving convexity in convex geometry (52A40) Production models (90B30) Continuous location (90B85) Mathematical programming (90C99)
Cited In (1)
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)
