{"id":"https://openalex.org/W2020127609","doi":"https://doi.org/10.1007/s10589-013-9551-x","title":"Algorithmic improvements on dynamic programming for the bi-objective {0,1} knapsack problem","display_name":"Algorithmic improvements on dynamic programming for the bi-objective {0,1} knapsack problem","publication_year":2013,"publication_date":"2013-03-14","ids":{"openalex":"https://openalex.org/W2020127609","doi":"https://doi.org/10.1007/s10589-013-9551-x","mag":"2020127609"},"language":"en","primary_location":{"id":"doi:10.1007/s10589-013-9551-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10589-013-9551-x","pdf_url":null,"source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-01505666","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5024152051","display_name":"Jos\u00e9 Rui Figueira","orcid":"https://orcid.org/0000-0001-9822-1167"},"institutions":[{"id":"https://openalex.org/I141596103","display_name":"University of Lisbon","ror":"https://ror.org/01c27hj86","country_code":"PT","type":"education","lineage":["https://openalex.org/I141596103"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Jos\u00e9 Rui Figueira","raw_affiliation_strings":["CEG-IST, Center for Management Studies, Instituto Superior T\u00e9cnico, Technical University of Lisbon, TagusPark, Av. Cavaco Silva, 2780-990, Porto Salvo, Portugal","CEG-IST, Center for Management Studies, Instituto Superior T\u00e9cnico, Technical University of Lisbon, Porto Salvo, Portugal 2780-990#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CEG-IST, Center for Management Studies, Instituto Superior T\u00e9cnico, Technical University of Lisbon, TagusPark, Av. Cavaco Silva, 2780-990, Porto Salvo, Portugal","institution_ids":[]},{"raw_affiliation_string":"CEG-IST, Center for Management Studies, Instituto Superior T\u00e9cnico, Technical University of Lisbon, Porto Salvo, Portugal 2780-990#TAB#","institution_ids":["https://openalex.org/I141596103"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055996291","display_name":"Lu\u00eds Paquete","orcid":"https://orcid.org/0000-0001-7525-8901"},"institutions":[{"id":"https://openalex.org/I76903346","display_name":"University of Coimbra","ror":"https://ror.org/04z8k9a98","country_code":"PT","type":"education","lineage":["https://openalex.org/I76903346"]}],"countries":["PT"],"is_corresponding":true,"raw_author_name":"Lu\u00eds Paquete","raw_affiliation_strings":["CISUC, Department of Informatics Engineering, University of Coimbra, P\u00f3lo II, 3030-290, Coimbra, Portugal","CISUC, Department of Informatics Engineering, University of Coimbra, Coimbra, Portugal 3030-290"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CISUC, Department of Informatics Engineering, University of Coimbra, P\u00f3lo II, 3030-290, Coimbra, Portugal","institution_ids":["https://openalex.org/I76903346"]},{"raw_affiliation_string":"CISUC, Department of Informatics Engineering, University of Coimbra, Coimbra, Portugal 3030-290","institution_ids":["https://openalex.org/I76903346"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039614931","display_name":"Marco Sim\u00f5es","orcid":"https://orcid.org/0000-0003-3713-2464"},"institutions":[{"id":"https://openalex.org/I76903346","display_name":"University of Coimbra","ror":"https://ror.org/04z8k9a98","country_code":"PT","type":"education","lineage":["https://openalex.org/I76903346"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Marco Sim\u00f5es","raw_affiliation_strings":["CISUC, Department of Informatics Engineering, University of Coimbra, P\u00f3lo II, 3030-290, Coimbra, Portugal","CISUC, Department of Informatics Engineering, University of Coimbra, Coimbra, Portugal 3030-290"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CISUC, Department of Informatics Engineering, University of Coimbra, P\u00f3lo II, 3030-290, Coimbra, Portugal","institution_ids":["https://openalex.org/I76903346"]},{"raw_affiliation_string":"CISUC, Department of Informatics Engineering, University of Coimbra, Coimbra, Portugal 3030-290","institution_ids":["https://openalex.org/I76903346"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061295470","display_name":"Daniel Vanderpooten","orcid":"https://orcid.org/0000-0002-5934-0603"},"institutions":[{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Daniel Vanderpooten","raw_affiliation_strings":["University Paris-Dauphine, LAMSADE, Place du Marechal de Lattre de Tassigny, 75775, Paris Cedex 16, France","University Paris-Dauphine, Paris Cedex 16, France 75775#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University Paris-Dauphine, LAMSADE, Place du Marechal de Lattre de Tassigny, 75775, Paris Cedex 16, France","institution_ids":["https://openalex.org/I56435720"]},{"raw_affiliation_string":"University Paris-Dauphine, Paris Cedex 16, France 75775#TAB#","institution_ids":["https://openalex.org/I56435720"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5055996291"],"corresponding_institution_ids":["https://openalex.org/I76903346"],"apc_list":{"value":2990,"currency":"USD","value_usd":2990},"apc_paid":null,"fwci":3.2074,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.91785009,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"56","issue":"1","first_page":"97","last_page":"111"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9908999800682068,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9872000217437744,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.9389595985412598},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7660021185874939},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6677590012550354},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.6489822864532471},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.623965322971344},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5869680047035217},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5756711959838867},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.5367449522018433},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.48596346378326416},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.4740222096443176},{"id":"https://openalex.org/keywords/change-making-problem","display_name":"Change-making problem","score":0.4489433765411377},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43145787715911865},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.41163116693496704},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3279421329498291},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3091827929019928},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.24525904655456543},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2429226040840149}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9389595985412598},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7660021185874939},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6677590012550354},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.6489822864532471},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.623965322971344},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5869680047035217},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5756711959838867},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.5367449522018433},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.48596346378326416},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.4740222096443176},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.4489433765411377},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43145787715911865},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.41163116693496704},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3279421329498291},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3091827929019928},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.24525904655456543},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2429226040840149},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/s10589-013-9551-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10589-013-9551-x","pdf_url":null,"source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.705.74","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.705.74","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.cisuc.uc.pt/ckfinder/userfiles/files/TR%202011-03.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-01505666v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01505666","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computational Optimization and Applications, 2013, 56 (1), ⟨10.1007/s10589-013-9551-x⟩","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:RePEc:spr:coopap:v:56:y:2013:i:1:p:97-111","is_oa":false,"landing_page_url":"http://hdl.handle.net/10.1007/s10589-013-9551-x","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:basepub.dauphine.fr:123456789/11180","is_oa":false,"landing_page_url":"https://basepub.dauphine.fr/handle/123456789/11180","pdf_url":null,"source":{"id":"https://openalex.org/S4306401007","display_name":"Base Institutionnelle de Recherche de l'universit\u00e9 Paris-Dauphine (BIRD) (University Paris-Dauphine)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102197404","host_organization_name":"Universit\u00e9 Paris-Sud","host_organization_lineage":["https://openalex.org/I102197404"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article accept\u00e9 pour publication ou publi\u00e9"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01505666v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01505666","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computational Optimization and Applications, 2013, 56 (1), ⟨10.1007/s10589-013-9551-x⟩","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4352465530","display_name":"GUaranteed Efficiency for PAReto optimal solutions Determination in multiobjective combinatorial optimization problems","funder_award_id":"ANR-09-BLAN-0361","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W254944847","https://openalex.org/W1486643454","https://openalex.org/W1701984136","https://openalex.org/W1966693694","https://openalex.org/W1968310215","https://openalex.org/W1968876856","https://openalex.org/W1977525540","https://openalex.org/W1978090048","https://openalex.org/W2000124998","https://openalex.org/W2005459393","https://openalex.org/W2007458506","https://openalex.org/W2024344169","https://openalex.org/W2032770229","https://openalex.org/W2036737894","https://openalex.org/W2038022125","https://openalex.org/W2039195892","https://openalex.org/W2060645964","https://openalex.org/W2065148320","https://openalex.org/W2066671865","https://openalex.org/W2128555856","https://openalex.org/W2153204245","https://openalex.org/W2752885492","https://openalex.org/W3145128584","https://openalex.org/W4236127247","https://openalex.org/W4246219036"],"related_works":["https://openalex.org/W2005493932","https://openalex.org/W2889442766","https://openalex.org/W2168163332","https://openalex.org/W2378557713","https://openalex.org/W2412614002","https://openalex.org/W42170116","https://openalex.org/W2048876360","https://openalex.org/W2009443800","https://openalex.org/W1969981152","https://openalex.org/W2087209118"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}