The discrete ellipsoid covering problem: a discrete geometric programming approach (Q496677): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4113605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tutorial on geometric programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5557595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual infeasible-interior-point algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infeasible interior-point algorithm for solving primal and dual geometric programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal configuration of gamma ray machine radiosurgery units: The sphere covering subproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Continuous Strategy to Solve a Class of Discrete Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of signomial geometric programming using linear relaxation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearization method of global optimization for generalized geometric programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new rectangle branch-and-pruning approach for generalized geometric programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic global optimization algorithm for generalized geometric programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Investigation of path-following algorithms for signomial geometric programming problems / rank
 
Normal rank

Revision as of 18:52, 10 July 2024

scientific article
Language Label Description Also known as
English
The discrete ellipsoid covering problem: a discrete geometric programming approach
scientific article

    Statements

    The discrete ellipsoid covering problem: a discrete geometric programming approach (English)
    0 references
    22 September 2015
    0 references
    discrete optimization
    0 references
    geometric programming
    0 references
    gamma knife
    0 references
    ellipsoid covering
    0 references

    Identifiers