Show simple item record

AuthorSalamon, Peterdc.contributor.author
AuthorSibani, Paolodc.contributor.author
AuthorGehring, Wolfgangdc.contributor.author
AuthorWhitney, R.dc.contributor.author
AuthorFrost, R.dc.contributor.author
Date of accession2020-03-31T08:08:35Zdc.date.accessioned
Available in OPARU since2020-03-31T08:08:35Zdc.date.available
Date of first publication1998dc.date.issued
Languageen_USdc.language.iso
PublisherUniversität Ulmdc.publisher
Dewey Decimal GroupDDC 000 / Computer science, information & general worksdc.subject.ddc
TitleToward a taxonomy of NP-hard combinatorial optimization problemsdc.title
Resource typeWissenschaftlicher Artikeldc.type
FacultyFakultät für Ingenieurwissenschaften, Informatik und Psychologieuulm.affiliationGeneral
InstitutionInstitut für Programmiermethodik und Compilerbauuulm.affiliationSpecific
DCMI TypeTextuulm.typeDCMI
CategoryPublikationsnachweiseuulm.category
Source - Title of sourceBulletin of the American Physical Societysource.title
Source - Place of publicationAmerican Physical Societysource.publisher
Source - Volume43source.volume
Source - Issue1source.issue
Source - Year1998source.year
Source - ISSN0003-0503source.identifier.issn
CommunityFakultät für Ingenieurwissenschaften, Informatik und Psychologieuulm.community
Bibliographyuulmuulm.bibliographie


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record