Pseudo-Polynomial Formulations for the Bin Packing Problem with Minimum Color Fragmentation.
Saved in:
| Title: | Pseudo-Polynomial Formulations for the Bin Packing Problem with Minimum Color Fragmentation. |
|---|---|
| Authors: | Barkel, Mathijs1 (AUTHOR) m.j.barkel@tilburguniversity.edu, Delorme, Maxence1 (AUTHOR) m.delorme@tilburguniversity.edu, Malaguti, Enrico2 (AUTHOR) enrico.malaguti@unibo.it, Monaci, Michele2 (AUTHOR) michele.monaci@unibo.it |
| Source: | INFORMS Journal on Computing. May/Jun2026, Vol. 38 Issue 3, p1016-1031. 16p. |
| Database: | Business Source Ultimate |
|
Full text is not displayed to guests.
Login for full access.
|
|
| FullText | Links: – Type: pdflink Text: Availability: 1 |
|---|---|
| Header | DbId: bsu DbLabel: Business Source Ultimate An: 194555544 AccessLevel: 2 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Pseudo-Polynomial Formulations for the Bin Packing Problem with Minimum Color Fragmentation. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Barkel%2C+Mathijs%22">Barkel, Mathijs</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> m.j.barkel@tilburguniversity.edu</i><br /><searchLink fieldCode="AR" term="%22Delorme%2C+Maxence%22">Delorme, Maxence</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> m.delorme@tilburguniversity.edu</i><br /><searchLink fieldCode="AR" term="%22Malaguti%2C+Enrico%22">Malaguti, Enrico</searchLink><relatesTo>2</relatesTo> (AUTHOR)<i> enrico.malaguti@unibo.it</i><br /><searchLink fieldCode="AR" term="%22Monaci%2C+Michele%22">Monaci, Michele</searchLink><relatesTo>2</relatesTo> (AUTHOR)<i> michele.monaci@unibo.it</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22INFORMS+Journal+on+Computing%22">INFORMS Journal on Computing</searchLink>. May/Jun2026, Vol. 38 Issue 3, p1016-1031. 16p. |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=bsu&AN=194555544 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1287/ijoc.2024.0972 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 16 StartPage: 1016 Titles: – TitleFull: Pseudo-Polynomial Formulations for the Bin Packing Problem with Minimum Color Fragmentation. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Barkel, Mathijs – PersonEntity: Name: NameFull: Delorme, Maxence – PersonEntity: Name: NameFull: Malaguti, Enrico – PersonEntity: Name: NameFull: Monaci, Michele IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 05 Text: May/Jun2026 Type: published Y: 2026 Identifiers: – Type: issn-print Value: 10919856 Numbering: – Type: volume Value: 38 – Type: issue Value: 3 Titles: – TitleFull: INFORMS Journal on Computing Type: main |
| ResultId | 1 |