{"id":"https://openalex.org/W2112631981","doi":"https://doi.org/10.1023/a:1018302308154","title":"A Parallel Interior Point Method and Its Application to Facility Location Problems","display_name":"A Parallel Interior Point Method and Its Application to Facility Location Problems","publication_year":1998,"publication_date":"1998-03-01","ids":{"openalex":"https://openalex.org/W2112631981","doi":"https://doi.org/10.1023/a:1018302308154","mag":"2112631981"},"language":"en","primary_location":{"id":"doi:10.1023/a:1018302308154","is_oa":false,"landing_page_url":"https://doi.org/10.1023/a:1018302308154","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032896649","display_name":"Amal de Silva","orcid":null},"institutions":[{"id":"https://openalex.org/I11701301","display_name":"Griffith University","ror":"https://ror.org/02sc3r913","country_code":"AU","type":"education","lineage":["https://openalex.org/I11701301"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Amal de Silva","raw_affiliation_strings":["School of Computing and Information Technology, Griffith University, Nathan, QLD, 4111, Australia","School of Computing and Information Technology,  Griffith University, Nathan, QLD 4111, Australia. E-mail: amal@cit.gu.edu.au, davida@cit.gu.edu.au"],"affiliations":[{"raw_affiliation_string":"School of Computing and Information Technology, Griffith University, Nathan, QLD, 4111, Australia","institution_ids":["https://openalex.org/I11701301"]},{"raw_affiliation_string":"School of Computing and Information Technology,  Griffith University, Nathan, QLD 4111, Australia. E-mail: amal@cit.gu.edu.au, davida@cit.gu.edu.au","institution_ids":["https://openalex.org/I11701301"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000306843","display_name":"David Abramson","orcid":"https://orcid.org/0000-0003-0441-4596"},"institutions":[{"id":"https://openalex.org/I11701301","display_name":"Griffith University","ror":"https://ror.org/02sc3r913","country_code":"AU","type":"education","lineage":["https://openalex.org/I11701301"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"David Abramson","raw_affiliation_strings":["School of Computing and Information Technology, Griffith University, Nathan, QLD, 4111, Australia","School of Computing and Information Technology,  Griffith University, Nathan, QLD 4111, Australia. E-mail: amal@cit.gu.edu.au, davida@cit.gu.edu.au"],"affiliations":[{"raw_affiliation_string":"School of Computing and Information Technology, Griffith University, Nathan, QLD, 4111, Australia","institution_ids":["https://openalex.org/I11701301"]},{"raw_affiliation_string":"School of Computing and Information Technology,  Griffith University, Nathan, QLD 4111, Australia. E-mail: amal@cit.gu.edu.au, davida@cit.gu.edu.au","institution_ids":["https://openalex.org/I11701301"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5032896649"],"corresponding_institution_ids":["https://openalex.org/I11701301"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":1.3946,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.83185053,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"9","issue":"3","first_page":"249","last_page":"273"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9962000250816345,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.9922999739646912,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/interior-point-method","display_name":"Interior point method","score":0.7127664685249329},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6754757165908813},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.6729929447174072},{"id":"https://openalex.org/keywords/diagonal","display_name":"Diagonal","score":0.6101007461547852},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.563869833946228},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5520992279052734},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.5417760610580444},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5279430747032166},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.5090296268463135},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.5000166893005371},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.47019538283348083},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4552731215953827},{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.451330304145813},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.44854798913002014},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4455111622810364},{"id":"https://openalex.org/keywords/row","display_name":"Row","score":0.4248640239238739},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4067188501358032},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.26830607652664185},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.17915144562721252}],"concepts":[{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.7127664685249329},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6754757165908813},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.6729929447174072},{"id":"https://openalex.org/C130367717","wikidata":"https://www.wikidata.org/wiki/Q189791","display_name":"Diagonal","level":2,"score":0.6101007461547852},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.563869833946228},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5520992279052734},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.5417760610580444},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5279430747032166},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.5090296268463135},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.5000166893005371},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.47019538283348083},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4552731215953827},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.451330304145813},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.44854798913002014},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4455111622810364},{"id":"https://openalex.org/C135598885","wikidata":"https://www.wikidata.org/wiki/Q1366302","display_name":"Row","level":2,"score":0.4248640239238739},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4067188501358032},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26830607652664185},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.17915144562721252},{"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/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1023/a:1018302308154","is_oa":false,"landing_page_url":"https://doi.org/10.1023/a:1018302308154","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W93670263","https://openalex.org/W1503193986","https://openalex.org/W1585892185","https://openalex.org/W1981315194","https://openalex.org/W1981885118","https://openalex.org/W2012436468","https://openalex.org/W2022985590","https://openalex.org/W2030490984","https://openalex.org/W2045622192","https://openalex.org/W2049967755","https://openalex.org/W2051679444","https://openalex.org/W2057697122","https://openalex.org/W2086648616","https://openalex.org/W2086867325","https://openalex.org/W2092407906","https://openalex.org/W2094757704","https://openalex.org/W2116337907","https://openalex.org/W2118152326","https://openalex.org/W2170546376","https://openalex.org/W6601653889"],"related_works":["https://openalex.org/W4313384610","https://openalex.org/W2037099387","https://openalex.org/W1989947834","https://openalex.org/W2004980487","https://openalex.org/W778425586","https://openalex.org/W2964424355","https://openalex.org/W1982719520","https://openalex.org/W2365803335","https://openalex.org/W2062502816","https://openalex.org/W1959047"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}