Pages that link to "Item:Q342536"

The following pages link to Exactly solving packing problems with fragmentation (Q342536):

Displaying 10 items.

• Column generation for the variable cost and size bin packing problem with fragmentation (Q510930) (← links)
• Integer optimization with penalized fractional values: the knapsack case (Q1631508) (← links)
• Bin packing problem with conflicts and item fragmentation (Q2026980) (← links)
• New formulations for variable cost and size bin packing problems with item fragmentation (Q2414120) (← links)
• The bin packing problem with item fragmentation: a worst-case analysis (Q2414454) (← links)
• Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning (Q2668752) (← 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)
• Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems (Q5139850) (← links)
• EPTAS for the dual of splittable bin packing with cardinality constraint (Q6057843) (← links)