"Bounds and heuristic algorithms for the bin packing problem with minimum ..."

Mathijs Barkel et al. (2025)

> Home

Details and statistics

DOI: 10.1016/J.EJOR.2024.08.007

access: closed

type: Journal Article

metadata version: 2024-10-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/eor/BarkelDMM25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eor/BarkelDMM25
Mathijs Barkel, Maxence Delorme, Enrico Malaguti, Michele Monaci:
Bounds and heuristic algorithms for the bin packing problem with minimum color fragmentation. Eur. J. Oper. Res. 320(1): 57-68 (2025)

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.