{"id":"https://openalex.org/W1987888397","doi":"https://doi.org/10.1007/s12532-012-0049-9","title":"Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints","display_name":"Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints","publication_year":2012,"publication_date":"2012-11-07","ids":{"openalex":"https://openalex.org/W1987888397","doi":"https://doi.org/10.1007/s12532-012-0049-9","mag":"1987888397"},"language":"en","primary_location":{"id":"doi:10.1007/s12532-012-0049-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s12532-012-0049-9","pdf_url":null,"source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2949","issn":["1867-2949","1867-2957"],"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":"Mathematical Programming Computation","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/A5111946926","display_name":"I.R. de Farias","orcid":null},"institutions":[{"id":"https://openalex.org/I12315562","display_name":"Texas Tech University","ror":"https://ror.org/0405mnx93","country_code":"US","type":"education","lineage":["https://openalex.org/I12315562"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"I. R. de Farias","raw_affiliation_strings":["Department of Industrial Engineering, Texas Tech University, Lubbock, USA"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Texas Tech University, Lubbock, USA","institution_ids":["https://openalex.org/I12315562"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036843797","display_name":"Ern\u00e9e Kozyreff Filho","orcid":"https://orcid.org/0000-0001-9474-6433"},"institutions":[{"id":"https://openalex.org/I12315562","display_name":"Texas Tech University","ror":"https://ror.org/0405mnx93","country_code":"US","type":"education","lineage":["https://openalex.org/I12315562"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"E. Kozyreff","raw_affiliation_strings":["Department of Industrial Engineering, Texas Tech University, Lubbock, USA"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Texas Tech University, Lubbock, USA","institution_ids":["https://openalex.org/I12315562"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048450998","display_name":"Raghubir Gupta","orcid":null},"institutions":[{"id":"https://openalex.org/I12315562","display_name":"Texas Tech University","ror":"https://ror.org/0405mnx93","country_code":"US","type":"education","lineage":["https://openalex.org/I12315562"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Gupta","raw_affiliation_strings":["Department of Industrial Engineering, Texas Tech University, Lubbock, USA"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Texas Tech University, Lubbock, USA","institution_ids":["https://openalex.org/I12315562"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048063101","display_name":"Ming Zhao","orcid":"https://orcid.org/0000-0002-2664-5267"},"institutions":[{"id":"https://openalex.org/I122754148","display_name":"SAS Institute (United States)","ror":"https://ror.org/01093z329","country_code":"US","type":"company","lineage":["https://openalex.org/I122754148"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. Zhao","raw_affiliation_strings":["SAS, Cary, USA"],"affiliations":[{"raw_affiliation_string":"SAS, Cary, USA","institution_ids":["https://openalex.org/I122754148"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5111946926"],"corresponding_institution_ids":["https://openalex.org/I12315562"],"apc_list":{"value":2390,"currency":"EUR","value_usd":3090},"apc_paid":null,"fwci":2.7222,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.88773299,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"5","issue":"1","first_page":"75","last_page":"112"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9975000023841858,"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.9975000023841858,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9954000115394592,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/piecewise-linear-function","display_name":"Piecewise linear function","score":0.7871716618537903},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.7648588418960571},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.700895369052887},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.6211103200912476},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6163952350616455},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.602676510810852},{"id":"https://openalex.org/keywords/piecewise","display_name":"Piecewise","score":0.5684045553207397},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5479271411895752},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.4422455132007599},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.42428481578826904},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.41965585947036743},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35201579332351685},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3193856477737427},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.2555433511734009},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06552445888519287}],"concepts":[{"id":"https://openalex.org/C17095337","wikidata":"https://www.wikidata.org/wiki/Q2375229","display_name":"Piecewise linear function","level":2,"score":0.7871716618537903},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7648588418960571},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.700895369052887},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.6211103200912476},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6163952350616455},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.602676510810852},{"id":"https://openalex.org/C164660894","wikidata":"https://www.wikidata.org/wiki/Q2037833","display_name":"Piecewise","level":2,"score":0.5684045553207397},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5479271411895752},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.4422455132007599},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.42428481578826904},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.41965585947036743},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35201579332351685},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3193856477737427},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.2555433511734009},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06552445888519287},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s12532-012-0049-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s12532-012-0049-9","pdf_url":null,"source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2949","issn":["1867-2949","1867-2957"],"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":"Mathematical Programming Computation","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"},{"id":"https://openalex.org/F4320337391","display_name":"Division of Civil, Mechanical and Manufacturing Innovation","ror":"https://ror.org/028yd4c30"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1964166152","https://openalex.org/W1972097069","https://openalex.org/W1973479963","https://openalex.org/W1987888397","https://openalex.org/W1994716585","https://openalex.org/W2026994686","https://openalex.org/W2035881018","https://openalex.org/W2040713795","https://openalex.org/W2045373948","https://openalex.org/W2045513909","https://openalex.org/W2052890323","https://openalex.org/W2064073681","https://openalex.org/W2078511023","https://openalex.org/W2086474119","https://openalex.org/W2098425563","https://openalex.org/W2106541949","https://openalex.org/W2116114369","https://openalex.org/W2124339600","https://openalex.org/W2124847400","https://openalex.org/W2126419180","https://openalex.org/W2137477972","https://openalex.org/W2139337114","https://openalex.org/W2156439985","https://openalex.org/W2161116097","https://openalex.org/W2166029977","https://openalex.org/W2167539320","https://openalex.org/W2603389569","https://openalex.org/W2910445340","https://openalex.org/W3029645440","https://openalex.org/W4293775970"],"related_works":["https://openalex.org/W3006617646","https://openalex.org/W2379672298","https://openalex.org/W1979792455","https://openalex.org/W1531708257","https://openalex.org/W2387389269","https://openalex.org/W2046300504","https://openalex.org/W2263874601","https://openalex.org/W2158503982","https://openalex.org/W4223947110","https://openalex.org/W2089185195"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}