New heuristics for one-dimensional bin-packing (Q5959374): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4198056 / 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: Exact solution of bin-packing problems using column generation and branch-and-bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840364 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic algorithms for the multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank

Latest revision as of 00:02, 4 June 2024

scientific article; zbMATH DE number 1723853
Language Label Description Also known as
English
New heuristics for one-dimensional bin-packing
scientific article; zbMATH DE number 1723853

    Statements