Exact and approximate methods for a one-dimensional minimax bin-packing problem (Q363606): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Douglas Steinley / rank
Normal rank
 
Property / author
 
Property / author: Douglas Steinley / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C59 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6203961 / rank
 
Normal rank
Property / zbMATH Keywords
 
one-dimensional bin-packing
Property / zbMATH Keywords: one-dimensional bin-packing / rank
 
Normal rank
Property / zbMATH Keywords
 
combinatorial optimization
Property / zbMATH Keywords: combinatorial optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
integer programming
Property / zbMATH Keywords: integer programming / rank
 
Normal rank
Property / zbMATH Keywords
 
simulated annealing
Property / zbMATH Keywords: simulated annealing / rank
 
Normal rank
Property / zbMATH Keywords
 
test splitting
Property / zbMATH Keywords: test splitting / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: XPRESS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / 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/s10479-012-1175-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1976567265 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4656640 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5706832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A morph-based simulated annealing heuristic for a modified bin-packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Sum-of-Squares algorithm for bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Scheduling of Tasks on Identical Parallel Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: New heuristics for one-dimensional bin-packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing problems in one dimension: Heuristic solutions and confidence intervals / 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: Q3035155 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5753787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster Analysis and Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin-packing by simulated annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using aptitude measurements for the optimal assignment of subjects to treatments with and without mastery scores / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Models for Optimal Test Design / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:25, 6 July 2024

scientific article
Language Label Description Also known as
English
Exact and approximate methods for a one-dimensional minimax bin-packing problem
scientific article

    Statements

    Exact and approximate methods for a one-dimensional minimax bin-packing problem (English)
    0 references
    0 references
    0 references
    0 references
    3 September 2013
    0 references
    one-dimensional bin-packing
    0 references
    combinatorial optimization
    0 references
    integer programming
    0 references
    simulated annealing
    0 references
    test splitting
    0 references
    0 references
    0 references

    Identifiers