Pages that link to "Item:Q941555"

The following pages link to A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem (Q941555):

Displaying 14 items.

• An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling (Q342571) (← 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 note on branch-and-cut-and-price (Q613321) (← links)
• Classification and literature review of integrated lot-sizing and cutting stock problems (Q724044) (← links)
• Stabilized branch-and-price algorithms for vector packing problems (Q724108) (← links)
• The one-dimensional cutting stock problem with due dates (Q1038325) (← links)
• Strips minimization in two-dimensional cutting stock of circular items (Q1040959) (← links)
• Exact algorithms for the bin packing problem with fragile objects (Q1662100) (← links)
• A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems (Q1754107) (← links)
• The min-conflict packing problem (Q1761135) (← links)
• LP bounds in various constraint programming approaches for orthogonal packing (Q1761178) (← links)
• Efficient algorithms for real-life instances of the variable size bin packing problem (Q1761234) (← links)