{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:08:42Z","timestamp":1743055722934,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642551949"},{"type":"electronic","value":"9783642551956"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-55195-6_54","type":"book-chapter","created":{"date-parts":[[2014,5,7]],"date-time":"2014-05-07T14:55:32Z","timestamp":1399474532000},"page":"573-581","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Shaving Method for Interval Linear Systems of Equations"],"prefix":"10.1007","author":[{"given":"Milan","family":"Hlad\u00edk","sequence":"first","affiliation":[]},{"given":"Jaroslav","family":"Hor\u00e1\u010dek","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,5,8]]},"reference":[{"issue":"1\u20133","key":"54_CR1","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0024-3795(98)10044-7","volume":"281","author":"O Beaumont","year":"1998","unstructured":"Beaumont, O.: Solving interval linear systems with linear programming techniques. Linear Algebra Appl. 281(1\u20133), 293\u2013309 (1998)","journal-title":"Linear Algebra Appl."},{"key":"54_CR2","volume-title":"Linear Optimization Problems with Inexact Data","author":"M Fiedler","year":"2006","unstructured":"Fiedler, M., Nedoma, J., Ram\u00edk, J., Rohn, J., Zimmermann, K.: Linear Optimization Problems with Inexact Data. Springer, New York (2006)"},{"key":"54_CR3","doi-asserted-by":"crossref","unstructured":"Goldsztejn, A., Goualard, F.: Box consistency through adaptive shaving. In: Proceedings of the 2010 ACM Symposium on Applied Computing, SAC \u201910, pp. 2049\u20132054. ACM, New York (2010), http:\/\/doi.acm.org\/10.1145\/1774088.1774519","DOI":"10.1145\/1774088.1774519"},{"key":"54_CR4","unstructured":"Hlad\u00edk, M.: A new operator and method for solving interval linear equations (2013), http:\/\/arxiv.org\/abs\/1306.6739"},{"issue":"11","key":"54_CR5","doi-asserted-by":"publisher","first-page":"4156","DOI":"10.1016\/j.laa.2013.02.012","volume":"438","author":"M Hlad\u00edk","year":"2013","unstructured":"Hlad\u00edk, M.: Weak and strong solvability of interval linear systems of equations and inequalities. Linear Algebra Appl. 438(11), 4156\u20134165 (2013)","journal-title":"Linear Algebra Appl."},{"key":"54_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2793-7","volume-title":"Computational Complexity and Feasibility of Data Processing and Interval Computations","author":"V Kreinovich","year":"1998","unstructured":"Kreinovich, V., Lakeyev, A., Rohn, J., Kahl, P.: Computational Complexity and Feasibility of Data Processing and Interval Computations. Kluwer, Dordrecht (1998)"},{"key":"54_CR7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717716","volume-title":"Introduction to Interval Analysis","author":"RE Moore","year":"2009","unstructured":"Moore, R.E., Kearfott, R.B., Cloud, M.J.: Introduction to Interval Analysis. SIAM, Philadelphia (2009)"},{"key":"54_CR8","volume-title":"Interval Methods for Systems of Equations","author":"A Neumaier","year":"1990","unstructured":"Neumaier, A.: Interval Methods for Systems of Equations. Cambridge University Press, Cambridge (1990)"},{"issue":"2","key":"54_CR9","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1023\/A:1009997221089","volume":"5","author":"A Neumaier","year":"1999","unstructured":"Neumaier, A.: A simple derivation of the hansen-bliek-rohn-ning-kearfott enclosure for linear interval equations. Reliab. Comput. 5(2), 131\u2013136 (1999)","journal-title":"Reliab. Comput."},{"issue":"3","key":"54_CR10","first-page":"246","volume":"13","author":"ED Popova","year":"2006","unstructured":"Popova, E.D.: Webcomputing service framework. Int. J. Inf. Theor. Appl. 13(3), 246\u2013254 (2006)","journal-title":"Int. J. Inf. Theor. Appl."},{"issue":"8","key":"54_CR11","doi-asserted-by":"publisher","first-page":"1403","DOI":"10.1007\/s00500-013-1011-0","volume":"17","author":"ED Popova","year":"2013","unstructured":"Popova, E.D., Hlad\u00edk, M.: Outer enclosures to the parametric ae solution set. Soft Comput. 17(8), 1403\u20131414 (2013)","journal-title":"Soft Comput."},{"issue":"2","key":"54_CR12","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/j.cam.2005.08.048","volume":"199","author":"ED Popova","year":"2007","unstructured":"Popova, E.D., Kr\u00e4mer, W.: Inner and outer bounds for the solution set of parametric linear systems. J. Comput. Appl. Math. 199(2), 310\u2013316 (2007)","journal-title":"J. Comput. Appl. Math."},{"key":"54_CR13","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-94-017-1247-7_7","volume-title":"Developments in Reliable Computing","author":"SM Rump","year":"1999","unstructured":"Rump, S.M.: Intlab - interval laboratory. In: Csendes, T. (ed.) Developments in Reliable Computing, pp. 77\u2013104. Kluwer Academic Publishers, Dordrecht (1999). http:\/\/www.ti3.tu-harburg.de\/rump\/"},{"key":"54_CR14","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1017\/S096249291000005X","volume":"19","author":"SM Rump","year":"2010","unstructured":"Rump, S.M.: Verification methods: rigorous results using floating-point arithmetic. Acta Numer. 19, 287\u2013449 (2010)","journal-title":"Acta Numer."},{"issue":"5","key":"54_CR15","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1023\/A:1020505620702","volume":"8","author":"SP Shary","year":"2002","unstructured":"Shary, S.P.: A new technique in systems analysis under interval uncertainty and ambiguity. Reliab. Comput. 8(5), 321\u2013418 (2002)","journal-title":"Reliab. Comput."},{"key":"54_CR16","series-title":"LNCS","first-page":"491","volume-title":"CP 2010","author":"G Trombettoni","year":"2010","unstructured":"Trombettoni, G., Papegay, Y., Chabert, G., Pourtallier, O.: A box-consistency contractor based on extremal functions. In: Cohen, D. (ed.) CP 2010. LNCS, vol. 6308, pp. 491\u2013498. Springer, Heidelberg (2010). http:\/\/dx.doi.org\/10.1007\/978-3-642-15396-9_39"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-55195-6_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,14]],"date-time":"2023-02-14T16:28:09Z","timestamp":1676392089000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-55195-6_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642551949","9783642551956"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-55195-6_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"8 May 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}