An asymptotically exact algorithm for the high-multiplicity bin packing problem (Q2570998): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Carlo Filippi / rank
Normal rank
 
Property / author
 
Property / author: Carlo Filippi / 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.1007/s10107-004-0567-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2057976086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Rounding for Polymatroid and Branching Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of simultaneous diophantine approximation in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Two-Dimensional Integer Hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Linear Diophantine Equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Scheduling Independent Tasks with Restricted Execution Times / 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: A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths / 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: Q3818127 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:59, 11 June 2024

scientific article
Language Label Description Also known as
English
An asymptotically exact algorithm for the high-multiplicity bin packing problem
scientific article

    Statements

    Identifiers