BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
From MaRDI portal
Publication:1362971
DOI10.1016/S0305-0548(96)00082-2zbMATH Open0882.90113MaRDI QIDQ1362971FDOQ1362971
Authors: O. Diekmann 
Publication date: 7 August 1997
Published in: Computers \& Operations Research (Search for Journal in Brave)
Recommendations
- New heuristics for one-dimensional bin-packing
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Solving the one-dimensional bin packing problem with a weight annealing heuristic
- Two heuristics for the one-dimensional bin-packing problem
- Bin packing and cutting stock problems: mathematical models and exact algorithms
Cites Work
- Approximation algorithms for combinatorial problems
- Tabu Search—Part I
- SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Title not available (Why is that?)
- A state-of-the-art review of parallel-machine scheduling research
- Maximizing the production rate in simple assembly line balancing -- A branch and bound procedure
- Title not available (Why is that?)
- A branch-and-bound algorithm for the two-dimensional vector packing problem
- Tabu Search—Part II
- An exact algorithm for the dual bin packing problem
- Capacitated Vehicle Routing on Trees
- The Loading Problem
- Lower bounds and reduction procedures for the bin packing problem
- Heuristic algorithms for the multiple knapsack problem
- Branch-and-bound algorithms for the multi-product assembly line balancing problem
- Title not available (Why is that?)
- Applying tabu search with influential diversification to multiprocessor scheduling
- A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing
- An algorithm for a class of loading problems
Cited In (56)
- Security-aware database migration planning
- Augmented neural networks and problem structure-based heuristics for the bin-packing problem
- A Study of Bi-space Search for Solving the One-Dimensional Bin Packing Problem
- Local-search based heuristics for advertisement scheduling
- One-dimensional stock cutting resilient against singular random defects
- Solving the one-dimensional bin packing problem with a weight annealing heuristic
- Fast lifting procedures for the bin packing problem
- Lower and upper bounds for the bin packing problem with fragile objects
- Dual inequalities for stabilized column generation revisited
- Grouping evolution strategies: an effective approach for grouping problems
- A simulated annealing hyper-heuristic methodology for flexible decision support
- Orbital shrinking: theory and applications
- New symmetry-less ILP formulation for the classical one dimensional bin-packing problem
- Lower bounds for a bin packing problem with linear usage cost
- A two-stage packing problem procedure
- Balancing assembly lines with variable parallel workplaces: problem definition and effective solution procedure
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
- Solving robust bin-packing problems with a branch-and-price approach
- LP models for bin packing and cutting stock problems
- Efficient algorithms for the offline variable sized bin-packing problem
- Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- A grouping genetic algorithm with controlled gene transmission for the bin packing problem
- Energy-oriented scheduling based on evolutionary algorithms
- Bin packing and related problems: general arc-flow formulation with graph compression
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
- Homogeneous grouping of non-prime steel products for online auctions: a case study
- Bison
- Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem
- An improved typology of cutting and packing problems
- A new destructive bounding scheme for the bin packing problem
- Nature inspired genetic algorithms for hard packing problems
- Vector bin packing with heterogeneous bins: application to the machine reassignment problem
- New heuristics for one-dimensional bin-packing
- New bin packing fast lower bounds
- Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing
- Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths
- A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing
- Two heuristics for the one-dimensional bin-packing problem
- Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
- The capacity and distance constrained plant location problem
- On solving the double loading problem using a modified particle swarm optimization
- A particle swarm optimizer for grouping problems
- A pure quasi-human algorithm for solving the cuboid packing problem
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
- Ranking lower bounds for the bin-packing problem
- On solving multiobjective bin packing problems using evolutionary particle swarm optimization
- Characterizing the optimality gap and the optimal packings for the bin packing problem
- A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts
- BPPLIB: a library for bin packing and cutting stock problems
- Bin packing problem with conflicts and item fragmentation
- Multiple-source learning precedence graph concept for the automotive industry
- Packing-based branch-and-bound for discrete malleable task scheduling
- Optimization of a line-cutting procedure for ship hull construction by an effective tabu search
- Cutting optimization with variable-sized stock and inventory status data
Uses Software
This page was built for publication: BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362971)
