Towards an efficient resolution of printing problems
From MaRDI portal
Publication:2339840
DOI10.1016/j.disopt.2014.09.001zbMath1308.90156OpenAlexW1987438531MaRDI QIDQ2339840
Arnaud Vandaele, Daniel Tuyttens
Publication date: 9 April 2015
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2014.09.001
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (5)
Two dimensional guillotine cutting stock and scheduling problem in printing industry ⋮ Two heuristics for the label printing problem ⋮ Logic-Based Benders Decomposition for Integrated Process Configuration and Production Planning Problems ⋮ A two-phase heuristic algorithm for the label printing problem ⋮ A hybrid simulated annealing/linear programming approach for the cover printing problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ad hoc heuristic for the cover printing problem
- A heuristic for the label printing problem
- 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
- Using a greedy random adaptative search procedure to solve the cover printing 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
- An annotated bibliography of GRASP-Part II: Applications
- Optimal job splitting on a multi-slot machine with applications in the printing industry
- An annotated bibliography of GRASP – Part I: Algorithms
- Handbook of metaheuristics
This page was built for publication: Towards an efficient resolution of printing problems
