Pages that link to "Item:Q2026980"
From MaRDI portal
The following pages link to Bin packing problem with conflicts and item fragmentation (Q2026980):
Displaying 10 items.
- Mathematical programming algorithms for bin packing problems with item fragmentation (Q336982) (← links)
- Column generation for the variable cost and size bin packing problem with fragmentation (Q510930) (← links)
- Homogeneous grouping of non-prime steel products for online auctions: a case study (Q2159574) (← links)
- A threshold search based memetic algorithm for the disjunctively constrained knapsack problem (Q2669554) (← links)
- A MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation (Q2673554) (← links)
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
- EPTAS for the dual of splittable bin packing with cardinality constraint (Q6057843) (← links)
- A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts (Q6167663) (← links)
- Solving the set covering problem with conflicts on sets: a new parallel GRASP (Q6568410) (← links)
- Adaptive feasible and infeasible evolutionary search for the knapsack problem with forfeits (Q6659822) (← links)