{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:51:29Z","timestamp":1740099089327,"version":"3.37.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319951645"},{"type":"electronic","value":"9783319951652"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-95165-2_46","type":"book-chapter","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T10:35:04Z","timestamp":1530614104000},"page":"653-668","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Parallelizing Benson\u2019s Algorithm:"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5210-0789","authenticated-orcid":false,"given":"H. Martin","family":"B\u00fccker","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0872-4735","authenticated-orcid":false,"given":"Andreas","family":"L\u00f6hne","sequence":"additional","affiliation":[]},{"given":"Benjamin","family":"Wei\u00dfing","sequence":"additional","affiliation":[]},{"given":"Gerhard","family":"Zumbusch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,4]]},"reference":[{"issue":"1","key":"46_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1022614814789","volume":"97","author":"HP Benson","year":"1998","unstructured":"Benson, H.P.: Further analysis of an outcome set-based algorithm for multiple-objective linear programming. J. Optim. Theory Appl. 97(1), 1\u201310 (1998). \nhttps:\/\/doi.org\/10.1023\/A:1022614814789","journal-title":"J. Optim. Theory Appl."},{"key":"46_CR2","volume-title":"Programming with Posix Threads","author":"DR Butenhof","year":"1997","unstructured":"Butenhof, D.R.: Programming with Posix Threads. Addison-Wesley, Boston (1997)"},{"key":"46_CR3","volume-title":"PThreads Programming","author":"D Buttlar","year":"2013","unstructured":"Buttlar, D., Farrell, J., Nichols, B.: PThreads Programming. O\u2019Reilly, Sebastopol (2013)"},{"key":"46_CR4","unstructured":"Ciripoi, D., L\u00f6hne, A., Wei\u00dfing, B.: Bensolve tools - polyhedral calculus, global optimization and vector linear programming (2017). \nhttp:\/\/tools.bensolve.org"},{"key":"46_CR5","doi-asserted-by":"publisher","unstructured":"Csirmaz, L.: Using multiobjective optimization to map the entropy region. Comput. Optim. Appl. 1\u201323 (2015) \nhttps:\/\/doi.org\/10.1007\/s10589-015-9760-6","DOI":"10.1007\/s10589-015-9760-6"},{"issue":"4","key":"46_CR6","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/s10898-011-9709-y","volume":"52","author":"M Ehrgott","year":"2012","unstructured":"Ehrgott, M., L\u00f6hne, A., Shao, L.: A dual variant of Benson\u2019s \u201couter approximation algorithm\u201d for multiple objective linear programming. J. Global Optim. 52(4), 757\u2013778 (2012). \nhttps:\/\/doi.org\/10.1007\/s10898-011-9709-y","journal-title":"J. Global Optim."},{"key":"46_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/3-540-61576-8_77","volume-title":"Combinatorics and Computer Science","author":"K Fukuda","year":"1996","unstructured":"Fukuda, K., Prodon, A.: Double description method revisited. In: Deza, M., Euler, R., Manoussakis, I. (eds.) CCS 1995. LNCS, vol. 1120, pp. 91\u2013111. Springer, Heidelberg (1996). \nhttps:\/\/doi.org\/10.1007\/3-540-61576-8_77"},{"key":"46_CR8","volume-title":"Introduction to Parallel Computing","author":"A Grama","year":"2003","unstructured":"Grama, A., Gupta, A., Karypis, G., Kumar, V.: Introduction to Parallel Computing, 2nd edn. Pearson, Harlow, UK (2003)","edition":"2"},{"issue":"4","key":"46_CR9","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1007\/s10898-013-0098-2","volume":"59","author":"AH Hamel","year":"2014","unstructured":"Hamel, A.H., L\u00f6hne, A., Rudloff, B.: Benson type algorithms for linear vector optimization and applications. J. Global Optim. 59(4), 811\u2013836 (2014). \nhttps:\/\/doi.org\/10.1007\/s10898-013-0098-2","journal-title":"J. Global Optim."},{"key":"46_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-18351-5","volume-title":"Vector Optimization with Infimum and Supremum","author":"A L\u00f6hne","year":"2011","unstructured":"L\u00f6hne, A.: Vector Optimization with Infimum and Supremum. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-18351-5"},{"issue":"2","key":"46_CR11","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s00186-016-0554-0","volume":"84","author":"A L\u00f6hne","year":"2016","unstructured":"L\u00f6hne, A., Wei\u00dfing, B.: Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming. Math. Methods Oper. Res. 84(2), 411\u2013426 (2016). \nhttps:\/\/doi.org\/10.1007\/s00186-016-0554-0","journal-title":"Math. Methods Oper. Res."},{"key":"46_CR12","unstructured":"L\u00f6hne, A., Wei\u00dfing, B.: Bensolve - a free VLP solver (2017). \nhttp:\/\/bensolve.org"},{"issue":"3","key":"46_CR13","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1016\/j.ejor.2016.02.039","volume":"260","author":"A L\u00f6hne","year":"2017","unstructured":"L\u00f6hne, A., Wei\u00dfing, B.: The vector linear program solver Bensolve - notes on theoretical background. Eur. J. Oper. Res. 260(3), 807\u2013813 (2017). \nhttps:\/\/doi.org\/10.1016\/j.ejor.2016.02.039","journal-title":"Eur. J. Oper. Res."},{"key":"46_CR14","unstructured":"Makhorin, A.: GNU Linear Programming Kit: Reference Manual for GLPK version 4.64 (2017). \nhttp:\/\/www.gnu.org\/software\/glpk\/glpk.html"},{"key":"46_CR15","unstructured":"IEEE\/ANSI Std 1003.1: IEEE standard for information technology-portable operating system interface (POSIX)-Part 1: System application program interface (API) (C language). IEEE (1996)"},{"issue":"4","key":"46_CR16","doi-asserted-by":"publisher","first-page":"1287","DOI":"10.1111\/1468-0262.t01-1-00448","volume":"71","author":"A Ruszczy\u0144ski","year":"2003","unstructured":"Ruszczy\u0144ski, A., Vanderbei, R.J.: Frontiers of stochastically nondominated portfolios. Econometrica 71(4), 1287\u20131297 (2003). \nhttps:\/\/doi.org\/10.1111\/1468-0262.t01-1-00448","journal-title":"Econometrica"},{"issue":"2","key":"46_CR17","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s00186-008-0220-2","volume":"68","author":"L Shao","year":"2008","unstructured":"Shao, L., Ehrgott, M.: Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning. Math. Methods Oper. Res. 68(2), 257\u2013276 (2008). \nhttps:\/\/doi.org\/10.1007\/s00186-008-0220-2","journal-title":"Math. Methods Oper. Res."},{"issue":"3","key":"46_CR18","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s00186-007-0194-5","volume":"68","author":"Lizhen Shao","year":"2008","unstructured":"Shao, L., Ehrgott, M.: Approximating the nondominated set of an MOLP by approximately solving its dual problem. Math. Methods Oper. Res. 68(3), 469\u2013492 (2008) \nhttps:\/\/doi.org\/10.1007\/s00186-007-0194-5","journal-title":"Mathematical Methods of Operations Research"},{"key":"46_CR19","unstructured":"Tyburec, M.: Multi-criteria optimization of proton therapy treatment plan. Bachelor thesis, Department of Mechanics, Faculty of Civil Engineering, Czech Technical University in Prague (2015)"},{"issue":"1","key":"46_CR20","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1023\/A:1008606530836","volume":"8","author":"MM Wiecek","year":"1997","unstructured":"Wiecek, M.M., Zhang, H.: A parallel algorithm for multiple objective linear programs. Comput. Optim. Appl. 8(1), 41\u201356 (1997). \nhttps:\/\/doi.org\/10.1023\/A:1008606530836","journal-title":"Comput. Optim. Appl."},{"key":"46_CR21","doi-asserted-by":"publisher","unstructured":"Yoon, M.S., Kamal, A.E.: Optimal dataset allocation in distributed heterogeneous clouds. In: 2014 IEEE Globecom Workshops, pp. 75\u201380 (2014). \nhttps:\/\/doi.org\/10.1109\/GLOCOMW.2014.7063389","DOI":"10.1109\/GLOCOMW.2014.7063389"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2018"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-95165-2_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T11:00:25Z","timestamp":1530615625000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-95165-2_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319951645","9783319951652"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-95165-2_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}