{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:47:15Z","timestamp":1740160035577,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2019,7,5]],"date-time":"2019-07-05T00:00:00Z","timestamp":1562284800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,7,5]],"date-time":"2019-07-05T00:00:00Z","timestamp":1562284800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Syst Assur Eng Manag"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s13198-019-00824-7","type":"journal-article","created":{"date-parts":[[2019,7,5]],"date-time":"2019-07-05T12:02:44Z","timestamp":1562328164000},"page":"937-944","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Bi-objective integer programming analysis based on the characteristic equation"],"prefix":"10.1007","volume":"10","author":[{"given":"Masar","family":"Al-Rabeeah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9321-5622","authenticated-orcid":false,"given":"Santosh","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Al-Hasani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elias","family":"Munapo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Eberhard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,5]]},"reference":[{"key":"824_CR1","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.cor.2013.08.001","volume":"41","author":"R Abounacer","year":"2014","unstructured":"Abounacer R, Rekik M, Renaud J (2014) An exact solution approach for multi-objective location-transportation problem for disaster response. Comput Oper Res 41:83\u201393","journal-title":"Comput Oper Res"},{"issue":"4","key":"824_CR2","first-page":"351","volume":"3","author":"A Al-Hasani","year":"2018","unstructured":"Al-Hasani A, Al-Rabeeah M, Kumar S, Eberhard E (2018) An improved cpu time in triangle splitting method for solving a biobjective mixed integer program. Int J Math Eng Manag Sci 3(4):351\u2013364","journal-title":"Int J Math Eng Manag Sci"},{"issue":"1","key":"824_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1287\/mnsc.25.1.73","volume":"25","author":"YP Aneja","year":"1979","unstructured":"Aneja YP, Nair KP (1979) Bicriteria transportation problem. Manag Sci 25(1):73\u201378","journal-title":"Manag Sci"},{"key":"824_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-28746-1","volume-title":"Multiobjective linear and integer programming","author":"CH Antunes","year":"2016","unstructured":"Antunes CH, Alves MJ, Cl\u00edmaco J (2016) Multiobjective linear and integer programming. Springer, Berlin"},{"issue":"1","key":"824_CR5","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.ejor.2007.12.014","volume":"194","author":"J-F B\u00e9rub\u00e9","year":"2009","unstructured":"B\u00e9rub\u00e9 J-F, Gendreau M, Potvin J-Y (2009) An exact $$\\epsilon $$-constraint method for bi-objective combinatorial optimization problems: application to the traveling salesman problem with profits. Eur J Oper Res 194(1):39\u201350","journal-title":"Eur J Oper Res"},{"issue":"4","key":"824_CR6","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1287\/ijoc.2015.0657","volume":"27","author":"N Boland","year":"2015","unstructured":"Boland N, Charkhgard H, Savelsbergh M (2015) A criterion space search algorithm for biobjective integer programming: the balanced box method. INFORMS J Comput 27(4):735\u2013754","journal-title":"INFORMS J Comput"},{"issue":"2","key":"824_CR7","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1016\/0377-2217(86)90093-7","volume":"25","author":"L Chalmet","year":"1986","unstructured":"Chalmet L, Lemonidis L, Elzinga D (1986) An algorithm for the bi-criterion integer programming problem. Eur J Oper Res 25(2):292\u2013300","journal-title":"Eur J Oper Res"},{"key":"824_CR8","volume-title":"Multiobjective decision making: theory and methodology","author":"V Chankong","year":"2008","unstructured":"Chankong V, Haimes YY (2008) Multiobjective decision making: theory and methodology. Courier Dover Publications, New York"},{"issue":"1","key":"824_CR9","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10479-006-0074-z","volume":"147","author":"M Ehrgott","year":"2006","unstructured":"Ehrgott M (2006) A discussion of scalarization techniques for multiple objective integer programming. Ann Oper Res 147(1):343\u2013360","journal-title":"Ann Oper Res"},{"issue":"4","key":"824_CR10","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s002910000046","volume":"22","author":"M Ehrgott","year":"2000","unstructured":"Ehrgott M, Gandibleux X (2000) A survey and annotated bibliography of multiobjective combinatorial optimization. OR-Spektrum 22(4):425\u2013460","journal-title":"OR-Spektrum"},{"issue":"3","key":"824_CR11","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s10957-008-9394-2","volume":"138","author":"M Ehrgott","year":"2008","unstructured":"Ehrgott M, Ruzika S (2008) Improved $$\\varepsilon $$-constraint method for multiobjective programming. J Optim Theory Appl 138(3):375","journal-title":"J Optim Theory Appl"},{"issue":"3","key":"824_CR12","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1016\/j.orl.2006.03.019","volume":"35","author":"HW Hamacher","year":"2007","unstructured":"Hamacher HW, Pedersen CR, Ruzika S (2007) Finding representative systems for discrete bicriterion optimization problems. Oper Res Lett 35(3):336\u2013344","journal-title":"Oper Res Lett"},{"key":"824_CR13","unstructured":"Kumar S, Munapo E (2012) Some lateral ideas and their applications for developing new solution procedures for a pure integer programming model, keynote address. In: Marriappan, Srinivasan, Amritraj (eds) Proceedings of herbal international conference on applications of mathematics and statistics for intelligent solutions through mathematics and statistics, Excell India Publisher, pp 13\u201321"},{"issue":"2","key":"824_CR14","first-page":"211","volume":"49","author":"S Kumar","year":"2007","unstructured":"Kumar S, Munapo E, Jones B (2007) An integer equation controlled descending path to a protean pure integer program. Indian J Math 49(2):211\u2013237","journal-title":"Indian J Math"},{"key":"824_CR15","unstructured":"Parragh SN, Tricoire F (2018) Branch-and-bound for bi-objective integer programming. arXiv preprint \n                    arXiv:1809.06823"},{"key":"824_CR16","unstructured":"Sourd F, Spanjaard O, Perny P (2006) Multi-objective branch and bound. Application to the bi-objective spanning tree problem. In: 7th international conference in multi-objective programming and goal programming"},{"key":"824_CR17","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.cor.2016.03.001","volume":"72","author":"B Soylu","year":"2016","unstructured":"Soylu B, Y\u0131ld\u0131z GB (2016) An exact algorithm for biobjective mixed integer linear programming problems. Comput Oper Res 72:204\u2013213","journal-title":"Comput Oper Res"},{"issue":"1","key":"824_CR18","first-page":"55","volume":"27","author":"IP Stanimirovic","year":"2012","unstructured":"Stanimirovic IP (2012) Compendious lexicographic method for multi-objective optimization. Ser Math Inform. 27(1):55\u201366","journal-title":"Ser Math Inform."},{"issue":"4","key":"824_CR19","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1287\/mnsc.2013.1802","volume":"60","author":"T Stidsen","year":"2014","unstructured":"Stidsen T, Andersen KA, Dammann B (2014) A branch and bound algorithm for a class of biobjective mixed integer programs. Manag Sci 60(4):1009\u20131032","journal-title":"Manag Sci"},{"issue":"1","key":"824_CR20","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/j.cor.2012.08.003","volume":"40","author":"T Vincent","year":"2013","unstructured":"Vincent T, Seipp F, Ruzika S, Przybylski A, Gandibleux X (2013) Multiple objective branch and bound for mixed 0\u20131 linear programming: corrections and improvements for the biobjective case. Comput Oper Res 40(1):498\u2013509","journal-title":"Comput Oper Res"},{"key":"824_CR21","unstructured":"Vira C, Haimes YY (1983) Multiobjective decision making: theory and methodology. In: North Holland series in system science and engineering, number\u00a08. North-Holland"}],"container-title":["International Journal of System Assurance Engineering and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13198-019-00824-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13198-019-00824-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13198-019-00824-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,3]],"date-time":"2020-07-03T23:39:30Z","timestamp":1593819570000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13198-019-00824-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,5]]},"references-count":21,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["824"],"URL":"https:\/\/doi.org\/10.1007\/s13198-019-00824-7","relation":{},"ISSN":["0975-6809","0976-4348"],"issn-type":[{"type":"print","value":"0975-6809"},{"type":"electronic","value":"0976-4348"}],"subject":[],"published":{"date-parts":[[2019,7,5]]},"assertion":[{"value":"11 April 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 June 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 July 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}