{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T22:46:49Z","timestamp":1648853209575},"reference-count":39,"publisher":"EDP Sciences","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1051\/ro\/2012017","type":"journal-article","created":{"date-parts":[[2012,9,19]],"date-time":"2012-09-19T09:43:51Z","timestamp":1348047831000},"page":"235-252","source":"Crossref","is-referenced-by-count":0,"title":["Interactive compromise hypersphere method and its applications"],"prefix":"10.1051","volume":"46","author":[{"given":"Sebastian","family":"Sitarz","sequence":"first","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2012,9,26]]},"reference":[{"key":"R1","unstructured":"G.T. Anthony, B. Bittner, B.P. Butler, M.G. Cox, R. Elligsen, A.B. Forbes, H. Gross, S.A. Hannaby, P.M. Harris and J. Kok,Chebychev reference software for evaluation of coordinate measuring machine data, Report EUR 15304 EN, National Physical Laboratory, Teddington, United Kingdom (1993)."},{"key":"R2","unstructured":"Ballestero E., Selecting the CP metric : A risk aversion approach.Eur. J. Oper. Res.97(1996) 593\u2013596."},{"key":"R3","unstructured":"Bazgan C., Hugot H. and Vanedrpooten D., Solving efficiently the 0-1 multi-objective knapsack problem.Comput. Oper. Res.36(2009) 260\u2013279."},{"key":"R4","unstructured":"B.P. Butler, A.B. Forbes and P.M. Harris,Algorithms for geometric tolerance assessment. NPL Report DITC 228\/94, National Physical Laboratory, Teddington, United Kingdom (1994)."},{"key":"R5","unstructured":"E. Carrizosa, E. Conde, A. Pacual, D. Romero-Morales, Closest solutions in ideal-point methods, inAdvances in multiple objective and goal programming, edited by R. Caballero, F. Ruiz and R.E. Steuer. Springer Verlag, Berlin, LNEMS 455 (1996) 274\u2013281."},{"key":"R6","unstructured":"Eben-Chaime M., Parametric solution for linear bicriteria knapsack models.Manag. Sci.42(1996) 1565\u20131575."},{"key":"R7","unstructured":"M. Ehrgott,Multicriteria optimization. Springer Verlag, Berlin (2002)."},{"key":"R8","unstructured":"O.M. Elmabrouk, A linear programming technique for the pptimization of the activities in maintenance projects.Int. J. Eng. Technol. IJET-IJENS11(2011)."},{"key":"R9","unstructured":"Evans J.P. and Steuer R.E., A revised simplex method for linear multiple objective programs.Math. Programm.5(1973) 54\u201372."},{"key":"R10","doi-asserted-by":"crossref","unstructured":"Gal T. and Wolf K., Stability in vector maximization \u2013 a survey.Eur. J. Oper. Res.25(1986) 169\u2013182.","DOI":"10.1016\/0377-2217(86)90083-4"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"Gandibleux X. and Freville A., Tabu search based procedure for solving the 0\/1 multiobjective knapsack problem : The two objective case.J. Heuristics6(2000) 361\u2013383.","DOI":"10.1023\/A:1009682532542"},{"key":"R12","unstructured":"S.I. Gass,An illustrated guide to linear programming. Mc Graw-Hill Book Company, New York (1970)."},{"key":"R13","unstructured":"S.I. Gass,Linear programming, methods and applications. Mc Graw-Hill Book Company, New York (1975)."},{"key":"R14","doi-asserted-by":"crossref","unstructured":"Gass S.I. and Roy P.G., The compromise hypersphere for multiobjective linear programming.Eur. J. Oper. Res.144(2003) 459\u2013479.","DOI":"10.1016\/S0377-2217(01)00388-5"},{"key":"R15","doi-asserted-by":"crossref","unstructured":"Gass S.I., Harary H.H. and Witzgall C., Fitting circles and spheres to coordinate measuring machine data.Int. J. Flexible Manuf.10(1998) 5\u201325.","DOI":"10.1023\/A:1007996916604"},{"key":"R16","unstructured":"Gomes da Silva C., Climaco J. and Rui Figueria J., Core problem in bi-criteria \u00a0{0,1}\u00a0-knapsack problem.Comput. Oper. Res.35(2008) 2292\u20132306."},{"key":"R17","doi-asserted-by":"crossref","unstructured":"Hansen P., Labbe M. and Wendell R.E., Sensitivity analysis in multiple objective linear programming : the tolerance approach.Eur. J. Oper. Res.38(1989) 63\u201369.","DOI":"10.1016\/0377-2217(89)90469-4"},{"key":"R18","unstructured":"Hladik M., Additive and multiplicative tolerance in multiobjective linear programming.Oper. Res. Lett.36(2008) 393\u2013396."},{"key":"R19","unstructured":"J. Knutson and I. Bitz,Project Management. Amacom, New York (1991)."},{"key":"R20","unstructured":"Opricovic S. and Tzeng G.H., Compromise solution by MCDM methods : a comparative analysis of VIKOR and TOPSIS.Eur. J. Oper. Res.156(2004) 445\u2013455."},{"key":"R21","doi-asserted-by":"crossref","unstructured":"Opricovic S. and Tzeng G.H., Extended VIKOR method in comparison with outranking methods.Eur. J. Oper. Res.178(2007) 514\u2013529.","DOI":"10.1016\/j.ejor.2006.01.020"},{"key":"R22","unstructured":"Sitarz S., Hybrid methods in multi-criteria dynamic programming.Appl. Math. Comput.180(2006) 38\u201345."},{"key":"R23","doi-asserted-by":"crossref","unstructured":"Sitarz S., Postoptimal analysis in multicriteria linear programming.Eur. J. Oper. Res.191(2008) 7\u201318.","DOI":"10.1016\/j.ejor.2007.08.040"},{"key":"R24","unstructured":"Sitarz S., Ant algorithms and simulated annealing for multicriteria dynamic programming.Comput. Oper. Res.36(2009) 433\u2013441."},{"key":"R25","unstructured":"Sitarz S., Standard sensitivity analysis and additive tolerance approach in MOLP.Ann. Oper. Res.181(2010) 219\u2013232."},{"key":"R26","doi-asserted-by":"crossref","unstructured":"Sitarz S., Dynamic programming with ordered structures : theory, examples and applications.Fuzzy Sets and Systems161(2010) 2623\u20132641.","DOI":"10.1016\/j.fss.2010.03.012"},{"key":"R27","doi-asserted-by":"crossref","unstructured":"Sitarz S., Sensitivity analysis of weak efficiency in MOLP.Asia-Pacific J. Oper. Res.28(2011) 445\u2013455.","DOI":"10.1142\/S0217595911003181"},{"key":"R28","doi-asserted-by":"crossref","unstructured":"Sitarz S., Mean value and volume-based sensitivity analysis for Olympic rankings.Eur. J. Oper. Res.216(2012) 232\u2013238.","DOI":"10.1016\/j.ejor.2011.07.010"},{"key":"R29","unstructured":"Steuer R.E. and Choo E. An Interactive weighted Tchebycheff procedure for multiple objective programming.Math. Programm.26(1981) 326\u2013344."},{"key":"R30","unstructured":"R. Steuer,Multiple criteria optimization theory : computation and application. John Willey, New York (1986)."},{"key":"R31","doi-asserted-by":"crossref","unstructured":"Tuyttens D., Teghem J., Fortemps P. and Van Nieuwenhuyse K., Performance of the MOSA method for the bicriteria assignment problem.J. Heuristics6(2000) 259\u2013310.","DOI":"10.1023\/A:1009670112978"},{"key":"R32","doi-asserted-by":"crossref","unstructured":"Trzaskalik T. and Sitarz S., Discrete dynamic programming with outcomes in random variable structures.Eur. J. Oper. Res.177(2007) 1535\u20131548.","DOI":"10.1016\/j.ejor.2005.10.019"},{"key":"R33","unstructured":"E.L. Ulungu and J. Teghem,Multicriteria assignment problem \u2013 a new method. Technical Report, Faculte Polytechnique de Mons, Belgium (1992)."},{"key":"R34","doi-asserted-by":"crossref","unstructured":"A.P. Wierzbicki, Reference point approaches, inMulticriteria Decision Making, edited by R. Gal, T.J. Stewart, T. Hanne. Kluwer, Boston, MA (Chap. 9) (1999).","DOI":"10.1007\/978-1-4615-5025-9_9"},{"key":"R35","doi-asserted-by":"crossref","unstructured":"White D.J., A special Multi-objective assigmnet problem.J. Oper. Res. Soc.35(1984) 759\u2013767.","DOI":"10.1057\/jors.1984.152"},{"key":"R36","unstructured":"A. Woolf and B. Murray,Faster construction projects with CPM Scheduling. McGraw Hill (2007)."},{"key":"R37","doi-asserted-by":"crossref","unstructured":"Yu P.L. and Zeleny M., The set of all nondominated solutions in linear cases and a multicriteria simplex method.J. Math. Anal. Appl.49(1975) 430\u2013468.","DOI":"10.1016\/0022-247X(75)90189-4"},{"key":"R38","unstructured":"M. Zeleny,Multiple Criteria Decision Making. McGraw-Hill Book Company, New York (1982)."},{"key":"R39","unstructured":"Zionts S. and Wallenius J., An interactive multiple objective linear programming method for a class of underlying nonlinear utility functions.Manag. Sci.29(1983) 519\u2013529."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2012017\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T02:18:57Z","timestamp":1562206737000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2012017"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":39,"journal-issue":{"issue":"3"},"alternative-id":["ro120017"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2012017","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7]]}}}