MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for "An interior point algorithm to solve computationally difficult set covering problems." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 4 documents found, showing 1 through 4.
ATOM RSS
  • Bibliography  
  • by M.G.C. Resende, Problems In R. Battiti, A. Bertossi, Proceedings Of Algorithms, P. M. Pardalos — 1999
  • …, M.G.C. Resende, and K.G. Ramakrishnan. An interior point algorithm to solve computationally…
  • Add To MetaCart
  • Cv  
  • by Mauricio G.C. Resende — 1999
  • …. "An interior point algorithm to solve computationally difficult set covering problems," (with N…
  • Add To MetaCart
  • computationally difficult set covering problems  
  • by Narendra Karmarkar, Mauricio G. C. Resende, K. G. Ramakrishnan — 1989
  • …An interior point algorithm to solve computationally difficult set covering problems ∗ Narendra…
  • Add To MetaCart
Help! Showing 1 through 4.
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB