Reformulation descent applied to circle packing problems
type: Item
instance of: scholarly article
title: Reformulation descent applied to circle packing problems
zbMATH Open document ID: 1066.90092
author: Nenad Mladenović
author: Frank Plastria
author: Dragan Urošević
published in: Computers \& Operations Research
publication date: 2005-04-21T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 2160318
zbMATH Keywords: Global optimization
zbMATH Keywords: Circle packing
zbMATH Keywords: Metaheuristics
zbMATH Keywords: Reformulation descent
zbMATH Keywords: Minos
describes a project that uses: MINOS
MaRDI profile type: Publication
full work available at URL: j.cor.2004.03.010
OpenAlex ID: W2058582911
cites work: Q3135847
cites work: Packing Cylinders into Cylindrical Containers
cites work: Der Mindestabstand von n in der Einheitskreisscheibe gelegenen Punkten
cites work: Solving the Continuous p-Dispersion Problem Using Non-linear Programming
cites work: Dense packings of congruent circles in a circle
cites work: Large-scale linearly constrained optimization
cites work: Q4739659
cites work: A new adaptive multi-start technique for combinatorial global optimizations
cites work: Variable neighborhood search for the p-median
cites work: Variable Neighborhood Search
cites work: Handbook of metaheuristics
cites work: Variable neighborhood search
cites work: Modified barrier functions (theory and methods)
Wikidata QID: Q57254153
DOI: 10.1016/J.COR.2004.03.010
description: scientific article; zbMATH DE number 2160318