{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T20:44:48Z","timestamp":1759178688352,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642298271"},{"type":"electronic","value":"9783642298288"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29828-8_20","type":"book-chapter","created":{"date-parts":[[2012,5,14]],"date-time":"2012-05-14T07:59:40Z","timestamp":1336982380000},"page":"307-321","source":"Crossref","is-referenced-by-count":6,"title":["On Beam Search for Multicriteria Combinatorial Optimization Problems"],"prefix":"10.1007","author":[{"given":"An\u00edbal","family":"Ponte","sequence":"first","affiliation":[]},{"given":"Lu\u00eds","family":"Paquete","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9 R.","family":"Figueira","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"20_CR1","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1287\/mnsc.25.1.73","volume":"25","author":"Y. Aneja","year":"1979","unstructured":"Aneja, Y., Nair, K.: Bicriteria transportation problem. Management Science\u00a025(1), 73\u201378 (1979)","journal-title":"Management Science"},{"issue":"1","key":"20_CR2","doi-asserted-by":"publisher","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-1 multi-objective knapsack problem. Computers & Operations Research\u00a036(1), 260\u2013279 (2009)","journal-title":"Computers & Operations Research"},{"issue":"3","key":"20_CR3","doi-asserted-by":"publisher","first-page":"1653","DOI":"10.1016\/j.ejor.2006.08.008","volume":"181","author":"N. Beume","year":"2007","unstructured":"Beume, N., Naujoks, B., Emmerich, M.: SMS-EMOA: Multiobjective selection based on dominated hypervolume. European Journal of Operational Research\u00a0181(3), 1653\u20131669 (2007)","journal-title":"European Journal of Operational Research"},{"key":"20_CR4","series-title":"SCI","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-3-540-78295-7_4","volume-title":"Hybrid Metaheuristics: An Emerging Approach to Optimization","author":"C. Blum","year":"2008","unstructured":"Blum, C., Cotta, C., F\u00e9rnandez, A., Gallardo, J., Mastrolilli, M.: Hybridizations of Metaheuristics with Branch & Bound Derivates. In: Blum, C., et al. (eds.) Hybrid Metaheuristics: An Emerging Approach to Optimization. SCI, vol.\u00a0114, pp. 85\u2013116. Springer, Heidelberg (2008)"},{"issue":"1","key":"20_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-008-9193-z","volume":"57","author":"H. Blunck","year":"2010","unstructured":"Blunck, H., Vahrenhold, J.: In-place algorithms for computing (layers of) maxima. Algorithmica\u00a057(1), 1\u201321 (2010)","journal-title":"Algorithmica"},{"issue":"12","key":"20_CR6","doi-asserted-by":"publisher","first-page":"1865","DOI":"10.1016\/S0305-0548(02)00112-0","volume":"30","author":"M. Captivo","year":"2003","unstructured":"Captivo, M., Cl\u00edmaco, J., Figueira, J., Martins, E., dos Santos, J.: Solving bicriteria 0-1 knapsack problems using a labeling algorithm. Computers & Operations Research\u00a030(12), 1865\u20131886 (2003)","journal-title":"Computers & Operations Research"},{"issue":"3","key":"20_CR7","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V. Chv\u00e1tal","year":"1979","unstructured":"Chv\u00e1tal, V.: A greedy heuristic for the set-covering problem. Mathematics of Operations Research\u00a04(3), 233\u2013235 (1979)","journal-title":"Mathematics of Operations Research"},{"key":"20_CR8","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms. MIT Press (2001)"},{"issue":"9","key":"20_CR9","doi-asserted-by":"publisher","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. Computers & Operations Research\u00a034(9), 2674\u20132694 (2007)","journal-title":"Computers & Operations Research"},{"issue":"12","key":"20_CR10","doi-asserted-by":"publisher","first-page":"1603","DOI":"10.1287\/mnsc.48.12.1603.445","volume":"48","author":"T. Erlebach","year":"2002","unstructured":"Erlebach, T., Kellerer, H., Pferschy, U.: Approximating multiobjective knapsack problems. Management Science\u00a048(12), 1603\u20131612 (2002)","journal-title":"Management Science"},{"key":"20_CR11","unstructured":"Figueira, J., Paquete, L., Sim\u00f5es, M., Vanderpooten, D.: Algorithmic improvements on dynamic programming for the bi-objective {0,1} knapsack problem. Tech. Rep. TR2011\/03, CISUC, University of Coimbra (2011)"},{"issue":"3","key":"20_CR12","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1023\/A:1009682532542","volume":"6","author":"X. Gandibleux","year":"2000","unstructured":"Gandibleux, X., Freville, A.: Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case. Journal of Heuristics\u00a06(3), 361\u2013383 (2000)","journal-title":"Journal of Heuristics"},{"issue":"2","key":"20_CR13","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.ejor.2004.08.005","volume":"169","author":"G. Silva da","year":"2006","unstructured":"da Silva, G., Cl\u00edmaco, C., Figueira, J.: A scatter search method for bi-criteria {0, 1}-knapsack problems. European Journal of Operational Research\u00a0169(2), 373\u2013391 (2006)","journal-title":"European Journal of Operational Research"},{"key":"20_CR14","series-title":"AISC","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/978-3-540-36510-5_19","volume-title":"Multi-Objective Programming and Goal Programming: Theory and Applications","author":"N. Honda","year":"2003","unstructured":"Honda, N.: Backtrack beam search for multiobjective scheduling problem. In: Tanino, T., et al. (eds.) Multi-Objective Programming and Goal Programming: Theory and Applications. AISC, pp. 147\u2013152. Springer, Heidelberg (2003)"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer (2004)","DOI":"10.1007\/978-3-540-24777-7"},{"issue":"1","key":"20_CR16","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1002\/(SICI)1520-6750(200002)47:1<57::AID-NAV4>3.0.CO;2-4","volume":"47","author":"K. Klamroth","year":"2000","unstructured":"Klamroth, K., Wiecek, M.: Dynamic programming approaches to the multiple criteria knapsack problem. Naval Research Logistics\u00a047(1), 57\u201376 (2000)","journal-title":"Naval Research Logistics"},{"issue":"4","key":"20_CR17","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1145\/321906.321910","volume":"22","author":"H. Kung","year":"1975","unstructured":"Kung, H., Luccio, F., Preparata, F.: On finding the maxima of a set of vectors. Journal of the ACM\u00a022(4), 469\u2013476 (1975)","journal-title":"Journal of the ACM"},{"key":"20_CR18","unstructured":"Martello, S., Toth, P.: Knapsack Problems \u2013 Algorithms and Computer Implementations. John Wiley & Sons (1990)"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C., Yannakakis, M.: On the approximability of trade-offs and optimal access of web sources. In: IEEE Symposium on Foundation of Computer Science, pp. 86\u201392 (2000)","DOI":"10.1109\/SFCS.2000.892068"},{"key":"20_CR20","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1016\/j.ejor.2007.02.024","volume":"186","author":"I. Sabuncuo\u011flu","year":"2008","unstructured":"Sabuncuo\u011flu, I., Gocgun, Y., Eerl, E.: Backtracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling. European Journal of Operational Research\u00a0186, 915\u2013930 (2008)","journal-title":"European Journal of Operational Research"},{"key":"20_CR21","unstructured":"Sch\u00f6bel, A.: Set covering problems with consecutive ones property. Tech. Rep. 2005-03, Georg-August Universit\u00e4t G\u00f6ttingen, Institut f\u00fcr Numerische und Angewandte Mathematik (2005)"},{"key":"20_CR22","first-page":"546","volume-title":"Multiple Criteria Optimization: Theory, Computation and Application","author":"R. Steuer","year":"1986","unstructured":"Steuer, R.: Multiple Criteria Optimization: Theory, Computation and Application, p. 546. John Wiley, New York (1986)"},{"issue":"2","key":"20_CR23","doi-asserted-by":"publisher","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\u2013objective knapsack problem. Journal of Global Optimization\u00a012(2), 139\u2013155 (1998)","journal-title":"Journal of Global Optimization"},{"issue":"2","key":"20_CR24","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1109\/TEVC.2003.810758","volume":"7","author":"E. Zitzler","year":"2003","unstructured":"Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C., da Fonseca, V.: Performance assessment of multiobjective optimizers: An analysis and review. IEEE Transactions on Evolutionary Computation\u00a07(2), 529\u2013533 (2003)","journal-title":"IEEE Transactions on Evolutionary Computation"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29828-8_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:46:22Z","timestamp":1743119182000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29828-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642298271","9783642298288"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29828-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}