{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:11:35Z","timestamp":1759666295969,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319961507"},{"type":"electronic","value":"9783319961514"}],"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-96151-4_18","type":"book-chapter","created":{"date-parts":[[2018,7,17]],"date-time":"2018-07-17T12:21:49Z","timestamp":1531830109000},"page":"208-218","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An Exact Column Generation-Based Algorithm for Bi-objective Vehicle Routing Problems"],"prefix":"10.1007","author":[{"given":"Est\u00e8le","family":"Glize","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Jozefowiez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandra Ulrich","family":"Ngueveu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,18]]},"reference":[{"issue":"1","key":"18_CR1","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manage. Sci. 6(1), 80\u201391 (1959)","journal-title":"Manage. Sci."},{"issue":"2","key":"18_CR2","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.ejor.2007.05.055","volume":"189","author":"N Jozefowiez","year":"2008","unstructured":"Jozefowiez, N., Semet, F., Talbi, E.G.: Multi-objective vehicle routing problems. Eur. J. Oper. Res. 189(2), 293\u2013309 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"18_CR3","unstructured":"Parragh, S.N., Tricoire, F.: Branch-and-bound for bi-objective integer programming. Optimization Online (2015)"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-319-07557-0_14","volume-title":"Integer Programming and Combinatorial Optimization","author":"N Boland","year":"2014","unstructured":"Boland, N., Charkhgard, H., Savelsbergh, M.: The triangle splitting method for biobjective mixed integer programming. In: Lee, J., Vygen, J. (eds.) IPCO 2014. LNCS, vol. 8494, pp. 162\u2013173. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-07557-0_14"},{"issue":"2","key":"18_CR5","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/j.ejor.2015.01.021","volume":"244","author":"S Moradi","year":"2015","unstructured":"Moradi, S., Raith, A., Ehrgott, M.: A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem. Eur. J. Oper. Res. 244(2), 369\u2013378 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"18_CR6","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.ejor.2007.12.014","volume":"194","author":"JF B\u00e9rub\u00e9","year":"2009","unstructured":"B\u00e9rub\u00e9, J.F., Gendreau, M., Potvin, J.Y.: 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 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"18_CR7","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.ejor.2008.10.023","volume":"199","author":"M \u00d6zlen","year":"2009","unstructured":"\u00d6zlen, M., Azizo\u011flu, M.: Multi-objective integer programming: a general approach for generating all non-dominated solutions. Eur. J. Oper. Res. 199(1), 25\u201335 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"18_CR8","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.: A criterion space search algorithm for biobjective integer programming: the balanced box method. INFORMS J. Comput. 27(4), 735\u2013754 (2015)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"18_CR9","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.orl.2017.11.011","volume":"46","author":"R Dai","year":"2018","unstructured":"Dai, R., Charkhgard, H.: A two-stage approach for bi-objective integer linear programming. Oper. Res. Lett. 46(1), 81\u201387 (2018)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"18_CR10","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1287\/opre.12.2.300","volume":"12","author":"ML Balinski","year":"1964","unstructured":"Balinski, M.L., Quandt, R.E.: On an integer program for a delivery problem. Oper. Res. 12(2), 300\u2013304 (1964)","journal-title":"Oper. Res."},{"issue":"2","key":"18_CR11","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10107-007-0178-5","volume":"115","author":"R Baldacci","year":"2008","unstructured":"Baldacci, R., Christofides, N., Mingozzi, A.: An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math. Program. 115(2), 351\u2013385 (2008)","journal-title":"Math. Program."},{"key":"18_CR12","volume-title":"Multicriteria Optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott, M.: Multicriteria Optimization, vol. 491. Springer Science & Business Media, Heidelberg (2005)"},{"issue":"2","key":"18_CR13","first-page":"149","volume":"20","author":"E Ulungu","year":"1995","unstructured":"Ulungu, E., Teghem, J.: The two phases method: an efficient procedure to solve bi-objective combinatorial optimization problems. Found. Comput. Dec. Sci. 20(2), 149\u2013165 (1995)","journal-title":"Found. Comput. Dec. Sci."},{"issue":"3","key":"18_CR14","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1016\/0022-247X(68)90201-1","volume":"22","author":"AM Geoffrion","year":"1968","unstructured":"Geoffrion, A.M.: Proper efficiency and the theory of vector maximization. J. Math. Anal. Appl. 22(3), 618\u2013630 (1968)","journal-title":"J. Math. Anal. Appl."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96151-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,9,12]],"date-time":"2018-09-12T08:21:52Z","timestamp":1536740512000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-96151-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319961507","9783319961514"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96151-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"ISCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marrakesh","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isco2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/isco2018.lip6.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}