{"id":"https://openalex.org/W1971697593","doi":"https://doi.org/10.1137/050645828","title":"Branch-and-Cut for the Maximum Feasible Subsystem Problem","display_name":"Branch-and-Cut for the Maximum Feasible Subsystem Problem","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W1971697593","doi":"https://doi.org/10.1137/050645828","mag":"1971697593"},"language":"en","primary_location":{"id":"doi:10.1137/050645828","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050645828","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","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/A5033982876","display_name":"Marc E. Pfetsch","orcid":"https://orcid.org/0000-0002-0947-7193"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Marc E. Pfetsch","raw_affiliation_strings":["pfetsch@zib.de#TAB#"],"affiliations":[{"raw_affiliation_string":"pfetsch@zib.de#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5033982876"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.6806,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":{"value":0.95598517,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"19","issue":"1","first_page":"21","last_page":"38"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9976000189781189,"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"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9976000189781189,"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/T10780","display_name":"Reliability and Maintenance Optimization","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"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.9922999739646912,"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/mathematics","display_name":"Mathematics","score":0.8053100109100342},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7612664699554443},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.6343550682067871},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6318854093551636},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5189166069030762},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5182918906211853},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.5113319754600525},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.47984787821769714},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.4759373664855957},{"id":"https://openalex.org/keywords/row","display_name":"Row","score":0.4207330048084259},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4141530990600586},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.41314995288848877},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4095233380794525},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.28361839056015015},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15366685390472412}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8053100109100342},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7612664699554443},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.6343550682067871},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6318854093551636},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5189166069030762},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5182918906211853},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.5113319754600525},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.47984787821769714},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.4759373664855957},{"id":"https://openalex.org/C135598885","wikidata":"https://www.wikidata.org/wiki/Q1366302","display_name":"Row","level":2,"score":0.4207330048084259},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4141530990600586},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.41314995288848877},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4095233380794525},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.28361839056015015},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15366685390472412},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/050645828","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050645828","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.527.1608","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.527.1608","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://webserv.zib.de/Publications/Reports/ZR-05-46.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.531.462","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.531.462","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://opus4.kobv.de/opus4-zib/frontdoor/deliver/index/docId/879/file/ZR-05-46.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.5600000023841858}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":50,"referenced_works":["https://openalex.org/W87395324","https://openalex.org/W130282726","https://openalex.org/W149430354","https://openalex.org/W588032555","https://openalex.org/W1537526063","https://openalex.org/W1550109497","https://openalex.org/W1597806057","https://openalex.org/W1963547452","https://openalex.org/W1968143987","https://openalex.org/W1971044761","https://openalex.org/W1974450603","https://openalex.org/W1987163060","https://openalex.org/W1988626494","https://openalex.org/W1993943649","https://openalex.org/W1994211385","https://openalex.org/W2004802557","https://openalex.org/W2007691909","https://openalex.org/W2023761583","https://openalex.org/W2029242918","https://openalex.org/W2030996579","https://openalex.org/W2034852683","https://openalex.org/W2045168006","https://openalex.org/W2049083558","https://openalex.org/W2053113791","https://openalex.org/W2055341608","https://openalex.org/W2058094600","https://openalex.org/W2060514920","https://openalex.org/W2063434077","https://openalex.org/W2075779886","https://openalex.org/W2076451537","https://openalex.org/W2082030917","https://openalex.org/W2084812512","https://openalex.org/W2087956027","https://openalex.org/W2090845660","https://openalex.org/W2100440346","https://openalex.org/W2109742527","https://openalex.org/W2113369973","https://openalex.org/W2113715011","https://openalex.org/W2143563095","https://openalex.org/W2148159997","https://openalex.org/W2157553786","https://openalex.org/W2160089068","https://openalex.org/W2163013568","https://openalex.org/W2321466613","https://openalex.org/W2329579984","https://openalex.org/W2336602837","https://openalex.org/W2577865170","https://openalex.org/W2593139942","https://openalex.org/W3124498598","https://openalex.org/W4240373840"],"related_works":["https://openalex.org/W2769220156","https://openalex.org/W3006617646","https://openalex.org/W2009796757","https://openalex.org/W4210880521","https://openalex.org/W2046300504","https://openalex.org/W2734758384","https://openalex.org/W2263874601","https://openalex.org/W4223947110","https://openalex.org/W1968202374","https://openalex.org/W4313384610"],"abstract_inverted_index":{"This":[0],"paper":[1,146],"presents":[2],"a":[3,14,21,54,81,132,137,153,159],"branch-and-cut":[4,82],"algorithm":[5,83],"for":[6,84,103],"the":[7,47,77,85,104,114],"NP-hard":[8,106],"maximum":[9,86],"feasible":[10,22,87],"subsystem":[11,23,88],"problem:":[12],"For":[13],"given":[15],"infeasible":[16,66,97],"linear":[17],"inequality":[18],"system,":[19],"determine":[20],"containing":[24],"as":[25,28,38,41,53,117],"many":[26],"inequalities":[27,40],"possible.":[29],"The":[30,58,141],"complementary":[31],"problem,":[32],"where":[33],"one":[34],"has":[35],"to":[36,45,64,93],"remove":[37],"few":[39],"possible":[42],"in":[43,158],"order":[44],"make":[46],"system":[48],"feasible,":[49],"can":[50,69],"be":[51,70],"formulated":[52],"set":[55,118],"covering":[56,119],"problem.":[57],"rows":[59],"of":[60,80,121,134,144,155,161],"this":[61,145],"formulation":[62],"correspond":[63],"irreducible":[65],"subsystems,":[67],"which":[68],"exponentially":[71],"many.":[72],"It":[73],"turns":[74],"out":[75],"that":[76],"main":[78,142],"issue":[79],"problem":[89,108],"(Max":[90],"FS)":[91],"is":[92,147],"efficiently":[94],"find":[95],"such":[96,116],"subsystems.":[98],"We":[99],"present":[100],"three":[101],"heuristics":[102],"corresponding":[105],"separation":[107],"and":[109,123,127,136],"discuss":[110],"cutting":[111],"planes":[112],"from":[113],"literature,":[115],"cuts":[120],"Balas":[122],"Ng,":[124],"Gomory":[125],"cuts,":[126],"$\\{0,\\frac{1}{2}\\}$-cuts.":[128],"Furthermore,":[129],"we":[130],"compare":[131],"heuristic":[133],"Chinneck":[135],"simple":[138],"greedy":[139],"algorithm.":[140],"contribution":[143],"an":[148],"extensive":[149],"computational":[150],"study":[151],"on":[152],"variety":[154],"instances":[156],"arising":[157],"number":[160],"applications.":[162]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}