Abstract. This paper is concerned with the connected facility location problem, which has been intensively studied in the literature. The un-derlying polytopes, however, have not been investigated. This work is devoted to the polytope associated with the asymmetric version of the problem. We first lift known facets of the related Steiner arborescence and of the facility location polytope. Then we describe other new families of facet-inducing inequalities. Finally, computational results are reported.
This paper explores three concepts: the k-center problem, some of its variants, and asymmetry. The k...
We study a few online and offline facility location and network design problems, including an offlin...
In this habilitation thesis several geometrical and combinatorial optimization problems are consider...
We analyze the polytope associated with a combinatorial problem that combines the Steiner tree probl...
We analyze the polytope associated with a combinatorial problem that combines the Steiner tree probl...
We study an uncapacitated facility location model where customers are served by facilities...
The Simple Plant Location Problem is a well-known (and NP-hard) combinatorial optimisation problem, ...
AbstractWe introduce new classes of facet-defining inequalities for the polytope Ppd associated with...
Given a set of customers, a set of potential facility locations and some inter-connection nodes, the...
AbstractThis article comprises the first theoretical and computational study on mixed integer progra...
We examine the feasibility polyhedron of the uncapacitated hub location problem (UHL) with multiple ...
Many problems arising in the area of telecommunication ask for solutions with a tree-star topology. ...
Location problems with extensive facilities represent a challenging field of research. According to ...
We examine the polyhedral structure of the convex hull of feasible solutions of the capacitated faci...
We study a prize-collecting version of the uncapacitated facility location problem and of the p-medi...
This paper explores three concepts: the k-center problem, some of its variants, and asymmetry. The k...
We study a few online and offline facility location and network design problems, including an offlin...
In this habilitation thesis several geometrical and combinatorial optimization problems are consider...
We analyze the polytope associated with a combinatorial problem that combines the Steiner tree probl...
We analyze the polytope associated with a combinatorial problem that combines the Steiner tree probl...
We study an uncapacitated facility location model where customers are served by facilities...
The Simple Plant Location Problem is a well-known (and NP-hard) combinatorial optimisation problem, ...
AbstractWe introduce new classes of facet-defining inequalities for the polytope Ppd associated with...
Given a set of customers, a set of potential facility locations and some inter-connection nodes, the...
AbstractThis article comprises the first theoretical and computational study on mixed integer progra...
We examine the feasibility polyhedron of the uncapacitated hub location problem (UHL) with multiple ...
Many problems arising in the area of telecommunication ask for solutions with a tree-star topology. ...
Location problems with extensive facilities represent a challenging field of research. According to ...
We examine the polyhedral structure of the convex hull of feasible solutions of the capacitated faci...
We study a prize-collecting version of the uncapacitated facility location problem and of the p-medi...
This paper explores three concepts: the k-center problem, some of its variants, and asymmetry. The k...
We study a few online and offline facility location and network design problems, including an offlin...
In this habilitation thesis several geometrical and combinatorial optimization problems are consider...