The discrete ellipsoid covering problem: a discrete geometric programming approach
DOI10.1016/J.DAM.2012.10.016zbMATH Open1327.52034OpenAlexW1994099138MaRDI QIDQ496677FDOQ496677
Authors: Roberto Quirino Do Nascimento, Ana Flávia Uzeda dos Santos Macambira, Lucidio dos Anjos Formiga Cabral, Renan Vicente Pinto 
Publication date: 22 September 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.10.016
Recommendations
- A model to the ellipsoidal filling problem
- A new penalty/stochastic approach to an application of the covering problem: the gamma knife treatment
- New proposals for modelling and solving the problem of covering solids using spheres of different radii
- Covering problems with polyellipsoids: a location analysis perspective
- Covering an ellipsoid with equal balls
Nonlinear programming (90C30) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Semi-infinite programming (90C34)
Cites Work
- A tutorial on geometric programming
- Global optimization of signomial geometric programming using linear relaxation.
- A new rectangle branch-and-pruning approach for generalized geometric programming
- A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation
- Linearization method of global optimization for generalized geometric programming
- A primal-dual infeasible-interior-point algorithm for linear programming
- Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D
- A deterministic global optimization algorithm for generalized geometric programming
- An infeasible interior-point algorithm for solving primal and dual geometric programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal configuration of gamma ray machine radiosurgery units: The sphere covering subproblem
- Investigation of path-following algorithms for signomial geometric programming problems
- A continuous strategy to solve a class of discrete optimization problems
Cited In (4)
- A global interior point method for nonconvex geometric programming
- A model to the ellipsoidal filling problem
- Deterministic and stochastic global optimization techniques for planar covering with ellipses problems
- A new penalty/stochastic approach to an application of the covering problem: the gamma knife treatment
This page was built for publication: The discrete ellipsoid covering problem: a discrete geometric programming approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496677)
