Pages that link to "Item:Q2468485"
From MaRDI portal
The following pages link to Solving the one-dimensional bin packing problem with a weight annealing heuristic (Q2468485):
Displaying 12 items.
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- A grouping genetic algorithm with controlled gene transmission for the bin packing problem (Q337402) (← links)
- Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing (Q342540) (← links)
- Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem (Q531429) (← links)
- Analytical and numerical comparisons of biogeography-based optimization and genetic algorithms (Q543817) (← links)
- A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function (Q1753400) (← links)
- Bin packing problem with conflicts and item fragmentation (Q2026980) (← links)
- A hybrid evolutionary algorithm for the offline Bin Packing Problem (Q2045610) (← links)
- The freight consolidation and containerization problem (Q2256168) (← links)
- Augmented neural networks and problem structure-based heuristics for the bin-packing problem (Q5497425) (← links)
- Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows (Q6106578) (← links)
- A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts (Q6167663) (← links)
