One‐dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model

Publisher: John Wiley & Sons Inc

E-ISSN: 1475-3995|23|1-2|47-63

ISSN: 0969-6016

Source: INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, Vol.23, Iss.1-2, 2016-01, pp. : 47-63

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract