Pages that link to "Item:Q1018262"
From MaRDI portal
The following pages link to Two heuristics for the one-dimensional bin-packing problem (Q1018262):
Displaying 8 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)
- Artificial bee colony algorithm merged with pheromone communication mechanism for the 0-1 multidimensional knapsack problem (Q474490) (← links)
- Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem (Q531429) (← links)
- A hybrid evolutionary algorithm for the offline Bin Packing Problem (Q2045610) (← links)
- A metaheuristic for the fixed job scheduling problem under spread time constraints (Q2654393) (← links)
- Security-aware database migration planning (Q6154181) (← links)
