Skip to main navigation Skip to search Skip to main content

The periodic joint replenishment problem is strongly NP-hard

  • Tamar Cohen-Hillel
  • , Liron Yedidsion

Research output: Contribution to journalArticlepeer-review

21 Scopus citations

Fingerprint

Dive into the research topics of 'The periodic joint replenishment problem is strongly NP-hard'. Together they form a unique fingerprint.
Sort by

Computer Science

Keyphrases

Mathematics