"On the NP-Hardness of Two Scheduling Problems Under Linear Constraints."

Kameng Nip (2023)

> Home

Details and statistics

DOI: 10.1007/978-3-031-39344-0_5

access: closed

type: Conference or Workshop Paper

metadata version: 2023-08-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/faw/Nip23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/faw/Nip23
Kameng Nip:
On the NP-Hardness of Two Scheduling Problems Under Linear Constraints. IJTCS-FAW 2023: 58-70

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.