After giving a suitable model for the cutting strips problem, we present a branch and price algorithm for it by combining the column generation technique and the branch and bound method with LP relaxations. Some ...After giving a suitable model for the cutting strips problem, we present a branch and price algorithm for it by combining the column generation technique and the branch and bound method with LP relaxations. Some theoretical issues and implementation details about the algorithm are discussed, including the solution of the pricing subproblem, the quality of LP relaxations, the branching scheme as well as the column management. Finally, preliminary computational experience is reported.展开更多
文摘After giving a suitable model for the cutting strips problem, we present a branch and price algorithm for it by combining the column generation technique and the branch and bound method with LP relaxations. Some theoretical issues and implementation details about the algorithm are discussed, including the solution of the pricing subproblem, the quality of LP relaxations, the branching scheme as well as the column management. Finally, preliminary computational experience is reported.
