eBook
Προβολή σε EDS

Analysis and Design of Algorithms for Combinatorial Problems

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος: Analysis and Design of Algorithms for Combinatorial Problems
Περιγραφή: Combinatorial problems have been from the very beginning part of the history of mathematics. By the Sixties, the main classes of combinatorial problems had been defined. During that decade, a great number of research contributions in graph theory had been produced, which laid the foundations for most of the research in graph optimization in the following years. During the Seventies, a large number of special purpose models were developed.The impressive growth of this field since has been strongly determined by the demand of applications and influenced by the technological increases in computing power and the availability of data and software. The availability of such basic tools has led to the feasibility of the exact or well approximate solution of large scale realistic combinatorial optimization problems and has created a number of new combinatorial problems.
Συγγραφείς: G. Ausiello, M. Lucertini
Resource Type: eBook.
Θέματα: Combinatorial analysis--Data processing
Categories: MATHEMATICS / Discrete Mathematics
Βάση Δεδομένων: eBook Index
FullText Text:
  Availability: 0
Header DbId: edsebk
DbLabel: eBook Index
An: 239964
RelevancyScore: 592
AccessLevel: 6
PubType: eBook
PubTypeId: ebook
PreciseRelevancyScore: 591.781860351563
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Analysis and Design of Algorithms for Combinatorial Problems
– Name: Abstract
  Label: Description
  Group: Ab
  Data: Combinatorial problems have been from the very beginning part of the history of mathematics. By the Sixties, the main classes of combinatorial problems had been defined. During that decade, a great number of research contributions in graph theory had been produced, which laid the foundations for most of the research in graph optimization in the following years. During the Seventies, a large number of special purpose models were developed.The impressive growth of this field since has been strongly determined by the demand of applications and influenced by the technological increases in computing power and the availability of data and software. The availability of such basic tools has led to the feasibility of the exact or well approximate solution of large scale realistic combinatorial optimization problems and has created a number of new combinatorial problems.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22G%2E+Ausiello%22">G. Ausiello</searchLink><br /><searchLink fieldCode="AR" term="%22M%2E+Lucertini%22">M. Lucertini</searchLink>
– Name: TypePub
  Label: Resource Type
  Group: TypPub
  Data: eBook.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Combinatorial+analysis--Data+processing%22">Combinatorial analysis--Data processing</searchLink>
– Name: SubjectBISAC
  Label: Categories
  Group: Su
  Data: <searchLink fieldCode="ZK" term="%22MATHEMATICS+%2F+Discrete+Mathematics%22">MATHEMATICS / Discrete Mathematics</searchLink>
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsebk&AN=239964
RecordInfo BibRecord:
  BibEntity:
    Classifications:
      – Code: 511.6
        Scheme: ddc
        Type: prePub
    Languages:
      – Code: eng
        Text: English
    Subjects:
      – SubjectFull: Combinatorial analysis--Data processing
        Type: general
    Titles:
      – TitleFull: Analysis and Design of Algorithms for Combinatorial Problems
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: G. Ausiello
      – PersonEntity:
          Name:
            NameFull: M. Lucertini
      – PersonEntity:
          Name:
            NameFull: G. Ausiello
      – PersonEntity:
          Name:
            NameFull: M. Lucertini
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 1985
            – D: 04
              M: 02
              Type: profile
              Y: 2014
          Identifiers:
            – Type: isbn-print
              Value: 9780444876997
            – Type: isbn-electronic
              Value: 9780080872209
          Numbering:
            – Type: volume
              Value: 00025
          Titles:
            – TitleFull: Analysis and Design of Algorithms for Combinatorial Problems
              Type: main
ResultId 1