Abstract
The present paper introduces and studies a new combinatorial clustering model for the consolidation of farmland. While the general problem turns out to be NP-hard even in quite restricted cases, the Size-restricted Minimum-k-Star Group Partition problem is solvable in polynomial time. Based on this tractability result, we derive a general approximation algorithm which, as the mathematical analysis and economic evaluation shows, performs well in theory and practice.
| Original language | English |
|---|---|
| Pages (from-to) | 1-17 |
| Number of pages | 17 |
| Journal | Operational Research |
| Volume | 11 |
| Issue number | 1 |
| DOIs | |
| State | Published - May 2011 |
Keywords
- 0-1-Integer programming
- Clustering
- Combinatorial optimization
- Land consolidation
- Mathematical programming
- Partition
Fingerprint
Dive into the research topics of 'Constrained Minimum-k-Star Clustering and its application to the consolidation of farmland'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver