{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T12:08:29Z","timestamp":1775650109133,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540262244","type":"print"},{"value":"9783540324409","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496199_48","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T10:29:15Z","timestamp":1279103355000},"page":"450-459","source":"Crossref","is-referenced-by-count":1,"title":["Point Sets and Frame Algorithms in Management"],"prefix":"10.1007","author":[{"given":"Jos\u00e9 H.","family":"Dul\u00e1","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"48_CR1","unstructured":"Fukuda, K.: Frequently asked questions in polyhedral computation (2000), http:\/\/www.cs.mcgill.ca\/~fukuda\/soft\/polyfaq\/"},{"key":"48_CR2","volume-title":"Monographs in Theoretical Computer Science","author":"H. Edelsbrunner","year":"1987","unstructured":"Edelsbrunner, H.: Algorithms in combinatorial geometry. In: Monographs in Theoretical Computer Science, vol.\u00a010, Springer, New York (1987)"},{"key":"48_CR3","unstructured":"Rosen, J.B., Xue, G.L., Phillips, A.T.: Efficient computation of extreme points of convex hulls in $\\Re^d$ . In: Pardalos, P.M. (ed.) Advances in Optimization and Parallel Computing, pp. 267\u2013292. North Holland, Amsterdam (1992)"},{"key":"48_CR4","first-page":"298","volume-title":"Activity Analysis of Production and Allocation","author":"M. Gerstenhaber","year":"1951","unstructured":"Gerstenhaber, M.: Theory of convex polyhedral cones. In: Koopmans, T.C. (ed.) Activity Analysis of Production and Allocation, pp. 298\u2013316. Chapman and Hall, London (1951)"},{"key":"48_CR5","unstructured":"Application Development Tools. In: IMSL Stat Library, Visual Numerics, Inc., Houston (1994)"},{"key":"48_CR6","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1016\/0377-2217(94)00366-1","volume":"92","author":"J.H. Dul\u00e1","year":"1996","unstructured":"Dul\u00e1, J.H., Helgason, R.V.: A new procedure for identifying the frame of the convex hull of a finite collection of points in multidimensional space. Eur. J. Oper. Res.\u00a092, 352\u2013367 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"48_CR7","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L.: More output-sensitive geometric algorithms. In: Proc. 35th IEEE Sympos. Found. of Comput. Sci., Santa Fe, NM, pp. 695\u2013702 (1996)","DOI":"10.1109\/SFCS.1994.365723"},{"key":"48_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1007\/3-540-59042-0_105","volume-title":"STACS 95","author":"T. Ottmann","year":"1995","unstructured":"Ottmann, T., Schuierer, S., Soundaralakshimi, S.: Enumerating extreme points in higher dimension. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol.\u00a0900, pp. 562\u2013570. Springer, Heidelberg (1995)"},{"key":"48_CR9","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BF02712874","volume":"16","author":"T.M. Chan","year":"1996","unstructured":"Chan, T.M.: Output-sensitive results on convex hulls, extreme points, and related problems. Discrete & Comput. Geometry\u00a016, 369\u2013387 (1996)","journal-title":"Discrete & Comput. Geometry"},{"key":"48_CR10","first-page":"179","volume":"8","author":"T. Ottmann","year":"2001","unstructured":"Ottmann, T., Schuierer, S., Soundaralakshimi, S.: Enumerating extreme points in higher dimension. Nordic J. Comput.\u00a08, 179\u2013192 (2001)","journal-title":"Nordic J. Comput."},{"key":"48_CR11","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1287\/ijoc.10.3.323","volume":"10","author":"J.H. Dul\u00e1","year":"1997","unstructured":"Dul\u00e1, J.H., Helgason, R.V., Venugopal, N.: An algorithm for identifying the frame of a pointed finite conical hull. INFORMS J. Computing\u00a010, 323\u2013330 (1997)","journal-title":"INFORMS J. Computing"},{"key":"48_CR12","doi-asserted-by":"crossref","unstructured":"Dul\u00e1, J.H., Lop\u00e9z, F.J.: Algorithms for the frame of a finitely generated unbounded polyhedron, INFORMS J. Computing (2005) (to appear)","DOI":"10.1287\/ijoc.1040.0109"},{"key":"48_CR13","doi-asserted-by":"crossref","unstructured":"Barnett, V.: The ordering of multivariate data. J. Roy. Statist. Soc. A, 318\u2013344 (1976)","DOI":"10.2307\/2344839"},{"key":"48_CR14","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/ijoc.4.1.45","volume":"4","author":"S.W. Wallace","year":"1992","unstructured":"Wallace, S.W., Wets, R.J.B.: Preprocessing in stochastic programming: the case of linear programs. ORSA Journal on Computing\u00a04, 45\u201359 (1992)","journal-title":"ORSA Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Applications in Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496199_48.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T22:16:52Z","timestamp":1740262612000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496199_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262244","9783540324409"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11496199_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}