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-2zbMath0882.90113MaRDI QIDQ1362971
Publication date: 7 August 1997
Published in: Computers \& Operations Research (Search for Journal in Brave)
Related Items
Ranking lower bounds for the bin-packing problem, Bin packing and cutting stock problems: mathematical models and exact algorithms, An improved typology of cutting and packing problems, Energy-oriented scheduling based on evolutionary algorithms, A grouping genetic algorithm with controlled gene transmission for the bin packing problem, Vector bin packing with heterogeneous bins: application to the machine reassignment problem, Bin packing and related problems: general arc-flow formulation with graph compression, Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing, Homogeneous grouping of non-prime steel products for online auctions: a case study, New bin packing fast lower bounds, A new destructive bounding scheme for the bin packing problem, Nature inspired genetic algorithms for hard packing problems, Lower and upper bounds for the bin packing problem with fragile objects, One-dimensional stock cutting resilient against singular random defects, Security-aware database migration planning, On solving multiobjective bin packing problems using evolutionary particle swarm optimization, A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts, A simulated annealing hyper-heuristic methodology for flexible decision support, The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers, A two-stage packing problem procedure, Efficient algorithms for the offline variable sized bin-packing problem, On solving the double loading problem using a modified particle swarm optimization, A particle swarm optimizer for grouping problems, Solving the one-dimensional bin packing problem with a weight annealing heuristic, BPPLIB: a library for bin packing and cutting stock problems, The capacity and distance constrained plant location problem, Lower bounds for a bin packing problem with linear usage cost, Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem, Multiple-source learning precedence graph concept for the automotive industry, Grouping evolution strategies: an effective approach for grouping problems, A pure quasi-human algorithm for solving the cuboid packing problem, Characterizing the optimality gap and the optimal packings for the bin packing problem, New symmetry-less ILP formulation for the classical one dimensional 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 problem with conflicts and item fragmentation, Optimization of a line-cutting procedure for ship hull construction by an effective tabu search, Orbital shrinking: theory and applications, New heuristics for one-dimensional bin-packing, Dual Inequalities for Stabilized Column Generation Revisited, Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling, A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing, A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems, Two heuristics for the one-dimensional bin-packing problem, Solving robust bin-packing problems with a branch-and-price approach, Bison, Cutting optimization with variable-sized stock and inventory status data, Balancing assembly lines with variable parallel workplaces: problem definition and effective solution procedure, Augmented neural networks and problem structure-based heuristics for the bin-packing problem, Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems, State-of-the-art exact and heuristic solution procedures for simple assembly line balancing, LP models for bin packing and cutting stock problems, Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths, Packing-based branch-and-bound for discrete malleable task scheduling, Fast lifting procedures for the bin packing problem
Uses Software
Cites Work
- Lower bounds and reduction procedures for the bin packing problem
- A state-of-the-art review of parallel-machine scheduling research
- Heuristic algorithms for the multiple knapsack problem
- Branch-and-bound algorithms for the multi-product assembly line balancing problem
- Approximation algorithms for combinatorial problems
- Maximizing the production rate in simple assembly line balancing -- A branch and bound procedure
- A branch-and-bound algorithm for the two-dimensional vector packing problem
- Applying tabu search with influential diversification to multiprocessor scheduling
- An exact algorithm for the dual bin packing problem
- A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing
- Capacitated Vehicle Routing on Trees
- Tabu Search—Part I
- Tabu Search—Part II
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- An algorithm for a class of loading problems
- SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
- The Loading Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
