Pages that link to "Item:Q1429294"

The following pages link to Algorithms for packing and scheduling problems. (Abstract of thesis) (Q1429294):

Displaying 10 items.

• A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems (Q336709) (← links)
• Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items (Q490206) (← links)
• Relaxations and exact solution of the variable sized bin packing problem (Q535302) (← links)
• A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint (Q610980) (← links)
• A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem (Q941555) (← links)
• Heuristics for the variable sized bin-packing problem (Q1017465) (← links)
• New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems (Q1046097) (← links)
• Mixed-integer linear programming heuristics for the prepack optimization problem (Q1751183) (← links)
• A generalized bin packing problem for parcel delivery in last-mile logistics (Q1755394) (← links)
• Variable neighbourhood search for the variable sized bin packing problem (Q1762087) (← links)