{"id":"https://openalex.org/W2017019823","doi":"https://doi.org/10.1007/s10589-007-9125-x","title":"A cutting plane algorithm for the capacitated facility location problem","display_name":"A cutting plane algorithm for the capacitated facility location problem","publication_year":2007,"publication_date":"2007-12-06","ids":{"openalex":"https://openalex.org/W2017019823","doi":"https://doi.org/10.1007/s10589-007-9125-x","mag":"2017019823"},"language":"en","primary_location":{"id":"doi:10.1007/s10589-007-9125-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10589-007-9125-x","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/A5053627768","display_name":"Pasquale Avella","orcid":"https://orcid.org/0000-0002-0462-3550"},"institutions":[{"id":"https://openalex.org/I16337185","display_name":"University of Sannio","ror":"https://ror.org/04vc81p87","country_code":"IT","type":"education","lineage":["https://openalex.org/I16337185"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Pasquale Avella","raw_affiliation_strings":["RCOST\u2014Research Center on Software Technology, Universit\u00e1 del Sannio, C.so Garibaldi 107, 82100, Benevento, Italy","RCOST--Research Center on Software Technology, Universit\u00e1 del Sannio, Benevento, Italy 82100"],"affiliations":[{"raw_affiliation_string":"RCOST\u2014Research Center on Software Technology, Universit\u00e1 del Sannio, C.so Garibaldi 107, 82100, Benevento, Italy","institution_ids":["https://openalex.org/I16337185"]},{"raw_affiliation_string":"RCOST--Research Center on Software Technology, Universit\u00e1 del Sannio, Benevento, Italy 82100","institution_ids":["https://openalex.org/I16337185"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069880315","display_name":"Maurizio Boccia","orcid":"https://orcid.org/0000-0003-4947-9852"},"institutions":[{"id":"https://openalex.org/I16337185","display_name":"University of Sannio","ror":"https://ror.org/04vc81p87","country_code":"IT","type":"education","lineage":["https://openalex.org/I16337185"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Maurizio Boccia","raw_affiliation_strings":["Dipartimento di Ingegneria, Universit\u00e1 del Sannio, Piazza Roma 21, Palazzo ex INPS, 82100, Benevento, Italy","Dipartimento di Ingegneria, Universit\u00e0 del Sannio, Benevento, Italy 82100#TAB#"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria, Universit\u00e1 del Sannio, Piazza Roma 21, Palazzo ex INPS, 82100, Benevento, Italy","institution_ids":["https://openalex.org/I16337185"]},{"raw_affiliation_string":"Dipartimento di Ingegneria, Universit\u00e0 del Sannio, Benevento, Italy 82100#TAB#","institution_ids":["https://openalex.org/I16337185"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5053627768"],"corresponding_institution_ids":["https://openalex.org/I16337185"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":49,"citation_normalized_percentile":{"value":0.09766742,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"43","issue":"1","first_page":"39","last_page":"65"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9959999918937683,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9904000163078308,"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/knapsack-problem","display_name":"Knapsack problem","score":0.8566294312477112},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.814724326133728},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.681752622127533},{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.6061453819274902},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.5320618748664856},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.4873700737953186},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.4803708493709564},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4467933475971222},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4294782280921936},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.42392656207084656},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4125077426433563},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.41219183802604675},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.35849955677986145},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.277660608291626},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1263323724269867},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07290208339691162}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8566294312477112},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.814724326133728},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.681752622127533},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.6061453819274902},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.5320618748664856},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.4873700737953186},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.4803708493709564},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4467933475971222},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4294782280921936},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.42392656207084656},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4125077426433563},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.41219183802604675},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.35849955677986145},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.277660608291626},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1263323724269867},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07290208339691162},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","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},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10589-007-9125-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10589-007-9125-x","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"},{"id":"pmh:oai:RePEc:spr:coopap:v:43:y:2009:i:1:p:39-65","is_oa":false,"landing_page_url":"http://hdl.handle.net/10.1007/s10589-007-9125-x","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.47999998927116394,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1762430620","https://openalex.org/W1968143987","https://openalex.org/W1975789655","https://openalex.org/W1985089902","https://openalex.org/W1990585107","https://openalex.org/W2010136497","https://openalex.org/W2049967755","https://openalex.org/W2050014122","https://openalex.org/W2059019391","https://openalex.org/W2060828289","https://openalex.org/W2061184451","https://openalex.org/W2112539464","https://openalex.org/W2153504150","https://openalex.org/W2155742317","https://openalex.org/W2169855002","https://openalex.org/W2505968561","https://openalex.org/W2608158342","https://openalex.org/W2802252028"],"related_works":["https://openalex.org/W3143387519","https://openalex.org/W276709744","https://openalex.org/W2028549267","https://openalex.org/W2468851130","https://openalex.org/W2157424698","https://openalex.org/W2006516272","https://openalex.org/W1991979416","https://openalex.org/W1784610412","https://openalex.org/W2039333724","https://openalex.org/W1987503114"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}