Searching for "An Interior-Point Approach to NP-Complete Problems." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

An Interior Point Approach to the Maximum Independent Set Problem in Dense Random Graphs
by Narendra Karmarkar, Mauricio G.C. Resende, K. G. Ramakrishnan — 1989 — In Proceedings of the XIII Latin American Conference on Informatics
… Quadratic Programming Karmarkar [10] suggested an interior point approach to NP-complete problems…
Cited by 6 (3 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB