The discrete ellipsoid covering problem: a discrete geometric programming approach

DOI10.1016/J.DAM.2012.10.016zbMath1327.52034OpenAlexW1994099138MaRDI QIDQ496677

Lucidio dos Anjos Formiga Cabral, Renan Vicente Pinto, Roberto Quirino do Nascimento, Ana Flávia Uzeda dos Santos Macambira

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

zbMATH Keywords

discrete optimizationgeometric programmingellipsoid coveringgamma knife

Mathematics Subject Classification ID

Nonlinear programming (90C30) Semi-infinite programming (90C34) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items (1)

A global interior point method for nonconvex geometric programming

Cites Work

• Unnamed Item
• Unnamed Item
• A new rectangle branch-and-pruning approach for generalized geometric programming
• A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation
• Optimal configuration of gamma ray machine radiosurgery units: The sphere covering subproblem
• A tutorial on geometric programming
• Investigation of path-following algorithms for signomial geometric programming problems
• A primal-dual infeasible-interior-point algorithm for linear programming
• An infeasible interior-point algorithm for solving primal and dual geometric programs
• Global optimization of signomial geometric programming using linear relaxation.
• Linearization method of global optimization for generalized geometric 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
• A Continuous Strategy to Solve a Class of Discrete Optimization Problems

This page was built for publication: The discrete ellipsoid covering problem: a discrete geometric programming approach