Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Column generation for the variable cost and size bin packing problem with fragmentation

From MaRDI portal
Publication:510930
Jump to:navigation, search

DOI10.1016/J.ENDM.2016.10.016zbMath1364.90286OpenAlexW2556014137MaRDI QIDQ510930

Alberto Ceselli, Marco Casazza

Publication date: 14 February 2017

Full work available at URL: http://hdl.handle.net/2434/458581


zbMATH Keywords

column generationbin packingitem fragmentationvariable cost and size


Mathematics Subject Classification ID

Combinatorial optimization (90C27)


Related Items (1)

New formulations for variable cost and size bin packing problems with item fragmentation




Cites Work

  • Mathematical programming algorithms for bin packing problems with item fragmentation
  • Exactly solving packing problems with fragmentation
  • Bin packing with fragmentable items: presentation and approximations




This page was built for publication: Column generation for the variable cost and size bin packing problem with fragmentation

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:510930&oldid=12396443"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 06:24.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki