A continuous set covering problem as a quasidifferentiable optimization problem

1 January 1988

journal article
research article
Published by Taylor & Francis in Optimization

Vol. 19 (6) , 781-802
https://doi.org/10.1080/02331938808843392

Abstract

In this paper we present an algorithm to solve a family of finite covering problems in . Given a compact, finitely convex decomposable set and an integer we are looking for the centers and the minimal radius of m balls with the property . It will be shown that this problem can be reduced to the computation of Dirichtlet tessellations (Voronoi sets) and the computation of minima of quasidifferentiable optimization problems.

Keywords

SET COVERING
VORONI SETS
DIRICHLET TESSELLATION
QUASIDIFFERENTIABLE FUNCTIONS
LOCALLY LIPSCHITZ FUNCTIONS
PRIMARY: 90 C 30
SECONDARY: 26 B 05

This publication has 3 references indexed in Scilit:

On locally-Lipschitz quasi-differentiate functions in Banach-spaces
Optimization, 1986
Quasidifferential Calculus
Published by Springer Nature ,1986
Convex Analysis
Published by Walter de Gruyter GmbH ,1970