{"id":"https://openalex.org/W2599964601","doi":"https://doi.org/10.1016/s0305-0548(02)00190-9","title":"Branch and peg algorithms for the simple plant location problem","display_name":"Branch and peg algorithms for the simple plant location problem","publication_year":2003,"publication_date":"2003-02-28","ids":{"openalex":"https://openalex.org/W2599964601","doi":"https://doi.org/10.1016/s0305-0548(02)00190-9","mag":"2599964601"},"language":"en","primary_location":{"id":"doi:10.1016/s0305-0548(02)00190-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0305-0548(02)00190-9","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","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/A5053683015","display_name":"Boris Goldengorin","orcid":"https://orcid.org/0000-0001-7399-581X"},"institutions":[{"id":"https://openalex.org/I169381384","display_name":"University of Groningen","ror":"https://ror.org/012p63287","country_code":"NL","type":"education","lineage":["https://openalex.org/I169381384"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Boris Goldengorin","raw_affiliation_strings":["Faculty of Economic Sciences, University of Groningen, P.O. Box 800, 9700AV Groningen, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Faculty of Economic Sciences, University of Groningen, P.O. Box 800, 9700AV Groningen, The Netherlands","institution_ids":["https://openalex.org/I169381384"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005052934","display_name":"Diptesh Ghosh","orcid":"https://orcid.org/0000-0002-2565-7856"},"institutions":[{"id":"https://openalex.org/I150870154","display_name":"Indian Institute of Management Ahmedabad","ror":"https://ror.org/02egcpy68","country_code":"IN","type":"education","lineage":["https://openalex.org/I150870154"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Diptesh Ghosh","raw_affiliation_strings":["Production and Quantitative Method Area, Indian Institute of Management Ahmedabad, Vastrapur, Ahmedabad 380015, India"],"affiliations":[{"raw_affiliation_string":"Production and Quantitative Method Area, Indian Institute of Management Ahmedabad, Vastrapur, Ahmedabad 380015, India","institution_ids":["https://openalex.org/I150870154"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109486236","display_name":"Gerard Sierksma","orcid":null},"institutions":[{"id":"https://openalex.org/I169381384","display_name":"University of Groningen","ror":"https://ror.org/012p63287","country_code":"NL","type":"education","lineage":["https://openalex.org/I169381384"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Gerard Sierksma","raw_affiliation_strings":["Faculty of Economic Sciences, University of Groningen, P.O. Box 800, 9700AV Groningen, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Faculty of Economic Sciences, University of Groningen, P.O. Box 800, 9700AV Groningen, The Netherlands","institution_ids":["https://openalex.org/I169381384"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5005052934"],"corresponding_institution_ids":["https://openalex.org/I150870154"],"apc_list":{"value":3210,"currency":"USD","value_usd":3210},"apc_paid":null,"fwci":1.2844,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.86321075,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"31","issue":"2","first_page":"241","last_page":"255"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","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.9980999827384949,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.7617915868759155},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.639185905456543},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.6072037816047668},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5569030046463013},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5427115559577942},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5246089696884155},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5047756433486938},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49448370933532715},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.4812014698982239},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.45486918091773987},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.45337435603141785},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4427644908428192},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.42568355798721313},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.384048193693161},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.24833369255065918},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.19531545042991638},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.12497743964195251}],"concepts":[{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.7617915868759155},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.639185905456543},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.6072037816047668},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5569030046463013},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5427115559577942},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5246089696884155},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5047756433486938},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49448370933532715},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.4812014698982239},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.45486918091773987},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.45337435603141785},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4427644908428192},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.42568355798721313},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.384048193693161},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.24833369255065918},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.19531545042991638},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.12497743964195251},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s0305-0548(02)00190-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0305-0548(02)00190-9","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:pure.rug.nl:publications/1a41234a-95dd-4c78-b227-d921abf688d8","is_oa":false,"landing_page_url":"https://research.rug.nl/en/publications/1a41234a-95dd-4c78-b227-d921abf688d8","pdf_url":null,"source":{"id":"https://openalex.org/S4306400420","display_name":"University of Groningen research database (University of Groningen / Centre for Information Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I169381384","host_organization_name":"University of Groningen","host_organization_lineage":["https://openalex.org/I169381384"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Goldengorin, B, Ghosh, D & Sierksma, G 2004, 'Branch and peg algorithms for the simple plant location problem', Computers & Operations Research, vol. 31, no. 2, pp. 241-255. https://doi.org/10.1016/S0305-0548(02)00190-9","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1966710709","https://openalex.org/W1987550262","https://openalex.org/W1993459650","https://openalex.org/W2052101561","https://openalex.org/W2059217220","https://openalex.org/W2093499126","https://openalex.org/W2111691607","https://openalex.org/W2144519436","https://openalex.org/W2169855002","https://openalex.org/W3143763127","https://openalex.org/W4302399279","https://openalex.org/W6638329590","https://openalex.org/W6792519968"],"related_works":["https://openalex.org/W2143061299","https://openalex.org/W1983294952","https://openalex.org/W2165085685","https://openalex.org/W2029446116","https://openalex.org/W2170422083","https://openalex.org/W4304192591","https://openalex.org/W2108334735","https://openalex.org/W2158318958","https://openalex.org/W1989257897","https://openalex.org/W2389899617"],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}