A hybrid simulated annealing/linear programming approach for the cover printing problem
DOI10.1155/2018/6193649zbMATH Open1427.90130OpenAlexW2888877241MaRDI QIDQ1721187FDOQ1721187
Authors: Federico Alonso-Pecina, David Romero 
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
Recommendations
- Using a greedy random adaptative search procedure to solve the cover printing problem
- Ad hoc heuristic for the cover printing problem
- Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
- A simulated annealing with variable neighborhood search approach to construct mixed covering arrays
- A simulated annealing algorithm for dynamic layout problem
- Construction of mixed covering arrays using a combination of simulated annealing and variable neighborhood search
- Genetic algorithms to solve the cover printing problem
- A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems
Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Tabu Search—Part I
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
- Linear programming. Foundations and extensions
- 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
- 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
- Ad hoc heuristic for the cover printing problem
- A heuristic for the label printing problem
- Genetic algorithms to solve the cover printing problem
- Towards an efficient resolution of printing problems
- Computational Science and Its Applications – ICCSA 2004
Cited In (6)
- Towards an efficient resolution of printing problems
- Ad hoc heuristic for the cover printing problem
- Genetic algorithms to solve the cover printing problem
- Two heuristics for the label printing problem
- Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem
- A two-phase heuristic algorithm for the label printing problem
This page was built for publication: A hybrid simulated annealing/linear programming approach for the cover printing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1721187)
