A continuous set covering problem as a quasidifferentiable optimization problem
DOI10.1080/02331938808843392zbMATH Open0665.90087OpenAlexW2080735481MaRDI QIDQ3818142FDOQ3818142
Authors: H. P. Jandl, K. G. Wieder 
Publication date: 1988
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331938808843392
Recommendations
- Solution of continuous problems of optimal covering with spheres using optimal set-partition theory
- Algorithms of optimal set covering on the planar R^2
- Optimization of multiple covering of a bounded set with circles
- Covering a compact polygonal set by identical circles
- On covering bounded sets by collections of circles of various radii
locally Lipschitz functionsset coveringquasidifferentiable optimizationDirichlet tessellationsfinite covering problems
Nonlinear programming (90C30) Combinatorial aspects of tessellation and tiling problems (05B45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Continuity and differentiation questions (26B05)
Cites Work
Cited In (6)
- On reserve and double covering problems for the sets with non-Euclidean metrics
- A generalized steepest descent method for continuously subdifferentiable functions
- Relation between set partitioning and set covering problems with quadratic fractional objective functions
- Solution of continuous problems of optimal covering with spheres using optimal set-partition theory
- Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization
- On necessary minimum conditions in quasidifferential calculus: independence of the specific choice of quasidifferentials
This page was built for publication: A continuous set covering problem as a quasidifferentiable optimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3818142)
