This paper studies Minimum Spanning Trees under incomplete information for its vertices. We assume that no information is available on the precise placement of vertices so that it is only known that vertices belong to some neighborhoods that are second order cone representable and distances are measured with a ℓq-norm. Two mixed integer non...
-
June 22, 2017 (v1)PublicationUploaded on: March 27, 2023
-
June 27, 2016 (v1)Publication
Multiobjective combinatorial optimization deals with problems considering more than one viewpoint or scenario. The problem of aggregating multiple criteria to obtain a globalizing objective function is of special interest when the number of Pareto solutions becomes considerably large or when a single, meaningful solution is required. Ordered...
Uploaded on: March 27, 2023 -
June 23, 2015 (v1)Publication
In this paper we introduce the multi-period incremental service facility location problem where the goal is to set a number of new facilities over a finite time horizon so as to cover dynamically the demand of a given set of customers. We prove that the coefficient matrix of the allocation subproblem that results when fixing the set of...
Uploaded on: December 4, 2022 -
February 21, 2019 (v1)Publication
In this paper we introduce the Single Period Coverage Facility Location Problem. It is a multi-period discrete location problem in which each customer is serviced in exactly one period of the planning horizon. The locational decisions are made independently for each period, so that the facilities that are open need not be the same in different...
Uploaded on: March 27, 2023 -
February 21, 2019 (v1)Publication
The Multi-period Incremental Service Facility Location Problem, which was recently introduced, is a strategic problem for timing the location of facilities and the assignment of customers to facilities in a multi-period environment. Aiming at finding the strongest formulation for this problem, in this work we study three alternative...
Uploaded on: March 27, 2023