{"id":"https://openalex.org/W1547468430","doi":"https://doi.org/10.1007/978-3-540-24838-5_32","title":"An Improved Time-Sensitive Metaheuristic Framework for Combinatorial Optimization","display_name":"An Improved Time-Sensitive Metaheuristic Framework for Combinatorial Optimization","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W1547468430","doi":"https://doi.org/10.1007/978-3-540-24838-5_32","mag":"1547468430"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-24838-5_32","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-24838-5_32","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5019979430","display_name":"Vinhthuy Phan","orcid":"https://orcid.org/0000-0001-6108-1228"},"institutions":[{"id":"https://openalex.org/I94658018","display_name":"University of Memphis","ror":"https://ror.org/01cq23130","country_code":"US","type":"education","lineage":["https://openalex.org/I94658018"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vinhthuy Phan","raw_affiliation_strings":["University of Memphis, Memphis, TN, 38152, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Memphis, Memphis, TN, 38152, USA","institution_ids":["https://openalex.org/I94658018"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060741187","display_name":"Steven Skiena","orcid":"https://orcid.org/0000-0003-0397-7514"},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Steven Skiena","raw_affiliation_strings":["SUNY Stony Brook, Stony Brook, NY, 11794, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"SUNY Stony Brook, Stony Brook, NY, 11794, USA","institution_ids":["https://openalex.org/I59553526"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"432","last_page":"445"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9986000061035156,"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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9986000061035156,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.8314462900161743},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.80279541015625},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.774838924407959},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7102749347686768},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.673029899597168},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.6317018866539001},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5586049556732178},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.5544739961624146},{"id":"https://openalex.org/keywords/combinatorial-explosion","display_name":"Combinatorial explosion","score":0.4264237582683563},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.42100194096565247},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.41955575346946716},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.267118901014328},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14665085077285767},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07295688986778259}],"concepts":[{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.8314462900161743},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.80279541015625},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.774838924407959},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7102749347686768},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.673029899597168},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.6317018866539001},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5586049556732178},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.5544739961624146},{"id":"https://openalex.org/C115908005","wikidata":"https://www.wikidata.org/wiki/Q2668364","display_name":"Combinatorial explosion","level":2,"score":0.4264237582683563},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.42100194096565247},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.41955575346946716},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.267118901014328},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14665085077285767},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07295688986778259},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-540-24838-5_32","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-24838-5_32","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.90.5276","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.5276","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cetus.cs.memphis.edu/vphan/files/papers/wea04.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W18766686","https://openalex.org/W32778827","https://openalex.org/W125872373","https://openalex.org/W129209152","https://openalex.org/W168006464","https://openalex.org/W224753561","https://openalex.org/W420707828","https://openalex.org/W1488043257","https://openalex.org/W1503705371","https://openalex.org/W1506440812","https://openalex.org/W1893880893","https://openalex.org/W1970459032","https://openalex.org/W1973264045","https://openalex.org/W2001157763","https://openalex.org/W2011039300","https://openalex.org/W2021061679","https://openalex.org/W2023200270","https://openalex.org/W2065169094","https://openalex.org/W2079782414","https://openalex.org/W2080241423","https://openalex.org/W2090275183","https://openalex.org/W2105724840","https://openalex.org/W2112608575","https://openalex.org/W2117082818","https://openalex.org/W2130270308","https://openalex.org/W2137300667","https://openalex.org/W2151554678","https://openalex.org/W2167036627","https://openalex.org/W2167353639","https://openalex.org/W2476096155","https://openalex.org/W2486038297","https://openalex.org/W2997776631","https://openalex.org/W3148293037","https://openalex.org/W4250047106"],"related_works":["https://openalex.org/W1571373126","https://openalex.org/W3205136130","https://openalex.org/W1575663621","https://openalex.org/W2807679627","https://openalex.org/W2041490059","https://openalex.org/W2133301106","https://openalex.org/W1604727913","https://openalex.org/W2039568841","https://openalex.org/W2053228469","https://openalex.org/W2006721481"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}