Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Gaidi Li"'
Publikováno v:
International Journal of Foundations of Computer Science. :1-13
In this paper, we propose a concept of a lattice pseudo-submodular (LPS) function and consider maximizing a monotone continuous real LPS function [Formula: see text] under a convex polytope constraint. The concept of LPS function was proposed to desc
Publikováno v:
Journal of Combinatorial Optimization. 44:3212-3232
Publikováno v:
Journal of Combinatorial Optimization. 45
Publikováno v:
Parallel and Distributed Computing, Applications and Technologies ISBN: 9783030967710
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0d8e205a94a12e0371cc814ca0fbe469
https://doi.org/10.1007/978-3-030-96772-7_41
https://doi.org/10.1007/978-3-030-96772-7_41
Publikováno v:
Algorithmic Aspects in Information and Management ISBN: 9783030931759
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0e14fe0af60d2c6ff07079ca6b9a78f0
https://doi.org/10.1007/978-3-030-93176-6_19
https://doi.org/10.1007/978-3-030-93176-6_19
Publikováno v:
Algorithmic Aspects in Information and Management ISBN: 9783030931759
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::99f761c16d068f5c17a5add920794f07
https://doi.org/10.1007/978-3-030-93176-6_2
https://doi.org/10.1007/978-3-030-93176-6_2
Publikováno v:
Acta Mathematicae Applicatae Sinica, English Series. 30:187-192
In this paper, we study the dynamic facility location problem with submodular penalties (DFLPSP). We present a combinatorial primal-dual 3-approximation algorithm for the DFLPSP.
Publikováno v:
Science China Information Sciences. 57:1-9
Multi-level economic lot-sizing models have been extensively investigated under different multi-level structure assumptions. In this paper, we consider the cooperative game associated with the multi-level economic lot-sizing problem. We present a cos
Publikováno v:
Journal of Industrial and Management Optimization. 8:521-529
In this paper, we consider the $k$-level facility location problem with submodular penalties ($k$-FLPSP). We propose a primal-dual $6$-approximation (combinatorial) algorithm for the $k$-FLPSP.
Publikováno v:
Journal of Global Optimization. 56:1325-1334
In this paper, we present a cost-sharing scheme for the concave facility location game by exploring the concavity structure. We show that it is cross-monotonic and competitive, and recovers 1/3 fraction of the total cost.