166   Artículos

 
en línea
Mansoor Davoodi and Justin M. Calabrese    
The optimal placement of healthcare facilities, including the placement of diagnostic test centers, plays a pivotal role in ensuring efficient and equitable access to healthcare services. However, the emergence of unique complexities in the context of a ... ver más
Revista: Algorithms    Formato: Electrónico

 
en línea
Wenjun Li, Xueying Yang, Chao Xu and Yongjie Yang    
In the directed co-graph edge-deletion problem, we are given a directed graph and an integer k, and the question is whether we can delete, at most, k edges so that the resulting graph is a directed co-graph. In this paper, we make two minor contributions... ver más
Revista: Algorithms    Formato: Electrónico

 
en línea
Angel A. Juan, Markus Rabe, Majsa Ammouriova, Javier Panadero, David Peidro and Daniel Riera    
In the field of logistics and transportation (L&T), this paper reviews the utilization of simheuristic algorithms to address NP-hard optimization problems under stochastic uncertainty. Then, the paper explores an extension of the simheuristics concep... ver más
Revista: Algorithms    Formato: Electrónico

 
en línea
Nikola Ivkovic, Robert Kudelic and Marin Golub    
Ant colony optimization (ACO) is a well-known class of swarm intelligence algorithms suitable for solving many NP-hard problems. An important component of such algorithms is a record of pheromone trails that reflect colonies? experiences with previously ... ver más
Revista: Algorithms    Formato: Electrónico

 
en línea
Bahram Alidaee, Haibo Wang and Lutfu S. Sua    
Quadratic unconstrained binary optimization (QUBO) is a classic NP-hard problem with an enormous number of applications. Local search strategy (LSS) is one of the most fundamental algorithmic concepts and has been successfully applied to a wide range of ... ver más
Revista: Algorithms    Formato: Electrónico

 
en línea
Juan F. Gomez, Antonio R. Uguina, Javier Panadero and Angel A. Juan    
The capacitated dispersion problem, which is a variant of the maximum diversity problem, aims to determine a set of elements within a network. These elements could symbolize, for instance, facilities in a supply chain or transmission nodes in a telecommu... ver más
Revista: Algorithms    Formato: Electrónico

 
en línea
Liping Zhang, Jing Li and Song Li    
A new spatial keyword group query method is proposed in this paper to address the existing issue of user privacy leakage and exclusion of preferences in road networks. The proposed query method is based on the IGgram-tree index and minimum hash set. To d... ver más
Revista: ISPRS International Journal of Geo-Information    Formato: Electrónico

 
en línea
Pavel V. Matrenin    
Planning tasks are important in construction, manufacturing, logistics, and education. At the same time, scheduling problems belong to the class of NP-hard optimization problems. Ant colony algorithm optimization is one of the most common swarm intellige... ver más
Revista: Algorithms    Formato: Electrónico

 
en línea
Marko Gulic and Martina ?u?kin    
In this paper, a hybrid nature-inspired metaheuristic algorithm based on the Genetic Algorithm and the African Buffalo Optimization is proposed. The hybrid approach adaptively switches between the Genetic Algorithm and the African Buffalo Optimization du... ver más
Revista: Algorithms    Formato: Electrónico

 
en línea
Amin Rahimi, Seyed Mojtaba Hejazi, Mostafa Zandieh and Mirpouya Mirmozaffari    
In this paper, the problem of finding an assignment of ?n? surgeries to be presented in one of ?m? identical operating rooms (ORs) or machines as the surgical case scheduling problem (SCSP) is proposed. Since ORs are among NP-hard optimization problems, ... ver más
Revista: Applied System Innovation    Formato: Electrónico

« Anterior     Página: 1 de 10     Siguiente »