Author： Pujari Arun K Nataraj A
Publisher： Emerald Group Publishing Ltd
ISSN： 0368-492X
Source： Kybernetes: The International Journal of Systems & Cybernetics, Vol.25, Iss.5, 1996-05, pp. : 53-59
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon
Theoretical Computer Science, Vol. 174, Iss. 1, 1997-03 ,pp. :
Access to resources
Recommend
A Cutting Plane Algorithm for Linear Reverse Convex Programs
Annals of Operations Research, Vol. 105, Iss. 1-4, 2001-07 ,pp. :
A generalization of diagonal flips in a convex polygon
Theoretical Computer Science, Vol. 235, Iss. 2, 2000-03 ,pp. :
A Long-Step, Cutting Plane Algorithm for Linear and Convex Programming
Annals of Operations Research, Vol. 99, Iss. 1-4, 2000-12 ,pp. :