Bison
From MaRDI portal
Cited in
(56)- 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
- Balancing assembly lines with variable parallel workplaces: problem definition and effective solution procedure
- CDT
- PROGRESS
- CF-GGA
- EVE-OPT
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
- BPPLIB: a library for bin packing and cutting stock problems
- Lower bounds for a bin packing problem with linear usage cost
- Orbital shrinking: theory and applications
- Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
- 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
- MULKNAP
- Ranking lower bounds for the bin-packing problem
- libcgrpp
- SimCList
- Grouping evolution strategies: an effective approach for grouping problems
- Characterizing the optimality gap and the optimal packings for the bin packing problem
- Bin packing problem with conflicts and item fragmentation
- Packing-based branch-and-bound for discrete malleable task scheduling
- Homogeneous grouping of non-prime steel products for online auctions: a case study
- New lower bounds for the three-dimensional orthogonal bin packing problem
- Multiple-source learning precedence graph concept for the automotive industry
- A pure quasi-human algorithm for solving the cuboid packing problem
- CVRPSEP
- On solving multiobjective bin packing problems using evolutionary particle swarm optimization
- Efficient algorithms for the offline variable sized bin-packing problem
- Solving the one-dimensional bin packing problem with a weight annealing heuristic
- CVRPSP
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
- Fast lifting procedures for the bin packing problem
- SALBPGen
- CUTGEN1
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
- Dual inequalities for stabilized column generation revisited
- 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
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
- Vector bin packing with heterogeneous bins: application to the machine reassignment problem
- BPPLIB
- Algorithm 520
- Lower and upper bounds for the bin packing problem with fragile objects
- A simulated annealing hyper-heuristic methodology for flexible decision support
- On solving the double loading problem using a modified particle swarm optimization
- A particle swarm optimizer for grouping problems
- Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem
- DILS
- Constraint Aggregation in Column Generation Models for Resource-Constrained Covering Problems
- New heuristics for one-dimensional bin-packing
- A new destructive bounding scheme for the bin packing problem
- Nature inspired genetic algorithms for hard packing problems
- New bin packing fast lower bounds
- The capacity and distance constrained plant location problem
This page was built for software: Bison
