Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"The counting complexity of a simple scheduling problem."

Gerardo Berbeglia (2009)

> Home

Details and statistics

DOI: 10.1016/J.ORL.2009.05.004

access: closed

type: Journal Article

metadata version: 2017-09-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/orl/Berbeglia09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/orl/Berbeglia09
Gerardo Berbeglia:
The counting complexity of a simple scheduling problem. Oper. Res. Lett. 37(5): 365-367 (2009)

a service of

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.