{"id":"https://openalex.org/W2082030917","doi":"https://doi.org/10.1287/ijoc.13.3.210.12632","title":"Fast Heuristics for the Maximum Feasible Subsystem Problem","display_name":"Fast Heuristics for the Maximum Feasible Subsystem Problem","publication_year":2001,"publication_date":"2001-08-01","ids":{"openalex":"https://openalex.org/W2082030917","doi":"https://doi.org/10.1287/ijoc.13.3.210.12632","mag":"2082030917"},"language":"en","primary_location":{"id":"doi:10.1287/ijoc.13.3.210.12632","is_oa":false,"landing_page_url":"https://doi.org/10.1287/ijoc.13.3.210.12632","pdf_url":null,"source":{"id":"https://openalex.org/S165318533","display_name":"INFORMS journal on computing","issn_l":"1091-9856","issn":["1091-9856","1526-5528"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"INFORMS Journal on Computing","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/A5052753072","display_name":"John W. Chinneck","orcid":"https://orcid.org/0000-0002-8744-4653"},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"John W. Chinneck","raw_affiliation_strings":["Systems and Computer Engineering, Carleton University, 1125 Colonel By Drive, Ottawa, Ontario K1S 5B6, Canada"],"affiliations":[{"raw_affiliation_string":"Systems and Computer Engineering, Carleton University, 1125 Colonel By Drive, Ottawa, Ontario K1S 5B6, Canada","institution_ids":["https://openalex.org/I67031392"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5052753072"],"corresponding_institution_ids":["https://openalex.org/I67031392"],"apc_list":null,"apc_paid":null,"fwci":5.0223,"has_fulltext":false,"cited_by_count":86,"citation_normalized_percentile":{"value":0.95295068,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"13","issue":"3","first_page":"210","last_page":"223"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9976000189781189,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9976000189781189,"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"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9975000023841858,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9973999857902527,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.8978437185287476},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7291260957717896},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6964956521987915},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5695438385009766},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5607103109359741},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.45415276288986206},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33403486013412476},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3221716284751892},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.05019122362136841}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8978437185287476},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7291260957717896},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6964956521987915},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5695438385009766},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5607103109359741},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.45415276288986206},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33403486013412476},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3221716284751892},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.05019122362136841},{"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.1287/ijoc.13.3.210.12632","is_oa":false,"landing_page_url":"https://doi.org/10.1287/ijoc.13.3.210.12632","pdf_url":null,"source":{"id":"https://openalex.org/S165318533","display_name":"INFORMS journal on computing","issn_l":"1091-9856","issn":["1091-9856","1526-5528"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"INFORMS Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.67.1703","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.67.1703","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.sce.carleton.ca/faculty/chinneck/docs/MaxFeasible.pdf","raw_type":"text"},{"id":"pmh:oai:RePEc:inm:orijoc:v:13:y:2001:i:3:p:210-223","is_oa":false,"landing_page_url":"http://doi.org/10.1287/ijoc.13.3.210.12632","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":"","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W42214504","https://openalex.org/W1515620500","https://openalex.org/W1597806057","https://openalex.org/W1605094808","https://openalex.org/W1971044761","https://openalex.org/W1989709869","https://openalex.org/W1993943649","https://openalex.org/W1994211385","https://openalex.org/W2004709509","https://openalex.org/W2010440612","https://openalex.org/W2024625102","https://openalex.org/W2049083558","https://openalex.org/W2052916539","https://openalex.org/W2076451537","https://openalex.org/W2084812512","https://openalex.org/W2113369973","https://openalex.org/W2147524202","https://openalex.org/W2160089068","https://openalex.org/W2611147814","https://openalex.org/W2913602408","https://openalex.org/W2951539267","https://openalex.org/W2982720039","https://openalex.org/W4240373840"],"related_works":["https://openalex.org/W2280422768","https://openalex.org/W3143197806","https://openalex.org/W4252555497","https://openalex.org/W2002177687","https://openalex.org/W3121175838","https://openalex.org/W3016293053","https://openalex.org/W2401723157","https://openalex.org/W2947386998","https://openalex.org/W3013412531","https://openalex.org/W2922502643"],"abstract_inverted_index":{"Given":[0],"an":[1],"infeasible":[2],"set":[3],"of":[4],"linear":[5],"constraints,":[6],"finding":[7],"the":[8,16,40,50],"maximum":[9,17,41],"cardinality":[10],"feasible":[11,18,42],"subsystem":[12,19,43],"is":[13,23],"known":[14,24],"as":[15],"problem.":[20],"This":[21,33],"problem":[22,44],"to":[25],"be":[26],"NP-hard,":[27],"but":[28,52],"has":[29],"many":[30],"practical":[31],"applications.":[32],"paper":[34],"presents":[35],"improved":[36],"heuristics":[37],"for":[38],"solving":[39],"that":[45],"are":[46],"significantly":[47],"faster":[48],"than":[49],"original,":[51],"still":[53],"highly":[54],"accurate.":[55]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}