A hybrid simulated annealing/linear programming approach for the cover printing problem
From MaRDI portal
Publication:1721187
DOI10.1155/2018/6193649zbMath1427.90130OpenAlexW2888877241MaRDI QIDQ1721187
David Romero, Federico Alonso-Pecina
Publication date: 8 February 2019
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2018/6193649
Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
Two heuristics for the label printing problem ⋮ A two-phase heuristic algorithm for the label printing problem
Cites Work
- Ad hoc heuristic for the cover printing problem
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
- A heuristic for the label printing problem
- Genetic algorithms to solve the cover printing problem
- Using a greedy random adaptative search procedure to solve the cover printing problem
- Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem
- Towards an efficient resolution of printing problems
- An optimization model to determine master designs and runs for advertisement printing
- Optimal job splitting on a multi-slot machine with applications in the printing industry
- Tabu Search—Part I
- Linear programming. Foundations and extensions
- Computational Science and Its Applications – ICCSA 2004
This page was built for publication: A hybrid simulated annealing/linear programming approach for the cover printing problem
