Approximation schemes for packing with item fragmentation (Q927410): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1007/s00224-007-9082-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2080561834 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using fast matrix multiplication to find basic solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Processor Scheduling with Limited Number of Preemptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4826104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing can be solved within 1+epsilon in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of fragmentable object bin packing and an application / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with Deadlines and Loss Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4778565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan and preemption costs on a system of uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5755520 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothed analysis of termination of linear programming algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The many facets of linear programming / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:26, 28 June 2024

scientific article
Language Label Description Also known as
English
Approximation schemes for packing with item fragmentation
scientific article

    Statements

    Approximation schemes for packing with item fragmentation (English)
    0 references
    0 references
    0 references
    0 references
    6 June 2008
    0 references
    Polynomial time approximation schemes
    0 references
    Bin packing
    0 references
    Item fragmentation
    0 references
    Linear programming
    0 references
    Algorithms
    0 references

    Identifiers