Using a greedy random adaptative search procedure to solve the cover printing problem

DOI10.1016/j.cor.2009.06.006zbMath1175.90343OpenAlexW2023583740MaRDI QIDQ1040963

Daniel Tuyttens, Arnaud Vandaele

Publication date: 27 November 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2009.06.006

zbMATH Keywords

metaheuristicsGRASPcombinatorial optimization problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (max. 100)

Two heuristics for the label printing problem ⋮ Ad hoc heuristic for the cover printing problem ⋮ A two-phase heuristic algorithm for the label printing problem ⋮ A hybrid simulated annealing/linear programming approach for the cover printing problem ⋮ Towards an efficient resolution of printing problems

Uses Software

• GRASP
• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A GRASP algorithm to solve the unicost set covering problem
• Genetic algorithms to solve the cover printing problem
• Reactive GRASP for the strip-packing problem
• New approaches for heuristic search: A bilateral linkage with artificial intelligence
• A probabilistic heuristic for a computationally difficult set covering problem
• Greedy randomized adaptive search procedures
• Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem
• Metaheuristics: A bibliography
• Handbook of metaheuristics

This page was built for publication: Using a greedy random adaptative search procedure to solve the cover printing problem