Results 41 to 50 of about 1,109,525 (329)
The recoverable robust facility location problem [PDF]
Transportation Research Part B: Methodological, 2015 This work deals with a facility location problem in which location and allocation (transportation) policy is defined in two stages such that a first-stage solution should be robust against the possible realizations (scenarios) of the input data that can only be revealed in a second stage.
Alvarez Miranda, Eduardo +2 more
openaire +3 more sources
Online Algorithmic Study of Facility Location Problems: A Survey
IEEE AccessFacility Location problems are one of the most prominent optimization problems in computer science, operations research, and combinatorial optimization. Their simple yet intrinsic structure has led to their widespread application in diverse fields, such ...
Christine Markarian
doaj +1 more source
Quantity decisions of two-stage competitive location model based on different location modes
Complex & Intelligent Systems, 2021 The facility location of a competing firm in a market has great importance in supply chain management. The two-stage competitive location model formulates the decision process of an entrant firm facing both location and price competition.
Yadong Li, Xuemei Li
doaj +1 more source
Solving Discrete Ordered Median Problems with Induced Order [PDF]
, 2020 Ordered median functions have been developed to model flexible discrete location problems. A weight is associated to the distance from a customer to its closest facility, depending on the position of that distance relative to the distances of all the ...
Domínguez-Merino, Enrique +1 more
core
Solving Competitive Location Problems with Social Media Data Based on Customers’ Local Sensitivities
ISPRS International Journal of Geo-Information, 2019 Competitive location problems (CLPs) are a crucial business concern. Evaluating customers’ sensitivities to different facility attractions (such as distance and business area) is the premise for solving a CLP. Currently, the development of location-
Wei Jiang +5 more
doaj +1 more source
On a class of intersection graphs [PDF]
, 2013 Given a directed graph D = (V,A) we define its intersection graph I(D) = (A,E) to be the graph having A as a node-set and two nodes of I(D) are adjacent if their corresponding arcs share a common node that is the tail of at least one of these arcs.
Baïou, Mourad +3 more
core
Local-Search based Approximation Algorithms for Mobile Facility Location Problems [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2013 We consider the mobile facility location (MFL) problem. We are given a set of facilities and clients located in a common metric space G = (V, c). The goal is to move each facility from its initial location to a destination (in V) and assign each client ...
Sara Ahmadian +2 more
semanticscholar +1 more source
Molecular Oncology, EarlyView.CDK11 inhibition stabilises the tumour suppressor p53 and triggers the production of an alternative p21WAF1 splice variant p21L, through the inactivation of the spliceosomal protein SF3B1. Unlike the canonical p21WAF1 protein, p21L is localised in the cytoplasm and has reduced cell cycle‐blocking activity.
Radovan Krejcir +12 more
wiley +1 more source
AIMS Mathematics, 2022 This paper studies the problem of facility location in a hybrid uncertain environment with both randomness and fuzziness. We establish a data-driven two-stage fuzzy random mixed integer optimization model, by considering the uncertainty of transportation
Zhimin Liu , Ripeng Huang, Songtao Shao
doaj +1 more source
Discrete Convex Functions on Graphs and Their Algorithmic Applications
, 2017 The present article is an exposition of a theory of discrete convex functions on certain graph structures, developed by the author in recent years.
A Bernáth +36 more
core +1 more source