default search action

combined dblp search
author search
venue search
publication search

ask others

"Strongly Fully Polynomial Time Approximation Scheme for the weighted ..."

Imed Kacem, Myriam Sahnoune, Günter Schmidt (2017)

> Home

Details and statistics

DOI: 10.1051/RO/2017044

access: closed

type: Journal Article

metadata version: 2021-10-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/rairo/KacemSS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rairo/KacemSS17
Imed Kacem, Myriam Sahnoune, Günter Schmidt:
Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines. RAIRO Oper. Res. 51(4): 1177-1188 (2017)

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.