"On a borderline between the NP-hard and polynomial-time solvable cases of ..."

Alexander V. Kononov, Julia Memar, Yakov Zinder (2022)

> Home

Details and statistics

DOI: 10.1007/S10898-021-01097-W

access: closed

type: Journal Article

metadata version: 2022-07-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jgo/KononovMZ22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgo/KononovMZ22
Alexander V. Kononov, Julia Memar, Yakov Zinder:
On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements. J. Glob. Optim. 83(3): 445-456 (2022)

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.