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 32 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)
• Solving bin packing problems using VRPSolver models (Q2033390) (← links)
• Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost (Q2171594) (← links)
• Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
• Lower bounds for three-dimensional multiple-bin-size bin packing problems (Q2260892) (← links)
• Solving the variable size bin packing problem with discretized formulations (Q2462559) (← links)
• Simultaneously exploiting two formulations: an exact Benders decomposition approach (Q2664373) (← links)
• Exact solution of network flow models with strong relaxations (Q2689828) (← links)
• Cutting uncertain stock and vehicle routing in a sustainability forestry harvesting problem (Q2701176) (← links)
• Dual Inequalities for Stabilized Column Generation Revisited (Q2806874) (← links)
• The generalized assortment and best cutting stock length problems (Q3002687) (← links)
• One-dimensional relaxations and LP bounds for orthogonal packing (Q3401330) (← links)
• A Branch-and-Price Algorithm for the Multiple Knapsack Problem (Q5060791) (← links)
• Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems (Q5139850) (← links)
• An iterated greedy algorithm for the planning of yarn‐dyeing boilers (Q6060692) (← links)
• Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry (Q6106482) (← links)
• One-dimensional stock cutting resilient against singular random defects (Q6106587) (← links)
• A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts (Q6167663) (← links)
• Electric vehicle-based express service network design with recharging management: a branch-and-price approach (Q6551062) (← links)