{"id":"https://openalex.org/W1523311306","doi":"https://doi.org/10.3233/fi-2013-822","title":"Comparing Problem Solving Strategies for NP-hard Optimization Problems","display_name":"Comparing Problem Solving Strategies for NP-hard Optimization Problems","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W1523311306","doi":"https://doi.org/10.3233/fi-2013-822","mag":"1523311306"},"language":"en","primary_location":{"id":"doi:10.3233/fi-2013-822","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2013-822","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070504350","display_name":"Mercedes Hidalgo-Herrero","orcid":"https://orcid.org/0000-0001-6510-6090"},"institutions":[{"id":"https://openalex.org/I121748325","display_name":"Universidad Complutense de Madrid","ror":"https://ror.org/02p0gd045","country_code":"ES","type":"education","lineage":["https://openalex.org/I121748325"]}],"countries":["ES"],"is_corresponding":true,"raw_author_name":"Mercedes Hidalgo-Herrero","raw_affiliation_strings":["Facultad de Educaci\u00f3n, Universidad Complutense de Madrid, E-28040 Madrid, Spain. mhidalgo@edu.ucm.es"],"affiliations":[{"raw_affiliation_string":"Facultad de Educaci\u00f3n, Universidad Complutense de Madrid, E-28040 Madrid, Spain. mhidalgo@edu.ucm.es","institution_ids":["https://openalex.org/I121748325"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059087539","display_name":"Pablo Rabanal","orcid":"https://orcid.org/0000-0002-5386-6866"},"institutions":[{"id":"https://openalex.org/I121748325","display_name":"Universidad Complutense de Madrid","ror":"https://ror.org/02p0gd045","country_code":"ES","type":"education","lineage":["https://openalex.org/I121748325"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Pablo Rabanal","raw_affiliation_strings":["Facultad de Inform\u00e1tica, Universidad Complutense de Madrid, E-28040 Madrid, Spain. prabanal@fdi.ucm.es, {isrodrig,fernando}@sip.ucm.es"],"affiliations":[{"raw_affiliation_string":"Facultad de Inform\u00e1tica, Universidad Complutense de Madrid, E-28040 Madrid, Spain. prabanal@fdi.ucm.es, {isrodrig,fernando}@sip.ucm.es","institution_ids":["https://openalex.org/I121748325"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080808845","display_name":"Ismael Rodr\u0131\u0301guez","orcid":"https://orcid.org/0000-0002-7748-7780"},"institutions":[{"id":"https://openalex.org/I121748325","display_name":"Universidad Complutense de Madrid","ror":"https://ror.org/02p0gd045","country_code":"ES","type":"education","lineage":["https://openalex.org/I121748325"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Ismael Rodr\u00edguez","raw_affiliation_strings":["Facultad de Inform\u00e1tica, Universidad Complutense de Madrid, E-28040 Madrid, Spain. prabanal@fdi.ucm.es, {isrodrig,fernando}@sip.ucm.es"],"affiliations":[{"raw_affiliation_string":"Facultad de Inform\u00e1tica, Universidad Complutense de Madrid, E-28040 Madrid, Spain. prabanal@fdi.ucm.es, {isrodrig,fernando}@sip.ucm.es","institution_ids":["https://openalex.org/I121748325"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070208947","display_name":"Fernando Rubio","orcid":"https://orcid.org/0000-0002-8969-6002"},"institutions":[{"id":"https://openalex.org/I121748325","display_name":"Universidad Complutense de Madrid","ror":"https://ror.org/02p0gd045","country_code":"ES","type":"education","lineage":["https://openalex.org/I121748325"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Fernando Rubio","raw_affiliation_strings":["Facultad de Inform\u00e1tica, Universidad Complutense de Madrid, E-28040 Madrid, Spain. prabanal@fdi.ucm.es, {isrodrig,fernando}@sip.ucm.es"],"affiliations":[{"raw_affiliation_string":"Facultad de Inform\u00e1tica, Universidad Complutense de Madrid, E-28040 Madrid, Spain. prabanal@fdi.ucm.es, {isrodrig,fernando}@sip.ucm.es","institution_ids":["https://openalex.org/I121748325"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5070504350"],"corresponding_institution_ids":["https://openalex.org/I121748325"],"apc_list":null,"apc_paid":null,"fwci":0.6896,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.73337373,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"124","issue":"1-2","first_page":"1","last_page":"25"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9983999729156494,"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"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9983999729156494,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9962999820709229,"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/np-complete","display_name":"NP-complete","score":0.716230034828186},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5595441460609436},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4799618721008301},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.45208871364593506},{"id":"https://openalex.org/keywords/p-versus-np-problem","display_name":"P versus NP problem","score":0.44904932379722595},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44334787130355835},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.383455753326416},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3576078414916992},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3421275019645691}],"concepts":[{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.716230034828186},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5595441460609436},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4799618721008301},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.45208871364593506},{"id":"https://openalex.org/C186861659","wikidata":"https://www.wikidata.org/wiki/Q746242","display_name":"P versus NP problem","level":3,"score":0.44904932379722595},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44334787130355835},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.383455753326416},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3576078414916992},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3421275019645691}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/fi-2013-822","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2013-822","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.8100000023841858,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W113282148","https://openalex.org/W1522578222","https://openalex.org/W1573676079","https://openalex.org/W1968994430","https://openalex.org/W1973415219","https://openalex.org/W2011039300","https://openalex.org/W2024060531","https://openalex.org/W2026891055","https://openalex.org/W2036265926","https://openalex.org/W2043751102","https://openalex.org/W2053079614","https://openalex.org/W2053913299","https://openalex.org/W2092439775","https://openalex.org/W2110367141","https://openalex.org/W2117537240","https://openalex.org/W2151362199","https://openalex.org/W2157737584","https://openalex.org/W2166843422","https://openalex.org/W2179622958","https://openalex.org/W2904250082","https://openalex.org/W3023540311","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4392856484","https://openalex.org/W4399652722","https://openalex.org/W4392543953","https://openalex.org/W4312809402","https://openalex.org/W1673188421","https://openalex.org/W2161801419","https://openalex.org/W2062731608","https://openalex.org/W2606468876","https://openalex.org/W4297670669","https://openalex.org/W1547393828"],"abstract_inverted_index":{"NP-complete":[0,13,26],"problems":[1,27],"are":[2],"particularly":[3],"hard":[4],"to":[5,31],"solve.":[6],"Unless":[7],"P=NP,":[8],"any":[9],"algorithm":[10],"solving":[11],"an":[12],"problem":[14],"takes":[15],"exponential":[16],"time":[17],"in":[18],"the":[19],"worst":[20],"case.":[21],"The":[22],"intrinsic":[23],"difficulty":[24],"of":[25],"when":[28],"we":[29],"try":[30],"optimally":[32],"solve":[33],"them":[34],"with":[35],"compute":[36]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":7},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
