Pages that link to "Item:Q4909118"

The following pages link to The Bin Packing Problem with Precedence Constraints (Q4909118):

Displaying 13 items.

• Procedures for the bin packing problem with precedence constraints (Q322561) (← links)
• Mathematical programming algorithms for bin packing problems with item fragmentation (Q336982) (← links)
• Exactly solving packing problems with fragmentation (Q342536) (← links)
• A branch and bound algorithm for project scheduling problem with spatial resource constraints (Q1666182) (← links)
• Packing-based branch-and-bound for discrete malleable task scheduling (Q2093190) (← links)
• A branch-and-price algorithm for the temporal bin packing problem (Q2337386) (← links)
• The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
• (Q3390778) (← links)
• Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation (Q5086008) (← links)
• Bin Packing Problem with Time Lags (Q5106420) (← links)
• Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems (Q5139850) (← links)
• R-SALSA: a branch, bound, and remember algorithm for the workload smoothing problem on simple assembly lines (Q6069213) (← links)
• Security-aware database migration planning (Q6154181) (← links)