Subsea field layout optimization (part II)–the location-allocation problem of manifolds
Authors:
- Haoge LiuHLHaoge Liu
- Tor Berge GjersvikTGTor Berge Gjersvik
- Audun FaanesAFAudun Faanes
Open Access
- 1 January 2022
- journal article
- research article
- Published by Elsevier in Journal of Petroleum Science and Engineering
- Vol. 208
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Exact Algorithms for 2-Clustering with Size Constraints in the Euclidean Plane2015
- A mathematical model for subsea wells partition in the layout of cluster manifoldsApplied Ocean Research, 2012
- Data clustering with size constraintsKnowledge-Based Systems, 2010
- Least squares quantization in PCMIEEE Transactions on Information Theory, 1982
- Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopesThe Computer Journal, 1981
- Computing Dirichlet tessellationsThe Computer Journal, 1981
- Algorithms for updating minimal spanning treesJournal of Computer and System Sciences, 1978
- Transforming triangulationsDiscrete Mathematics, 1972
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957
- On the shortest spanning subtree of a graph and the traveling salesman problemProceedings of the American Mathematical Society, 1956