An AFPTAS for variable sized bin packing with general activation costs (Q340560): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6652740 / rank
 
Normal rank
Property / zbMATH Keywords
 
bin packing
Property / zbMATH Keywords: bin packing / rank
 
Normal rank
Property / zbMATH Keywords
 
asymptotic approximation schemes
Property / zbMATH Keywords: asymptotic approximation schemes / rank
 
Normal rank
Property / zbMATH Keywords
 
scheduling
Property / zbMATH Keywords: scheduling / 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.1016/j.jcss.2016.07.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2527257938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast asymptotic approximation scheme for bin packing with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for ordered vector packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Approximation Algorithms and Metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Train Delivery Problem - Vehicle Routing Meets Bin Packing / 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: Bin packing with rejection revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Class constrained bin packing revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing with general cost structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: An APTAS for Generalized Cost Variable-Sized Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for covering and packing problems in image processing and VLSI / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417714 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An asymptotic approximation scheme for the concave cost bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin‐packing problem with concave costs of bin utilization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Approximation Scheme for Variable-Sized Bin Packing / 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: The class constrained bin packing problem with applications to video-on-demand / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:22, 12 July 2024

scientific article
Language Label Description Also known as
English
An AFPTAS for variable sized bin packing with general activation costs
scientific article

    Statements

    An AFPTAS for variable sized bin packing with general activation costs (English)
    0 references
    0 references
    0 references
    14 November 2016
    0 references
    bin packing
    0 references
    asymptotic approximation schemes
    0 references
    scheduling
    0 references
    0 references
    0 references
    0 references

    Identifiers