We address the linear relaxation of the "one dimensional cutting stock problem", which is among the most investigated problems in combinatorial optimization. We provide a new formulation based on hypergraphs and propose a solution approach based on min cost hyperflows. The problem structure allows to tailor the general algorithm whose efficiency is supported by computational results on benchmarck generator instances.
The Cutting Stock problem: a new model based on hypergraph flows
NONATO, Maddalena;
1995
Abstract
We address the linear relaxation of the "one dimensional cutting stock problem", which is among the most investigated problems in combinatorial optimization. We provide a new formulation based on hypergraphs and propose a solution approach based on min cost hyperflows. The problem structure allows to tailor the general algorithm whose efficiency is supported by computational results on benchmarck generator instances.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in SFERA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
