Solving the one-dimensional bin packing problem with a weight annealing heuristic (Q2468485): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2006.10.021 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: Bison / 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.cor.2006.10.021 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2006271225 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem / 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: New classes of fast lower bounds for bin packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The noising method: A new method for combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guided local search and its application to the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guided Local Search for the Three-Dimensional Bin-Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of bin-packing problems using column generation and branch-and-bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the integer one-dimensional cutting stock problem: A computational study / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2006.10.021 / rank
 
Normal rank

Latest revision as of 19:59, 18 December 2024

scientific article
Language Label Description Also known as
English
Solving the one-dimensional bin packing problem with a weight annealing heuristic
scientific article

    Statements

    Solving the one-dimensional bin packing problem with a weight annealing heuristic (English)
    0 references
    0 references
    0 references
    0 references
    23 January 2008
    0 references
    bin packing
    0 references
    weight annealing
    0 references
    heuristics
    0 references
    combinatorial optimization
    0 references

    Identifiers