BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
type: Item
instance of: scholarly article
title: BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
zbMATH Open document ID: 0882.90113
DOI: 10.1016/S0305-0548(96)00082-2
author: O. Diekmann
published in: Computers \& Operations Research
publication date: 1997-08-07T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1045748
zbMATH Keywords: one-dimensional bin packing
zbMATH Keywords: meta-strategy tabu search
zbMATH Keywords: branch and bound
describes a project that uses: Tabu search
MaRDI profile type: Publication
cites work: Heuristic algorithms for the multiple knapsack problem
cites work: Q3347319
cites work: A state-of-the-art review of parallel-machine scheduling research
cites work: An exact algorithm for the dual bin packing problem
cites work: A branch-and-bound algorithm for the two-dimensional vector packing problem
cites work: Approximation algorithms for combinatorial problems
cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
cites work: A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing
cites work: Q4290987
cites work: The Loading Problem
cites work: An algorithm for a class of loading problems
cites work: Capacitated Vehicle Routing on Trees
cites work: Branch-and-bound algorithms for the multi-product assembly line balancing problem
cites work: Lower bounds and reduction procedures for the bin packing problem
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: Q4495496
cites work: Applying tabu search with influential diversification to multiprocessor scheduling
cites work: SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
cites work: Maximizing the production rate in simple assembly line balancing -- A branch and bound procedure
description: scientific article; zbMATH DE number 1045748