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

T. C. E. Cheng, Yakov M. Shafransky, C. T. Ng (2016)

> Home

Details and statistics

DOI: 10.1016/J.EJOR.2015.06.076

access: closed

type: Journal Article

metadata version: 2021-02-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/eor/ChengSN16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eor/ChengSN16
T. C. E. Cheng, Yakov M. Shafransky, C. T. Ng:
An alternative approach for proving the NP-hardness of optimization problems. Eur. J. Oper. Res. 248(1): 52-58 (2016)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.