Shor's \(r\)-algorithms: theory and practice
From MaRDI portal
Publication:1797560
DOI10.1007/978-3-319-68640-0_24zbMath1398.90096OpenAlexW2771267256MaRDI QIDQ1797560
Publication date: 22 October 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-68640-0_24
Related Items (11)
Parallel computing technologies for solving optimization problems of geometric design ⋮ Sparse balanced layout of ellipsoids ⋮ Proportional packing of circles in a circular container ⋮ Solving a two-stage continuous-discrete problem of optimal partition-allocation with a given position of the centers of subsets ⋮ Theory and methods of Euclidian combinatorial optimization: current status and prospects ⋮ Constructing the external contour of the Frankl nozzle using S-shaped curves with quadratic distribution of the curvature ⋮ Formalizing spatial configuration optimization problems with the use of a special function class ⋮ Sparse balanced layout of spherical voids in three-dimensional domains ⋮ Application of the theory of optimal set partitioning for constructing fuzzy Voronoi diagrams ⋮ Lattice coverage of cuboid with minimum number of hemispheres ⋮ A penalty approach to linear programs with many two-sided constraints
This page was built for publication: Shor's \(r\)-algorithms: theory and practice
