Relaxarea semidefinită a problemei amplasării utilajelor industriale

Abstract

In this paper the facility location problem is reformulated as a problem of quadratic programming with quadratic constraints. Semidefinite relaxation for considered problem is presented. The theoretical results obtained have interesting applications. in combinatorial problems.