On the bin packing problem with a fixed number of object weights (Q872247): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1016/j.ejor.2006.06.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2003686551 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case analyses, linear programming and the bin-packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Carathéodory bounds for integer cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking lower bounds for the bin-packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An asymptotically exact algorithm for the high-multiplicity bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cutting stock problem and integer rounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting orbits in symmetric ILP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: New cases of the cutting stock problem having MIRUP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of non-IRUP instances of the one-dimensional cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4848284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem / rank
 
Normal rank

Latest revision as of 15:36, 25 June 2024

scientific article
Language Label Description Also known as
English
On the bin packing problem with a fixed number of object weights
scientific article

    Statements

    Identifiers