Dissertation/ Thesis
Προβολή σε EDS

Packing problems on a PC.

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος: Packing problems on a PC.
Συγγραφείς: Deighton, Andrew George.
Συνεισφορές: Meyerowitz, Jane Julia.
Έτος έκδοσης: 1991
Θεματικοί όροι: Np-complete problems, Operations research--Data processing, Heuristic programming, Packaging--Data processing, Theses--Computer science
Περιγραφή: Thesis (M.Sc.)-University of Natal, Durban, 1991. ; Bin packing is a problem with many applications in various industries. This thesis addresses a specific instance of the this problem, known as the Container Packing problem. Special attention is paid to the Pallet Loading problem which is a restricted sub-problem of the general Container Packing problem. Since the Bin Packing problem is NP-complete, it is customary to apply a heuristic measure in order to approximate solutions in a reasonable amount of computation time rather than to attempt to produce optimal results by applying some exact algorithm. Several heuristics are examined for the problems under consideration, and the results produced by each are shown and compared where relevant.
Τύπος εγγράφου: thesis
Περιγραφή αρχείου: application/pdf
Γλώσσα: English
Relation: https://hdl.handle.net/10413/7876
Διαθεσιμότητα: https://hdl.handle.net/10413/7876
Αριθμός Καταχώρησης: edsbas.BA8DCB22
Βάση Δεδομένων: BASE
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://hdl.handle.net/10413/7876#
    Name: EDS - BASE (ns324271)
    Category: fullText
    Text: View record from BASE
Header DbId: edsbas
DbLabel: BASE
An: edsbas.BA8DCB22
RelevancyScore: 666
AccessLevel: 3
PubType: Dissertation/ Thesis
PubTypeId: dissertation
PreciseRelevancyScore: 666.479553222656
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Packing problems on a PC.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Deighton%2C+Andrew+George%2E%22">Deighton, Andrew George.</searchLink>
– Name: Author
  Label: Contributors
  Group: Au
  Data: Meyerowitz, Jane Julia.
– Name: DatePubCY
  Label: Publication Year
  Group: Date
  Data: 1991
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Np-complete+problems%22">Np-complete problems</searchLink><br /><searchLink fieldCode="DE" term="%22Operations+research--Data+processing%22">Operations research--Data processing</searchLink><br /><searchLink fieldCode="DE" term="%22Heuristic+programming%22">Heuristic programming</searchLink><br /><searchLink fieldCode="DE" term="%22Packaging--Data+processing%22">Packaging--Data processing</searchLink><br /><searchLink fieldCode="DE" term="%22Theses--Computer+science%22">Theses--Computer science</searchLink>
– Name: Abstract
  Label: Description
  Group: Ab
  Data: Thesis (M.Sc.)-University of Natal, Durban, 1991. ; Bin packing is a problem with many applications in various industries. This thesis addresses a specific instance of the this problem, known as the Container Packing problem. Special attention is paid to the Pallet Loading problem which is a restricted sub-problem of the general Container Packing problem. Since the Bin Packing problem is NP-complete, it is customary to apply a heuristic measure in order to approximate solutions in a reasonable amount of computation time rather than to attempt to produce optimal results by applying some exact algorithm. Several heuristics are examined for the problems under consideration, and the results produced by each are shown and compared where relevant.
– Name: TypeDocument
  Label: Document Type
  Group: TypDoc
  Data: thesis
– Name: Format
  Label: File Description
  Group: SrcInfo
  Data: application/pdf
– Name: Language
  Label: Language
  Group: Lang
  Data: English
– Name: NoteTitleSource
  Label: Relation
  Group: SrcInfo
  Data: https://hdl.handle.net/10413/7876
– Name: URL
  Label: Availability
  Group: URL
  Data: https://hdl.handle.net/10413/7876
– Name: AN
  Label: Accession Number
  Group: ID
  Data: edsbas.BA8DCB22
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsbas&AN=edsbas.BA8DCB22
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Text: English
    Subjects:
      – SubjectFull: Np-complete problems
        Type: general
      – SubjectFull: Operations research--Data processing
        Type: general
      – SubjectFull: Heuristic programming
        Type: general
      – SubjectFull: Packaging--Data processing
        Type: general
      – SubjectFull: Theses--Computer science
        Type: general
    Titles:
      – TitleFull: Packing problems on a PC.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Deighton, Andrew George.
      – PersonEntity:
          Name:
            NameFull: Meyerowitz, Jane Julia.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 1991
          Identifiers:
            – Type: issn-locals
              Value: edsbas
ResultId 1