{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:38:32Z","timestamp":1759667912078,"version":"3.37.3"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,6,30]],"date-time":"2017-06-30T00:00:00Z","timestamp":1498780800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-09-BLAN-0361 GUaranteed Efficiency for PAReto optimal solutions Determination (GUEPARD)","ANR\/DFG-14-CE35-0034-01 Exact Efficient Solution of Mixed Integer Programming Problems with Multiple Objective Functions (vOpt)"],"award-info":[{"award-number":["ANR-09-BLAN-0361 GUaranteed Efficiency for PAReto optimal solutions Determination (GUEPARD)","ANR\/DFG-14-CE35-0034-01 Exact Efficient Solution of Mixed Integer Programming Problems with Multiple Objective Functions (vOpt)"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"name":"LigeRO"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s10732-017-9346-9","type":"journal-article","created":{"date-parts":[[2017,6,30]],"date-time":"2017-06-30T09:19:43Z","timestamp":1498814383000},"page":"285-319","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On branching heuristics for the bi-objective 0\/1 unidimensional knapsack problem"],"prefix":"10.1007","volume":"23","author":[{"given":"Audrey","family":"Cerqueus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xavier","family":"Gandibleux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anthony","family":"Przybylski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Saubion","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,30]]},"reference":[{"issue":"1","key":"9346_CR1","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1287\/mnsc.25.1.73","volume":"25","author":"YP Aneja","year":"1979","unstructured":"Aneja, Y.P., Nair, K.P.K.: Bicriteria transportation problem. Manag. Sci. 25(1), 73\u201378 (1979)","journal-title":"Manag. Sci."},{"issue":"2\u20133","key":"9346_CR2","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Mach. Learn. 47(2\u20133), 235\u2013256 (2002)","journal-title":"Mach. Learn."},{"key":"9346_CR3","unstructured":"Balafrej, A., Bessi\u00e8re, C., Paparrizou, A.: Multi-armed bandits for adaptive constraint propagation. In: Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25\u201331, 2015, pp. 290\u2013296. AAAI Press (2015)"},{"issue":"1","key":"9346_CR4","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.ejor.2008.07.047","volume":"198","author":"C Bazgan","year":"2009","unstructured":"Bazgan, C., Hugot, H., Vanderpooten, D.: Implementing an efficient FPTAS for the 0\u20131 multi-objective knapsack problem. Eur. J. Oper. Res. 198(1), 47\u201356 (2009a)","journal-title":"Eur. J. Oper. Res."},{"key":"9346_CR5","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/j.cor.2007.09.009","volume":"36","author":"C Bazgan","year":"2009","unstructured":"Bazgan, C., Hugot, H., Vanderpooten, D.: Solving efficiently the 0\u20131 multi-objective knapsack problem. Comput. Oper. Res. 36, 260\u2013279 (2009b)","journal-title":"Comput. Oper. Res."},{"issue":"12","key":"9346_CR6","doi-asserted-by":"crossref","first-page":"1865","DOI":"10.1016\/S0305-0548(02)00112-0","volume":"30","author":"ME Captivo","year":"2003","unstructured":"Captivo, M.E., Cl\u00edmaco, Ja, Figueira, J.R., Martins, E., Santos, J.L.: Solving bicriteria 0\u20131 knapsack problems using a labeling algorithm. Comput. Oper. Res. 30(12), 1865\u20131886 (2003)","journal-title":"Comput. Oper. Res."},{"key":"9346_CR7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546921","volume-title":"Prediction, Learning, and Games","author":"N Cesa-Bianchi","year":"2006","unstructured":"Cesa-Bianchi, N., Lugosi, G.: Prediction, Learning, and Games. Cambridge University Press, Cambridge (2006)"},{"key":"9346_CR8","unstructured":"Da Costa, L., Fialho, \u00c1., Schoenauer, M., Sebag, M.: Adaptive operator selection with dynamic multi-armed bandits. In: Genetic and Evolutionary Computation Conference, GECCO 2008, Proceedings, Atlanta, GA, USA, July 12\u201316, 2008, pp. 913\u2013920. ACM (2008)"},{"key":"9346_CR9","doi-asserted-by":"crossref","unstructured":"DaCosta, L., Fialho, A., Schoenauer, M., Sebag, M.: Adaptive operator selection with dynamic multi-armed bandits. In: Proceedings of the 10th annual conference on genetic and evolutionary computation, vol. 5199, pp. 913\u2013920 (2008)","DOI":"10.1145\/1389095.1389272"},{"key":"9346_CR10","unstructured":"Degoutin, F., Gandibleux, X.: Un retour d\u2019exp\u00e9rience sur la r\u00e9solution de probl\u00e8mes combinatoires bi-objectifs. In 5e journ\u00e9e du groupe de travail Programmation Math\u00e9matique MultiObjectif (PM20), pp. 74\u201380 (2002)"},{"key":"9346_CR11","unstructured":"Delort, C.: Algorithmes d\u2019\u00e9num\u00e9ration implicite pour l\u2019optimisation multi-objectifs exacte\u00a0: exploration d\u2019ensembles bornant et application aux probl\u00e8mes de sac \u00e0 dos et d\u2019affectation. Ph.D. thesis, Universit\u00e9 Pierre et Marie Curie Paris VI (2011)"},{"key":"9346_CR12","doi-asserted-by":"crossref","unstructured":"Delort, C., Spanjaard, O.: Using bound sets in multiobjective optimization: Application to the biobjective binary knapsack problem. In: Festa, P., (ed.), SEA, volume 6049 of Lecture Notes in Computer Science, pp. 253\u2013265. Springer (2010)","DOI":"10.1007\/978-3-642-13193-6_22"},{"key":"9346_CR13","volume-title":"Multicriteria Optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott, M.: Multicriteria Optimization, 2nd edn. Springer, Berlin (2005)","edition":"2"},{"issue":"4","key":"9346_CR14","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s002910000046","volume":"22","author":"M Ehrgott","year":"2000","unstructured":"Ehrgott, M., Gandibleux, X.: A survey and annotated bibliography of multiobjective combinatorial optimization. OR Spectr. 22(4), 425\u2013460 (2000)","journal-title":"OR Spectr."},{"issue":"9","key":"9346_CR15","doi-asserted-by":"crossref","first-page":"2674","DOI":"10.1016\/j.cor.2005.10.003","volume":"34","author":"M Ehrgott","year":"2007","unstructured":"Ehrgott, M., Gandibleux, X.: Bound sets for biobjective combinatorial optimization problems. Comput. Oper. Res. 34(9), 2674\u20132694 (2007)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"9346_CR16","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s10589-013-9551-x","volume":"56","author":"JR Figueira","year":"2013","unstructured":"Figueira, J.R., Paquete, L., Sim\u00f5es, M., Vanderpooten, D.: Algorithmic improvements on dynamic programming for the bi-objective 0,1 knapsack problem. Comput. Optim. Appl. 56(1), 97\u2013111 (2013)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"9346_CR17","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.ejor.2009.06.024","volume":"203","author":"K Florios","year":"2010","unstructured":"Florios, K., Mavrotas, G., Diakoulaki, D.: Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms. Eur. J. Oper. Res. 203(1), 14\u201321 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"9346_CR18","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1023\/A:1009682532542","volume":"6","author":"X Gandibleux","year":"2000","unstructured":"Gandibleux, X., Fr\u00e9ville, A.: Tabu search based procedure for solving the 0\u20131 multiobjective knapsack problem: The two objectives case. J. Heuristics 6, 361\u2013383 (2000)","journal-title":"J. Heuristics"},{"key":"9346_CR19","unstructured":"Gandibleux, X., Perederieieva, O.: Some observations on the bi-objective 01 bi-dimensional knapsack problem. In: IFORS 2011 (19th Triennial Conference of the International Federation of Operational Research Societies). 10\u201315 July 2011, Melbourne, Australia (2011)"},{"key":"9346_CR20","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/BF02591863","volume":"31","author":"B Gavish","year":"1985","unstructured":"Gavish, B., Pirkul, H.: Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality. Math. Program. 31, 78\u2013105 (1985)","journal-title":"Math. Program."},{"issue":"6","key":"9346_CR21","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1287\/opre.13.6.879","volume":"13","author":"F Glover","year":"1965","unstructured":"Glover, F.: A multiphase-dual algorithm for the zero-one integer programming problem. Oper. Res. 13(6), 879\u2013919 (1965)","journal-title":"Oper. Res."},{"issue":"4","key":"9346_CR22","first-page":"407","volume":"5","author":"DE Goldberg","year":"1990","unstructured":"Goldberg, D.E.: Probability matching, the magnitude of reinforcement, and classifier system bidding. Mach. Learn. 5(4), 407\u2013425 (1990)","journal-title":"Mach. Learn."},{"key":"9346_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-21434-9","volume-title":"Autonomous Search","author":"Y Hamadi","year":"2012","unstructured":"Hamadi, Y., Monfroy, E., Saubion, F.: Autonomous Search. Springer, Berlin (2012)"},{"key":"9346_CR24","unstructured":"Jorge, J.: Nouvelles propositions pour la r\u00e9solution exacte du sac \u00e0 dos multi-objectif unidimensionnel en variables binaires. Ph.D. thesis, Universit\u00e9 de Nantes (2010)"},{"key":"9346_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2004)"},{"key":"9346_CR26","doi-asserted-by":"crossref","unstructured":"Klamroth, K., Wiecek, M. M.: Dynamic programming approaches to the multiple criteria knapsack problem. Naval Res. Logistics, pp. 57\u201376 (2000)","DOI":"10.1002\/(SICI)1520-6750(200002)47:1<57::AID-NAV4>3.0.CO;2-4"},{"issue":"9","key":"9346_CR27","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1287\/mnsc.13.9.723","volume":"13","author":"PJ Kolesar","year":"1967","unstructured":"Kolesar, P.J.: A branch and bound algorithm for the knapsack problem. Manag. Sci. 13(9), 723\u2013735 (1967)","journal-title":"Manag. Sci."},{"key":"9346_CR28","doi-asserted-by":"crossref","unstructured":"Loth, M., Sebag, M., Hamadi, Y., Schoenauer, M.: Bandit-based search for constraint programming. In: Principles and Practice of Constraint Programming\u201419th International Conference, CP 2013, Uppsala, Sweden, September 16\u201320, 2013. Proceedings, volume 8124 of Lecture Notes in Computer Science, pp. 464\u2013480. Springer (2013)","DOI":"10.1007\/978-3-642-40627-0_36"},{"issue":"3","key":"9346_CR29","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/mnsc.45.3.414","volume":"45","author":"S Martello","year":"1999","unstructured":"Martello, S., Pisinger, D., Toth, P.: Dynamic programming and strong bounds for the 0\u20131 knapsack problem. Manag. Sci. 45(3), 414\u2013424 (1999)","journal-title":"Manag. Sci."},{"key":"9346_CR30","volume-title":"Knapsack Problems : Algorithms and Computer Implementations","author":"S Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems : Algorithms and Computer Implementations. Wiley, New York (1990)"},{"key":"9346_CR31","doi-asserted-by":"crossref","unstructured":"Maturana, J., Fialho, A., Saubion, F., Schoenauer, M., Lardeux, F., Sebag, M.: Adaptive operator selection and management in evolutionary algorithms. In: Autonomous Search, pp. 161\u2013189. Springer (2012)","DOI":"10.1007\/978-3-642-21434-9_7"},{"issue":"18","key":"9346_CR32","first-page":"9652","volume":"219","author":"G Mavrotas","year":"2013","unstructured":"Mavrotas, G., Florios, K.: An improved version of the augmented $$\\varepsilon $$ \u03b5 -constraint method (augmecon2) for finding the exact pareto set in multi-objective integer programming problems. Appl. Math. Comput. 219(18), 9652\u20139669 (2013)","journal-title":"Appl. Math. Comput."},{"issue":"12","key":"9346_CR33","doi-asserted-by":"crossref","first-page":"2302","DOI":"10.1287\/mnsc.1100.1248","volume":"56","author":"\u00d6 \u00d6zpeynirci","year":"2010","unstructured":"\u00d6zpeynirci, \u00d6., K\u00f6ksalan, M.: An exact algorithm for finding extreme supported nondominated points of multiobjective mixed integer programs. Manag. Sci. 56(12), 2302\u20132315 (2010)","journal-title":"Manag. Sci."},{"key":"9346_CR34","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1093\/biomet\/41.1-2.100","volume":"41","author":"E Page","year":"1954","unstructured":"Page, E.: Continuous inspection schemes. Biometrika 41, 100\u2013115 (1954)","journal-title":"Biometrika"},{"key":"9346_CR35","unstructured":"Pisinger, D.: Implementation of Combo. (2002) http:\/\/www.diku.dk\/~pisinger\/combo.c"},{"issue":"3","key":"9346_CR36","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1016\/j.ejor.2017.01.032","volume":"260","author":"A Przybylski","year":"2017","unstructured":"Przybylski, A., Gandibleux, X.: Multi-objective branch and bound. Eur. J. Oper. Res. 260(3), 856\u2013872 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9346_CR37","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.disopt.2010.03.005","volume":"7","author":"A Przybylski","year":"2010","unstructured":"Przybylski, A., Gandibleux, X., Ehrgott, M.: A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives. Discrete Optim. 7(3), 149\u2013165 (2010)","journal-title":"Discrete Optim."},{"issue":"4","key":"9346_CR38","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1057\/jors.1979.78","volume":"30","author":"W Shih","year":"1979","unstructured":"Shih, W.: A branch and bound method for the multiconstraint zero-one knapsack problem. J. Oper. Res. Soc. 30(4), 369\u2013378 (1979)","journal-title":"J. Oper. Res. Soc."},{"key":"9346_CR39","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1287\/ijoc.1070.0260","volume":"20","author":"F Sourd","year":"2008","unstructured":"Sourd, F., Spanjaard, O.: A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem. INFORMS J. Comput. 20, 472\u2013484 (2008)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"9346_CR40","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1002\/nav.3800220210","volume":"22","author":"A Thesen","year":"1975","unstructured":"Thesen, A.: A recursive branch and bound algorithm for the multidimensional knapsack problem. Naval Res. Logistics Quart. 22(2), 341\u2013353 (1975)","journal-title":"Naval Res. Logistics Quart."},{"issue":"2","key":"9346_CR41","first-page":"149","volume":"20","author":"EL Ulungu","year":"1995","unstructured":"Ulungu, E.L., Teghem, J.: The two phases method: an efficient procedure to solve bi-objective combinatorial optimization problems. Found. Comput. Decis. Sci. 20(2), 149\u2013165 (1995)","journal-title":"Found. Comput. Decis. Sci."},{"key":"9346_CR42","doi-asserted-by":"crossref","unstructured":"Ulungu, E. L., Teghem, J.: Solving multi-objective knapsack problem by a branch-and-bound procedure. In: Multicriteria Analysis: Proceedings of the XIth International Conference on MCDM, 1\u20136 August 1994, Coimbra, Portugal, pp. 269\u2013278 (1997)","DOI":"10.1007\/978-3-642-60667-0_26"},{"key":"9346_CR43","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1023\/A:1008258310679","volume":"12","author":"M Vis\u00e9e","year":"1998","unstructured":"Vis\u00e9e, M., Teghem, J., Pirlot, M., Ulungu, E.L.: Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem. J. Global Optim. 12, 139\u2013155 (1998)","journal-title":"J. Global Optim."},{"issue":"1","key":"9346_CR44","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.ejor.2013.09.001","volume":"234","author":"W Zhang","year":"2014","unstructured":"Zhang, W., Reimann, M.: A simple augmented $$\\epsilon $$ \u03f5 -constraint method for multi-objective mathematical integer programming problems. Eur. J. Oper. Res. 234(1), 15\u201324 (2014)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-017-9346-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-017-9346-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-017-9346-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,27]],"date-time":"2019-09-27T20:25:01Z","timestamp":1569615901000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-017-9346-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,30]]},"references-count":44,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["9346"],"URL":"https:\/\/doi.org\/10.1007\/s10732-017-9346-9","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2017,6,30]]}}}