"Combinations of Some Shop Scheduling Problems and the Shortest Path ..."

Kameng Nip, Zhenbo Wang, Wenxun Xing (2013)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2018-08-13

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/NipWX13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/NipWX13
Kameng Nip, Zhenbo Wang, Wenxun Xing:
Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms. CoRR abs/1309.0082 (2013)

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.