Bison

swMATH17681MaRDI QIDQ29535FDOQ29535

Author name not available (Why is that?)

Described by source

• BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem

Cited In (42)

• 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
• Lower bounds for a bin packing problem with linear usage cost
• Balancing assembly lines with variable parallel workplaces: problem definition and effective solution procedure
• New lower bounds for the three-dimensional orthogonal bin packing problem
• 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
• LP models for bin packing and cutting stock problems
• Efficient algorithms for the offline variable sized bin-packing problem
• Constraint Aggregation in Column Generation Models for Resource-Constrained Covering Problems
• 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
• 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
• Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem
• 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
• 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
• 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

This page was built for software: Bison