Name
Abstract | ||
|---|---|---|
•A two-stage capacitated facility location problem is studied.•A new solution scheme is proposed to solve the problem to optimality.•The method combines cutting plane method, local branching and kernel search.•The method significantly outperforms existing methods in the literature. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.ejor.2018.11.062 | European Journal of Operational Research |
Keywords | Field | DocType |
Location,Cut-and-solve,Local branching,Kernel search,Cutting planes | Kernel (linear algebra),Mathematical optimization,Cutting-plane method,Disjoint sets,Upper and lower bounds,Facility location problem,Partition (number theory),Mathematics,Branching (version control) | Journal |
Volume | Issue | ISSN |
275 | 2 | 0377-2217 |
Citations | PageRank | References |
1 | 0.36 | 22 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhen Yang | 1 | 17 | 3.09 |
| Haoxun Chen | 2 | 773 | 60.23 |
| Feng Chu | 3 | 1030 | 78.80 |
| Nengmin Wang | 4 | 69 | 12.60 |