Different formulations of the gray pattern problem and their optimal solutions

DOI10.1016/J.EJOR.2024.01.048MaRDI QIDQ6586256zbMATH OpenFDO

Authors Jack Brimberg, Pawel Kalczynski, Zvi Drezner

Publication date 13 August 2024

Published in European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

\(p\)-dispersion modelsgray patternsmodels and solutions

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A heuristic for the circle packing problem with a variety of containers
• A simple recipe for concise mixed 0-1 linearizations
• Assignment Problems and the Location of Economic Activities
• Comparison Of Four Models For dispersing Facilities
• Comparison of iterative searches for the quadratic assignment problem
• Computational aspects of the maximum diversity problem
• Exact algorithms for the solution of the grey pattern quadratic assignment problem
• Finding a cluster of points and the grey pattern quadratic assignment problem
• Finding optimal solutions to several gray pattern instances
• Iterated tabu search for the maximum diversity problem
• Lagrangian solution of maximum dispersion problems
• More optimal packings of equal circles in a square
• New approaches to circle packing in a square. With program codes.
• New results in the packing of equal circles in a square
• Packing equal circles in a square: A deterministic global optimization approach
• QAPLIB - a quadratic assignment problem library
• Solving the Continuous p-Dispersion Problem Using Non-linear Programming
• The equitable dispersion problem
• The repeated p-dispersion problem

This page was built for publication: Different formulations of the gray pattern problem and their optimal solutions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6586256)