A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties
- Author
- DONGLEI DU1 ; RUIXING LU2 ; DACHUAN XU2
[1] Faculty of Business Administration, University of New Brunswick, Fredericton, NB, E3B 5A3, Canada
[2] Department of Applied Mathematics. Beijing University of Technology, 100 Pingleyuan, Chaoyang District, Beijing 100124, China - Source
Algorithmica. 2012, Vol 63, Num 1-2, pp 191-200, 10 p ; ref : 23 ref
- ISSN
- 0178-4617
- Scientific domain
- Computer science
- Publisher
- Springer, Heidelberg
- Publication country
- Germany
- Document type
- Article
- Language
- English
- Author keyword
- Approximation algorithm Facility location problem Submodular function
- Keyword (fr)
- Algorithme approximation Complexité calcul Ellipsoïde Fonction sous modulaire Isolement géographique Méthode polynomiale Méthode primale duale Méthode relaxation Optimisation combinatoire Problème combinatoire Problème localisation Programmation en nombres entiers Programmation linéaire Temps polynomial Localisation installation
- Keyword (en)
- Approximation algorithm Computational complexity Ellipsoid Submodular function Geographical isolation Polynomial method Primal dual method Relaxation method Combinatorial optimization Combinatorial problem Location problem Integer programming Linear programming Polynomial time Facility location
- Keyword (es)
- Algoritmo aproximación Complejidad computación Elipsoide Función submodular Aislamiento geográfico Método polinomial Método primal dual Método relajación Optimización combinatoria Problema combinatorio Problema localización Programación entera Programación lineal Tiempo polinomial Localización de instalaciones
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A03 Mathematical programming
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A04 Flows in networks. Combinatorial problems
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A15 Logistics
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A05 Algorithmics. Computability. Computer arithmetics
- Discipline
- Computer science : theoretical automation and systems Operational research. Management
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 25557211
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1007/s00453-011-9526-1 
https://dx.doi.org/10.1007/s00453-011-9526-1
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1007\/s00453-011-9526-1\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:97:\"A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties\";s:9:\"\u0000*\u0000jtitle\";s:12:\"Algorithmica\";s:9:\"\u0000*\u0000stitle\";s:12:\"Algorithmica\";s:7:\"\u0000*\u0000date\";s:4:\"2012\";s:9:\"\u0000*\u0000volume\";s:2:\"63\";s:8:\"\u0000*\u0000issue\";s:3:\"1-2\";s:8:\"\u0000*\u0000spage\";s:3:\"191\";s:8:\"\u0000*\u0000epage\";s:3:\"200\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0178-4617\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"DONGLEI DU\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:10:\"RUIXING LU\";i:1;s:10:\"DACHUAN XU\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:97:\"A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties\";s:8:\"\u0000*\u0000place\";s:10:\"Heidelberg\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"10\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1007\/s00453-011-9526-1\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:97:\"A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties\";s:9:\"\u0000*\u0000jtitle\";s:12:\"Algorithmica\";s:9:\"\u0000*\u0000stitle\";s:12:\"Algorithmica\";s:7:\"\u0000*\u0000date\";s:4:\"2012\";s:9:\"\u0000*\u0000volume\";s:2:\"63\";s:8:\"\u0000*\u0000issue\";s:3:\"1-2\";s:8:\"\u0000*\u0000spage\";s:3:\"191\";s:8:\"\u0000*\u0000epage\";s:3:\"200\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0178-4617\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"DONGLEI DU\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:10:\"RUIXING LU\";i:1;s:10:\"DACHUAN XU\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:97:\"A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties\";s:8:\"\u0000*\u0000place\";s:10:\"Heidelberg\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"10\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:25:\"10.1007\/s00453-011-9526-1\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1007\/s00453-011-9526-1\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:97:\"A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties\";s:9:\"\u0000*\u0000jtitle\";s:12:\"Algorithmica\";s:9:\"\u0000*\u0000stitle\";s:12:\"Algorithmica\";s:7:\"\u0000*\u0000date\";s:4:\"2012\";s:9:\"\u0000*\u0000volume\";s:2:\"63\";s:8:\"\u0000*\u0000issue\";s:3:\"1-2\";s:8:\"\u0000*\u0000spage\";s:3:\"191\";s:8:\"\u0000*\u0000epage\";s:3:\"200\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0178-4617\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"DONGLEI DU\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:10:\"RUIXING LU\";i:1;s:10:\"DACHUAN XU\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:97:\"A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties\";s:8:\"\u0000*\u0000place\";s:10:\"Heidelberg\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"10\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1007\/s00453-011-9526-1\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:97:\"A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties\";s:9:\"\u0000*\u0000jtitle\";s:12:\"Algorithmica\";s:9:\"\u0000*\u0000stitle\";s:12:\"Algorithmica\";s:7:\"\u0000*\u0000date\";s:4:\"2012\";s:9:\"\u0000*\u0000volume\";s:2:\"63\";s:8:\"\u0000*\u0000issue\";s:3:\"1-2\";s:8:\"\u0000*\u0000spage\";s:3:\"191\";s:8:\"\u0000*\u0000epage\";s:3:\"200\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0178-4617\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"DONGLEI DU\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:10:\"RUIXING LU\";i:1;s:10:\"DACHUAN XU\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:97:\"A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties\";s:8:\"\u0000*\u0000place\";s:10:\"Heidelberg\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"10\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1007\/s00453-011-9526-1\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:97:\"A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties\";s:9:\"\u0000*\u0000jtitle\";s:12:\"Algorithmica\";s:9:\"\u0000*\u0000stitle\";s:12:\"Algorithmica\";s:7:\"\u0000*\u0000date\";s:4:\"2012\";s:9:\"\u0000*\u0000volume\";s:2:\"63\";s:8:\"\u0000*\u0000issue\";s:3:\"1-2\";s:8:\"\u0000*\u0000spage\";s:3:\"191\";s:8:\"\u0000*\u0000epage\";s:3:\"200\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0178-4617\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:10:\"DONGLEI DU\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:10:\"RUIXING LU\";i:1;s:10:\"DACHUAN XU\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:97:\"A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties\";s:8:\"\u0000*\u0000place\";s:10:\"Heidelberg\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"10\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
