Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A problem in vision that is polynomially solvable

From MaRDI portal
Publication:806846
Jump to:navigation, search

zbMath0729.90853MaRDI QIDQ806846

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

Publication date: 1991

Published in: Opsearch (Search for Journal in Brave)



Mathematics Subject Classification ID

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


Related Items

Minimum dispersion problems



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:806846&oldid=12737834"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 12:05.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki