A continuous set covering problem as a quasidifferentiable optimization problem

DOI10.1080/02331938808843392zbMath0665.90087OpenAlexW2080735481MaRDI QIDQ3818142

K. G. Wieder, H. P. Jandl

Publication date: 1988

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938808843392

zbMATH Keywords

set coveringlocally Lipschitz functionsquasidifferentiable optimizationDirichlet tessellationsfinite covering problems

Mathematics Subject Classification ID

Nonlinear programming (90C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Continuity and differentiation questions (26B05) Combinatorial aspects of tessellation and tiling problems (05B45)

Related Items

On necessary minimum conditions in quasidifferential calculus: independence of the specific choice of quasidifferentials, Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization, On reserve and double covering problems for the sets with non-Euclidean metrics, Solution of continuous problems of optimal covering with spheres using optimal set-partition theory, A generalized steepest descent method for continuously subdifferentiable functions

Cites Work

• Unnamed Item
• On locally-Lipschitz quasi-differentiate functions in Banach-spaces
• Convex Analysis