Different formulations of the gray pattern problem and their optimal solutions

Jack Brimberg, Pawel Kalczynski and Zvi Drezner

European Journal of Operational Research, 2024, vol. 316, issue 1, 61-71

Abstract: The Gray Pattern Problem (GPP) requires selecting a given number (p) of pixels (or dots) within a central rectangle to be colored black (the remaining pixels remain white) to form a repeating pattern covering the plane that is as uniformly gray as possible. Taillard proposed the original model in 1995, which is based on the principle of minimization of entropy taken from physics. The aim of this paper is to present alternate formulations of the GPP inspired by dispersion models studied in location theory. We show that these variants have much greater tractability than the original model, while producing patterns of equivalent or better quality.

Keywords: p-dispersion models; Gray patterns; Models and solutions (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221724000882
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:316:y:2024:i:1:p:61-71

DOI: 10.1016/j.ejor.2024.01.048

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().