Maximum-cover source location problems with objective edge-connectivity three
Year of publication: |
2009
|
---|---|
Authors: | Sugihara, Kenya ; Ito, Hiro |
Published in: |
Computational Statistics. - Springer. - Vol. 70.2009, 1, p. 183-193
|
Publisher: |
Springer |
Subject: | Maximum-cover source location problem | Polynomial-time algorithm | NP-hard |
-
Maximum-cover source location problems with objective edge-connectivity three
Sugihara, Kenya, (2009)
-
An exterior point polynomial-time algorithm for convex quadratic programming
Tian, Da, (2015)
-
An entire space polynomial-time algorithm for linear programming
Tian, Da, (2014)
- More ...
-
Maximum-cover source location problems with objective edge-connectivity three
Sugihara, Kenya, (2009)
-
Maximum-cover source location problems with objective edge-connectivity three
Sugihara, Kenya, (2009)
-
Maximum-cover source location problems with objective edge-connectivity three
Sugihara, Kenya, (2009)
- More ...