The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP (Q3842995): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CUTGEN1 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1111/j.1475-3995.1997.tb00093.x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2155312717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A typology of cutting and packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An instance of the cutting stock problem for which the rounding property does not hold / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving binary cutting stock problems by column generation and branch- and-bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the integer one-dimensional cutting stock problem: A computational study / rank
 
Normal rank

Latest revision as of 15:55, 28 May 2024

scientific article
Language Label Description Also known as
English
The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
scientific article

    Statements