{"id":"https://openalex.org/W32755528","doi":"https://doi.org/10.1007/978-3-642-45062-4_88","title":"Anytime Pack Heuristic Search","display_name":"Anytime Pack Heuristic Search","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W32755528","doi":"https://doi.org/10.1007/978-3-642-45062-4_88","mag":"32755528"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-45062-4_88","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-642-45062-4_88","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-642-45062-4_88.pdf","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":true,"oa_status":"bronze","oa_url":"https://link.springer.com/content/pdf/10.1007/978-3-642-45062-4_88.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108336806","display_name":"Satya Gautam Vadlamudi","orcid":"https://orcid.org/0000-0002-5633-5112"},"institutions":[{"id":"https://openalex.org/I145894827","display_name":"Indian Institute of Technology Kharagpur","ror":"https://ror.org/03w5sq511","country_code":"IN","type":"education","lineage":["https://openalex.org/I145894827"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Satya Gautam Vadlamudi","raw_affiliation_strings":["Indian Institute of Technology Kharagpur, Kharagpur, WB, 721302, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Kharagpur, Kharagpur, WB, 721302, India","institution_ids":["https://openalex.org/I145894827"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048731133","display_name":"Sandip Aine","orcid":null},"institutions":[{"id":"https://openalex.org/I119939252","display_name":"Indraprastha Institute of Information Technology Delhi","ror":"https://ror.org/03vfp4g33","country_code":"IN","type":"education","lineage":["https://openalex.org/I119939252"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sandip Aine","raw_affiliation_strings":["Indraprastha Institute of Information Technology, New Delhi, DL, 110020, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indraprastha Institute of Information Technology, New Delhi, DL, 110020, India","institution_ids":["https://openalex.org/I119939252"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013205698","display_name":"P. P. Chakrabarti","orcid":"https://orcid.org/0000-0002-3553-8834"},"institutions":[{"id":"https://openalex.org/I145894827","display_name":"Indian Institute of Technology Kharagpur","ror":"https://ror.org/03w5sq511","country_code":"IN","type":"education","lineage":["https://openalex.org/I145894827"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Partha Pratim Chakrabarti","raw_affiliation_strings":["Indian Institute of Technology Kharagpur, Kharagpur, WB, 721302, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Kharagpur, Kharagpur, WB, 721302, India","institution_ids":["https://openalex.org/I145894827"]}]}],"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":1.5187,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.76598963,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"628","last_page":"634"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9968000054359436,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.655693531036377},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.6108675003051758},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.5864856243133545},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5786281824111938},{"id":"https://openalex.org/keywords/combinatorial-search","display_name":"Combinatorial search","score":0.5773112773895264},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.570483922958374},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5620497465133667},{"id":"https://openalex.org/keywords/best-first-search","display_name":"Best-first search","score":0.5356656312942505},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.4853178858757019},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.47200843691825867},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4573596715927124},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44156578183174133},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.43460613489151},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4260247051715851},{"id":"https://openalex.org/keywords/bidirectional-search","display_name":"Bidirectional search","score":0.41194647550582886},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.3931998014450073},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33797770738601685},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3133602738380432},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3075340688228607}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.655693531036377},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.6108675003051758},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.5864856243133545},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5786281824111938},{"id":"https://openalex.org/C203208320","wikidata":"https://www.wikidata.org/wiki/Q5150830","display_name":"Combinatorial search","level":4,"score":0.5773112773895264},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.570483922958374},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5620497465133667},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.5356656312942505},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.4853178858757019},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.47200843691825867},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4573596715927124},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44156578183174133},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.43460613489151},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4260247051715851},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.41194647550582886},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3931998014450073},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33797770738601685},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3133602738380432},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3075340688228607},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-45062-4_88","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-642-45062-4_88","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-642-45062-4_88.pdf","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"}],"best_oa_location":{"id":"doi:10.1007/978-3-642-45062-4_88","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-642-45062-4_88","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-642-45062-4_88.pdf","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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W32755528.pdf","grobid_xml":"https://content.openalex.org/works/W32755528.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W104748494","https://openalex.org/W1483468946","https://openalex.org/W1745899943","https://openalex.org/W1968808691","https://openalex.org/W1969483458","https://openalex.org/W1998133204","https://openalex.org/W2023018568","https://openalex.org/W2137095888","https://openalex.org/W2138403771","https://openalex.org/W2144931885","https://openalex.org/W2163428398","https://openalex.org/W2167051442","https://openalex.org/W4295846875"],"related_works":["https://openalex.org/W3111117784","https://openalex.org/W58921990","https://openalex.org/W2146921011","https://openalex.org/W2900392151","https://openalex.org/W1548704524","https://openalex.org/W2183220040","https://openalex.org/W2472792831","https://openalex.org/W2090589401","https://openalex.org/W2580810437","https://openalex.org/W32755528"],"abstract_inverted_index":null,"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}