Results 271 to 280 of about 18,556,180 (366)

An efficient variable neighborhood search approach for the facility location problem with the limited choice rule

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract One of the most common problems in the expansion of a company consists of deciding the most appropriate locations for their facilities. This decision problem, known as the facility location problem, has been studied from different perspectives, considering a number of different constraints.
Enrique García‐Galán   +2 more
wiley   +1 more source

Social polarization promoted by sparse higher-order interactions. [PDF]

open access: yesCommun Phys
Pérez-Martínez H   +5 more
europepmc   +1 more source

Sociedad de la información, e-Gobierno, e-Documento e interoperabilidad en el contexto de la globalización

open access: yes, 2019
La Tesis doctoral analizada el contexto general de la Sociedad de la Información y de la Sociedad del Conocimiento, y su impacto en la conformación del e-Gobierno a nivel global, con especial referencia a América Latina y Colombia. Se analizan con detalle los conceptos de e-Documento, e-Archivo, Interoperabilidad, gestión electrónica documental, todo ...
openaire   +1 more source

A fast metaheuristic approach for the planar multiple obnoxious facility location problem

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract The multiple obnoxious facility location problem is one of the most studied problems in the literature of the obnoxious facility location problems family. In this work, we propose an alternative algorithmic approach for this problem, based on an efficient metaheuristic procedure over a discretization of the plane based on Voronoi diagrams ...
Sergio Salazar   +2 more
wiley   +1 more source

Exploring the role of sample thickness for hyperspectral microscopy tissue discrimination through Monte Carlo simulations. [PDF]

open access: yesBiomed Opt Express
Quintana-Quintana L   +6 more
europepmc   +1 more source

An iterated greedy‐based metaheuristic with local search for the rank pricing problem

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract The rank pricing problem involves determining optimal prices for a set of products while accounting for customers' budgets and preferences. This study develops an iterated greedy‐based metaheuristic to efficiently solve this problem. The core idea is to generate a sequence of solutions by iteratively applying destruction and reconstruction ...
Herminia I. Calvete   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy