Solving the Continuous p-Dispersion Problem Using Non-linear Programming

DOI10.1057/jors.1995.70zbMath0830.90088OpenAlexW2056270368MaRDI QIDQ4838220

Zvi Drezner, Erhan Erkut

Publication date: 1 August 1995

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1995.70

zbMATH Keywords

circle- packinglocation of pointsmaximally dispersed points is a convex space

Mathematics Subject Classification ID

Continuous location (90B85) Nonlinear programming (90C30)

Related Items

Dense packing of congruent circles in free-form non-convex containers, Packing two disks in a polygon, Review of obnoxious facilities location problems, Continuous approximation formulas for location problems, Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming, The repeated p-dispersion problem, Model development and solver demonstrations using randomized test problems, Solving circle packing problems by global optimization: numerical results and industrial applications, Disk packing for the estimation of the size of a wire bundle, Reformulation descent applied to circle packing problems, The conditional \(p\)-dispersion problem, Convex maximization formulation of general sphere packing problem, Repulsion-based p-dispersion with distance constraints in non-convex polygons, Approximate solutions of continuous dispersion problems