{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T06:11:13Z","timestamp":1764655873437},"reference-count":20,"publisher":"EDP Sciences","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1051\/ro\/2014054","type":"journal-article","created":{"date-parts":[[2015,1,7]],"date-time":"2015-01-07T13:55:50Z","timestamp":1420638950000},"page":"527-554","source":"Crossref","is-referenced-by-count":1,"title":["Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems"],"prefix":"10.1051","volume":"49","author":[{"given":"Boadu Mensah","family":"Sarpong","sequence":"first","affiliation":[]},{"given":"Christian","family":"Artigues","sequence":"additional","affiliation":[]},{"given":"Nicolas","family":"Jozefowiez","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2015,2,6]]},"reference":[{"key":"R1","unstructured":"Aneja Y.P. and Nair K.P.K., Bicriteria transportation problem.Manage. Sci.25(1979) 73\u201378."},{"key":"R2","unstructured":"B\u00e9rub\u00e9 J.-F., Gendreau M. and Potvin J.-Y., An exact\u03f5-constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits.Eur. J. Oper. Res.194(2009) 39\u201350."},{"key":"R3","unstructured":"Boland N., Dethridge J. and Dumitrescu I., Accelerated label setting algorithms for the elementary resource constrained shortest path problem.Oper. Res. Lett.34(2006) 58\u201368."},{"key":"R4","doi-asserted-by":"crossref","unstructured":"Current J.R. and Schilling D.A., The median tour and maximal covering tour problems: Formulations and heuristics.Eur. J. Oper. Res.73(1994) 114\u2013126.","DOI":"10.1016\/0377-2217(94)90149-X"},{"key":"R5","unstructured":"C. Delort and O. Spanjaard, Using bound sets in multiobjective optimization: Application to the biobjective binary knapsack problem, inExperimental Algorithms, Springer (2010) 253\u2013265."},{"key":"R6","doi-asserted-by":"crossref","unstructured":"Desrochers M. and Soumis F., A generalized permanent labelling algorithm for the shortest path problem with time windows.INFOR26(1988) 191\u2013212.","DOI":"10.1080\/03155986.1988.11732063"},{"key":"R7","unstructured":"Dror M.. Note on the complexity of shortest path models for column generation in VRPTW.Oper. Res.42(1994) 977\u2013978."},{"key":"R8","unstructured":"Ehrgott M. and Gandibleux X., Bound sets for biobjective combinatorial optimization problems.Comput. Oper. Res.34(2007) 2674\u20132694."},{"key":"R9","unstructured":"Feillet D., Dejax P., Gendreau M. and Gueguen C., An exact algorithm for the Elementary Shortest Path Problem with Resource Constraints: Application to some vehicle routing problems.Networks44(2004) 216\u2013229."},{"key":"R10","unstructured":"Gendreau M., Laporte G. and Semet F., The Covering tour problem.Oper. Res.45(1997) 568\u2013576."},{"key":"R11","unstructured":"Hachicha M., Hodgson M.J., Laporte G. and Semet F., Heuristics for the multi-vehicle covering tour problem.Comput. Oper. Res.27(2000) 29\u201342."},{"key":"R12","doi-asserted-by":"crossref","unstructured":"Hodgson M.J., Laporte G. and Semet F., A Covering Tour Model for Planning Mobile Health Care Facilities in SuhumDistrict, Ghama.J. Regional Sci.38(1998) 621\u2013638.","DOI":"10.1111\/0022-4146.00113"},{"key":"R13","unstructured":"Jozefowiez N., Semet F. and Talbi E.-G., The bi-objective covering tour problem.Comput. Oper. Res.34(2007) 1929\u20131942."},{"key":"R14","unstructured":"Labb\u00e9 M. and Laporte G.. Maximizing user convenience and postal service efficiency in post box location.Belgian J. Oper. Res. Stat. Comput. Sci.26(1986) 21\u201335."},{"key":"R15","doi-asserted-by":"crossref","unstructured":"Righini G. and Salani M., New dynamic programming algorithms for the resource constrained elementary shortest path problem.Networks51(2008) 155\u2013170.","DOI":"10.1002\/net.20212"},{"key":"R16","unstructured":"Salari E. and Unkelbach J., A column-generation-based method for multi-criteria direct aperture optimization.Phys. Med. Biol.58(2013) 621\u2013639."},{"key":"R17","unstructured":"Sourd F. and Spanjaard O., A multiobjective branch-and-bound framework: Application to the biobjective spanning tree problem.INFORMS J. Comput.20(2008) 472\u2013484."},{"key":"R18","unstructured":"Ulungu E.L. and Teghem J.. The two phases method: An efficient procedure to solve bi-objective combinatorial optimization problems.Found. Comput. Dec. Sci.20(1995) 149\u2013165."},{"key":"R19","doi-asserted-by":"crossref","unstructured":"F. Vanderbeck, Implementing mixed integer column generation, inColumn Generation, edited by G. Desaulniers, J. Desrosiers and M.M. Solomon. Springer (2005) 331\u2013358.","DOI":"10.1007\/0-387-25486-2_12"},{"key":"R20","unstructured":"Villarreal B. and Karwan M.H., Multicriteria integer programming: A (hybrid) dynamic programming recursive approach.Math. Prog.21(1981) 204\u2013223."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2014054\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T10:38:16Z","timestamp":1566211096000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2014054"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,6]]},"references-count":20,"journal-issue":{"issue":"3"},"alternative-id":["ro140054"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2014054","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,6]]}}}