BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem (Q1362971): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Heuristic algorithms for the multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A state-of-the-art review of parallel-machine scheduling research / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the dual bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm for the two-dimensional vector packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / 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: A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4290987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for a class of loading problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated Vehicle Routing on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-bound algorithms for the multi-product assembly line balancing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds and reduction procedures for the bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying tabu search with influential diversification to multiprocessor scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the production rate in simple assembly line balancing -- A branch and bound procedure / rank
 
Normal rank

Latest revision as of 17:04, 27 May 2024

scientific article
Language Label Description Also known as
English
BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
scientific article

    Statements

    BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem (English)
    0 references
    0 references
    7 August 1997
    0 references
    one-dimensional bin packing
    0 references
    meta-strategy tabu search
    0 references
    branch and bound
    0 references

    Identifiers