Login / Signup
Solving a Weighted Set Covering Problem for Improving Algorithms for Cutting Stock Problems with Setup Costs by Solution Merging.
Benedikt Klocker
Günther R. Raidl
Published in:
EUROCAST (1) (2017)
Keyphrases
</>
set covering problem
cutting stock problems
combinatorial optimization
optimization problems
branch and bound algorithm
integer programming
efficient solutions
bi objective
computational complexity
solution quality
setup cost
set covering
genetic algorithm
learning algorithm
metaheuristic