The repeated p-dispersion problem
From MaRDI portal
Publication:6155626
Recommendations
Cites work
- A heuristic for the circle packing problem with a variety of containers
- Assignment Problems and the Location of Economic Activities
- Comparison of iterative searches for the quadratic assignment problem
- Exact algorithms for the solution of the grey pattern quadratic assignment problem
- Finding optimal solutions to several gray pattern instances
- scientific article; zbMATH DE number 4123493 (Why is no real title available?)
- 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
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming
- Solving the Continuous p-Dispersion Problem Using Non-linear Programming
Cited in
(3)
This page was built for publication: The repeated p-dispersion problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6155626)