A hybrid heuristic for the rectilinear picture compression problem

DOI10.1007/s10288-022-00515-3zbMath1519.90121OpenAlexW4293084055MaRDI QIDQ6097853

Javier Marenco, Ivo Koch

Publication date: 7 June 2023

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-022-00515-3

zbMATH Keywords

heuristicsinteger programmingcompression of monochromatic imagesrectilinear picture compression problem

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Complexities of efficient solutions of rectilinear polygon cover problems
• Covering orthogonal polygons with star polygons: The perfect graph approach
• Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles
• Approximation algorithms for combinatorial problems
• On the ratio of optimal integral and fractional covers
• Almost optimal set covers in finite VC-dimension
• Performance Guarantees on a Sweep-Line Heuristic for Covering Rectilinear Polygons with Rectangles
• Perfect Graphs and Orthogonally Convex Covers
• Covering Rectilinear Polygons with Axis-Parallel Rectangles
• Covering Regions by Rectangles
• Evaluating Learning Algorithms
• Experimental and Efficient Algorithms

This page was built for publication: A hybrid heuristic for the rectilinear picture compression problem