{"id":"https://openalex.org/W1800762347","doi":"https://doi.org/10.1007/s10288-003-0012-8","title":"Primal separation algorithms","display_name":"Primal separation algorithms","publication_year":2003,"publication_date":"2003-10-01","ids":{"openalex":"https://openalex.org/W1800762347","doi":"https://doi.org/10.1007/s10288-003-0012-8","mag":"1800762347"},"language":"en","primary_location":{"id":"pmh:oai:publications.polymtl.ca:25733","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306401013","display_name":"PolyPublie (\u00c9cole Polytechnique de Montr\u00e9al)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45683168","host_organization_name":"Polytechnique Montr\u00e9al","host_organization_lineage":["https://openalex.org/I45683168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Article de revue"},"type":"article","indexed_in":[],"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/A5004954937","display_name":"Adam N. Letchford","orcid":"https://orcid.org/0000-0002-3191-5006"},"institutions":[{"id":"https://openalex.org/I67415387","display_name":"Lancaster University","ror":"https://ror.org/04f2nsd36","country_code":"GB","type":"education","lineage":["https://openalex.org/I67415387"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Adam N. Letchford","raw_affiliation_strings":["Department of Management Science, Lancaster University, Lancaster, England"],"raw_orcid":"https://orcid.org/0000-0002-3191-5006","affiliations":[{"raw_affiliation_string":"Department of Management Science, Lancaster University, Lancaster, England","institution_ids":["https://openalex.org/I67415387"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083656325","display_name":"Andrea Lodi","orcid":"https://orcid.org/0000-0001-9269-633X"},"institutions":[{"id":"https://openalex.org/I9360294","display_name":"University of Bologna","ror":"https://ror.org/01111rn36","country_code":"IT","type":"education","lineage":["https://openalex.org/I9360294"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Andrea Lodi","raw_affiliation_strings":["D.E.I.S., Univ. of Bologna, Bologna, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"D.E.I.S., Univ. of Bologna, Bologna, Italy","institution_ids":["https://openalex.org/I9360294"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5004954937"],"corresponding_institution_ids":["https://openalex.org/I67415387"],"apc_list":null,"apc_paid":null,"fwci":0.2484,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.62168533,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"1","issue":"3","first_page":"209","last_page":"224"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9839000105857849,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9839000105857849,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9811999797821045,"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/T11220","display_name":"Water Systems and Optimization","score":0.9702000021934509,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural 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.8759574890136719},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.7627959251403809},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6854199767112732},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6538364887237549},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6534265279769897},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6523270606994629},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.606540322303772},{"id":"https://openalex.org/keywords/separation","display_name":"Separation (statistics)","score":0.5120678544044495},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4734373092651367},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4213578999042511},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.420674204826355},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35927876830101013},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33099448680877686},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2203262448310852}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8759574890136719},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.7627959251403809},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6854199767112732},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6538364887237549},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6534265279769897},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6523270606994629},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.606540322303772},{"id":"https://openalex.org/C2776061190","wikidata":"https://www.wikidata.org/wiki/Q7451805","display_name":"Separation (statistics)","level":2,"score":0.5120678544044495},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4734373092651367},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4213578999042511},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.420674204826355},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35927876830101013},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33099448680877686},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2203262448310852},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:publications.polymtl.ca:25733","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306401013","display_name":"PolyPublie (\u00c9cole Polytechnique de Montr\u00e9al)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45683168","host_organization_name":"Polytechnique Montr\u00e9al","host_organization_lineage":["https://openalex.org/I45683168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Article de revue"},{"id":"pmh:oai:cris.unibo.it:11585/905283","is_oa":false,"landing_page_url":"https://hdl.handle.net/11585/905283","pdf_url":null,"source":{"id":"https://openalex.org/S4306402579","display_name":"Archivio istituzionale della ricerca (Alma Mater Studiorum Universit\u00e0 di Bologna)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210117483","host_organization_name":"Istituto di Ematologia di Bologna","host_organization_lineage":["https://openalex.org/I4210117483"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},{"id":"mag:1800762347","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/4or/4or1.html#LetchfordL03","pdf_url":null,"source":{"id":"https://openalex.org/S151317046","display_name":"A Quarterly Journal of Operations Research","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"A Quarterly Journal of Operations Research","raw_type":null}],"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/W5720473","https://openalex.org/W86906884","https://openalex.org/W149430354","https://openalex.org/W201222650","https://openalex.org/W325368705","https://openalex.org/W1575006176","https://openalex.org/W1873370420","https://openalex.org/W1885928367","https://openalex.org/W1963547452","https://openalex.org/W1968143987","https://openalex.org/W1977151802","https://openalex.org/W1991179071","https://openalex.org/W2006934540","https://openalex.org/W2017095313","https://openalex.org/W2020898729","https://openalex.org/W2022398556","https://openalex.org/W2029242918","https://openalex.org/W2029403470","https://openalex.org/W2033789385","https://openalex.org/W2042852020","https://openalex.org/W2065901967","https://openalex.org/W2072789827","https://openalex.org/W2090845660","https://openalex.org/W2093454413","https://openalex.org/W2100440346","https://openalex.org/W2123805664","https://openalex.org/W2124452917","https://openalex.org/W2131987076","https://openalex.org/W2138163102","https://openalex.org/W2145340898","https://openalex.org/W2147401337","https://openalex.org/W2167539320","https://openalex.org/W2404248656","https://openalex.org/W2412657279"],"related_works":["https://openalex.org/W2087799931","https://openalex.org/W2029403470","https://openalex.org/W1559207686","https://openalex.org/W612647714","https://openalex.org/W5720473","https://openalex.org/W2152939132","https://openalex.org/W1873370420","https://openalex.org/W194967298","https://openalex.org/W2008936465","https://openalex.org/W294727791","https://openalex.org/W2113442915","https://openalex.org/W2039681930","https://openalex.org/W2168332770","https://openalex.org/W2906725801","https://openalex.org/W1524977140","https://openalex.org/W2329417820","https://openalex.org/W128084865","https://openalex.org/W2736798316","https://openalex.org/W579069454","https://openalex.org/W2076307373"],"abstract_inverted_index":{"Given":[0],"an":[1,7],"integer":[2,8,60],"polyhedron":[3],"PI":[4],"\u2282":[5],"Rn,":[6],"point":[9,15],"x\u0304":[10],"\u2208":[11,17],"PI,":[12,20,37],"and":[13,41,89],"a":[14,30,52],"x*":[16],"Rn":[18],"\\\\":[19],"the":[21,26,56,67,85],"primal":[22,48,57,70],"separation":[23,49,71],"problem":[24,27,50],"is":[25,34],"of":[28,69,76],"finding":[29],"linear":[31],"inequality":[32],"which":[33],"valid":[35],"for":[36,72,78],"violated":[38],"by":[39,45],"x*,":[40],"satisfied":[42],"at":[43],"equality":[44],"x\u0304.":[46],"The":[47],"plays":[51],"key":[53],"role":[54],"in":[55],"approach":[58],"to":[59],"programming.":[61],"In":[62],"this":[63],"paper":[64],"we":[65],"examine":[66],"complexity":[68],"several":[73],"well-known":[74],"classes":[75],"inequalities":[77],"various":[79],"important":[80],"combinatorial":[81],"optimization":[82],"problems,":[83],"including":[84],"knapsack,":[86],"stable":[87],"set":[88],"travelling":[90],"salesman":[91],"problems.":[92],"\u00a9":[93],"2003":[94],"Springer-Verlag":[95],"Berlin/Heidelberg.":[96]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-28T14:05:53.105641","created_date":"2025-10-10T00:00:00"}