arXiv (All)
open access
New spherical codes by tuning an annealing solver
The spherical code problem asks how to place $N$ points on a unit sphere in $D$ dimensions to maximize the smallest distance between two points. It is a non-smooth and non-convex max-min problem, where few problem sizes have known optimal solutions, some have constructions, but most still only have
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Improved Algorithms for the Remote Point Problem#1061397
- Optimization Methods#3505
- Optimization#209941
- An efficient implementation for solving the all pairs minimax path problem in an undirected dense graph#1062749
- A Novel Approximate Solution Method for Euclidean Steiner Tree Problem Based on Genetic Algorithm#481117
Record · ID 1354669
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive