Article thumbnail

An alternative approach for proving the NP-hardness of optimization problems

By T.C.E. Cheng, Y. Shafransky and C.T. Ng
Publisher: Elsevier BV
Year: 2015
DOI identifier: 10.1016/j.ejor.2015.06.076
OAI identifier:
Provided by: MUCC (Crossref)
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://hdl.handle.net/10397/28... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.