Approximation algorithms for the vertex k-center problem: Survey and experimental evaluation
The vertex k-center problem is a classical NP-Hard optimization problem with application to
Facility Location and Clustering among others. This problem consists in finding a subset of …
Facility Location and Clustering among others. This problem consists in finding a subset of …
When a worse approximation factor gives better performance: a 3-approximation algorithm for the vertex k-center problem
The vertex k-center selection problem is a well known NP-Hard minimization problem that
can not be solved in polynomial time within a ρ< 2 ρ< 2 approximation factor, unless P= NP …
can not be solved in polynomial time within a ρ< 2 ρ< 2 approximation factor, unless P= NP …
A vehicle routing problem solved through some metaheuristics procedures: A case study
This study presents a Vehicle Routing Problem solved through some metaheuristics
procedures. A two-phase methodology was used for that: 1) defining clusters of demand …
procedures. A two-phase methodology was used for that: 1) defining clusters of demand …
Local search algorithms for the vertex k-center problem
The vertex k-center problem is a classical NP-Hard problem with applications to Clustering
and Facility Location. It has been shown that this problem cannot be solved within a ρ&2 …
and Facility Location. It has been shown that this problem cannot be solved within a ρ&2 …
[PDF][PDF] An analysis between exact and approximate algorithms for the k-center problem in graphs
This research focuses on the k-center problem and its applications. Different methods for
solving this problem are analyzed. The implementations of an exact algorithm and of an …
solving this problem are analyzed. The implementations of an exact algorithm and of an …
Solution to the multiple products transportation problem: linear programming optimization with Excel Solver
LC Sanchez, J Herrera - IEEE Latin America Transactions, 2016 - ieeexplore.ieee.org
Transport model is an algorithm recognized and applied in logistics processes product
distribution in organizations. The multiple forms of solution are algorithmically and …
distribution in organizations. The multiple forms of solution are algorithmically and …
Optimal multi-base-station selection for belt-area wireless sensor networks
Z Duan, X Wei, J Han, G Yang, Y Lu - IEEE Access, 2019 - ieeexplore.ieee.org
Since underground environments, such as urban subways, tunnels, underground pipe
corridors, and mine roadways, etc., are complex and changeable, the software functions of …
corridors, and mine roadways, etc., are complex and changeable, the software functions of …