Bison
From MaRDI portal
Software:29535
No author found.
Related Items (42)
Ranking lower bounds for the bin-packing problem ⋮ Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ 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 ⋮ 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 ⋮ On solving multiobjective bin packing problems using evolutionary particle swarm optimization ⋮ 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 ⋮ 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 ⋮ New lower bounds for the three-dimensional orthogonal bin packing problem ⋮ Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem ⋮ Multiple-source learning precedence graph concept for the automotive industry ⋮ Constraint Aggregation in Column Generation Models for Resource-Constrained Covering Problems ⋮ 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 ⋮ Bin packing problem with conflicts and item fragmentation ⋮ 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 ⋮ 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 ⋮ 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
This page was built for software: Bison
