A primal-dual 3-approximation algorithm for the stochastic facility location problem with submodular penalties - Details

Author：

Xu, Dachuan (Xu, Dachuan.) (Scholars：徐大川) | Gao, Dongxiao (Gao, Dongxiao.) | Wu, Chenchen (Wu, Chenchen.)

Indexed by：

Scopus SCIE

Abstract：

In　this　paper,　we　consider　the　stochastic　facility　location　problem　with　submodular　penalties.　By　exploring　the　structural　properties　of　submodular　function,　we　present　a　primal-dual　-approximation　algorithm　for　the　problem.

Keyword：

90C27 approximation algorithm submodular function 68W25 90C10 stochastic facility location

Author Community：

[ 1 ] [Xu, Dachuan]Beijing Univ Technol, Dept Appl Math, Beijing, Peoples R China
[ 2 ] [Gao, Dongxiao]Beijing Univ Technol, Dept Appl Math, Beijing, Peoples R China
[ 3 ] [Wu, Chenchen]Nankai Univ, Sch Math Sci, Tianjin 300071, Peoples R China

Reprint Author's Address：

徐大川
[Xu, Dachuan]Beijing Univ Technol, Dept Appl Math, Beijing, Peoples R China

Email：

xudc@bjut.edu.cn

Show more details

Related Keywords：

A per-scenario bound for the two-stage stochastic facility location problem with linear penalty
2014，OPTIMIZATION
A primal-dual approximation algorithm for stochastic facility location problem with service installation costs
2011，FRONTIERS OF MATHEMATICS IN CHINA
An approximation algorithm for the k-level stochastic facility location problem
2010，OPERATIONS RESEARCH LETTERS
An improved per-scenario bound for the two-stage stochastic facility location problem
2015，SCIENCE CHINA-MATHEMATICS

Source ：

OPTIMIZATION

ISSN： 0233-1934

Year： 2015

Issue： 3

Volume： 64

Page： 617-626

2 . 2 0 0

JCR@2022

ESI Discipline： MATHEMATICS;

ESI HC Threshold：82

JCR Journal Grade：2

CAS Journal Grade：3

Cited Count：

WoS CC Cited Count： 0

SCOPUS Cited Count： 2

ESI Highly Cited Papers on the List： 0 Unfold All

WanFang Cited Count：

Chinese Cited Count：

30 Days PV： 1

Affiliated Colleges：

Get Fulltext

DOI Library Discovery Baidu Scholar Search Web of Science

Type
Departments

All Years Choose Year From to