Zobrazeno 1 - 10
of 236
pro vyhledávání: '"Metric k-center"'
Publikováno v:
Journal of Combinatorial Optimization. 40:848-860
In this paper, we consider the $$\tau $$ -relaxed soft capacitated facility location problem ( $$\tau $$ -relaxed SCFLP), which extends several well-known facility location problems like the squared metric soft capacitated facility location problem (
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4a1a2ac154e50c1f86beca523d2b4ec4
https://doi.org/10.1007/s10878-020-00631-y
https://doi.org/10.1007/s10878-020-00631-y
Publikováno v:
Discrete Applied Mathematics. 264:208-217
Facility location problem is one of the most classical NP-hard problems in combinatorial optimization. In the metric facility location problem (MFLP), we are given a set of facilities, a set of clients and the metric distances between facilities and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c326b9a186b9f77e727f369fe2498076
https://doi.org/10.1016/j.dam.2019.03.013
https://doi.org/10.1016/j.dam.2019.03.013
Publikováno v:
Journal of Combinatorial Optimization. 35:1168-1184
In this paper, we introduce a squared metric k-facility location problem (SM-k-FLP) which is a generalization of the squared metric facility location problem and k-facility location problem (k-FLP). In the SM-k-FLP, we are given a client set $$\mathc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5f1759ea2488e9839b73ff37232ce7d8
https://doi.org/10.1007/s10878-018-0261-2
https://doi.org/10.1007/s10878-018-0261-2
Publikováno v:
INFORMS Journal on Computing. 30:124-136
We consider the supply chain problem of minimizing ordering, distribution, and inventory holding costs of a supply chain formed by a set of warehouses and retailers over a finite time horizon, which we call the production and distribution problem. Th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::00b569912e459a4b1d5cfabc440d7c82
https://doi.org/10.1287/ijoc.2017.0769
https://doi.org/10.1287/ijoc.2017.0769
Publikováno v:
Neural Processing Letters. 48:1335-1345
Learning a proper distance metric is an important problem in document classification, because the similarities of samples in many problems are usually measured by distance metric. In this paper, we address the nonlinear metric leaning problem with ap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aa4091561c5ac9279d7065d31e15a388
https://doi.org/10.1007/s11063-017-9654-y
https://doi.org/10.1007/s11063-017-9654-y
Coupled fixed point theorems in complete metric spaces endowed with a directed graph and application
Publikováno v:
Open Mathematics, Vol 15, Iss 1, Pp 734-744 (2017)
The purpose of this paper is to present some existence results for coupled fixed point of a (φ,ψ) —contractive condition for mixed monotone operators in metric spaces endowed with a directed graph. Our results generalize the results obtained by J
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::791d7aac9e0d1d2324a6a263ea001a98
https://doaj.org/article/ff88f68c1acd4d07803c380d3ed838a7
https://doaj.org/article/ff88f68c1acd4d07803c380d3ed838a7
Publikováno v:
Applied Mathematics and Computation. 300:60-69
Given a connected graph G = ( V , E ) , a set S ⊆ V is a k-metric generator for G if for any two different vertices u, v ∈ V, there exist at least k vertices w 1 , … , w k ∈ S such that dG(u, wi) ≠ dG(v, wi) for every i ∈ { 1 , … , k }
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0004aa787f2225d29cb7f032182a3d4c
https://doi.org/10.1016/j.amc.2016.12.005
https://doi.org/10.1016/j.amc.2016.12.005
Publikováno v:
The Journal of Nonlinear Sciences and Applications. 10:1695-1708
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::89ddc42acd400e60d83be9987c3fea01
https://doi.org/10.22436/jnsa.010.04.32
https://doi.org/10.22436/jnsa.010.04.32
Publikováno v:
Discrete Applied Mathematics. 220:68-79
Let G be a graph and u , v be any two distinct vertices of G . A vertex w of G resolves u and v if the distance between u and w does not equal the distance between v and w . A set W of vertices of G is a resolving set for G if every pair of vertices
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1a4dcacbf5d7d49e29cedacff19cbc20
https://doi.org/10.1016/j.dam.2016.12.020
https://doi.org/10.1016/j.dam.2016.12.020
Autor:
Diaz, Josep, Pottonen, Olli, Serna, Maria, van Leeuwen, E.J., Sub Algorithms and Complexity, Algorithmic Systems
Publikováno v:
Journal of Computer and System Sciences, 83(1), 132. Academic Press Inc.
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
The metric dimension of a graph $G$ is the size of a smallest subset $L \subseteq V(G)$ such that for any $x,y \in V(G)$ with $x\not= y$ there is a $z \in L$ such that the graph distance between $x$ and $z$ differs from the graph distance between $y$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::99371153162a10d6f690a6c9a0560f24
https://doi.org/10.1016/j.jcss.2016.06.006
https://doi.org/10.1016/j.jcss.2016.06.006