{"id":"https://openalex.org/W2132514193","doi":"https://doi.org/10.1007/s10107-004-0512-0","title":"On the generation of circuits and minimal forbidden sets","display_name":"On the generation of circuits and minimal forbidden sets","publication_year":2004,"publication_date":"2004-04-27","ids":{"openalex":"https://openalex.org/W2132514193","doi":"https://doi.org/10.1007/s10107-004-0512-0","mag":"2132514193"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-004-0512-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-004-0512-0","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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","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/A5056687879","display_name":"Frederik Stork","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Frederik Stork","raw_affiliation_strings":["ILOG Deutschland GmbH, Ober-Eschbacher Stra\u00dfe 109, D-61352, Bad Homburg, Germany","ILOG Deutschland GmbH, Bad Homburg, Germany D-61352#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ILOG Deutschland GmbH, Ober-Eschbacher Stra\u00dfe 109, D-61352, Bad Homburg, Germany","institution_ids":[]},{"raw_affiliation_string":"ILOG Deutschland GmbH, Bad Homburg, Germany D-61352#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052226987","display_name":"Marc Uetz","orcid":"https://orcid.org/0000-0003-4223-2435"},"institutions":[{"id":"https://openalex.org/I34352273","display_name":"Maastricht University","ror":"https://ror.org/02jz4aj89","country_code":"NL","type":"education","lineage":["https://openalex.org/I34352273"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Marc Uetz","raw_affiliation_strings":["Universiteit Maastricht, Faculty of Economics and Business Administration, Quantitative Economics, P.O. Box 616, NL-6200, MD, Maastricht, The Netherlands","Universiteit Maastricht, Faculty of Economics and Business Administration, Quantitative Economics, Maastricht, The Netherlands NL-6200#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universiteit Maastricht, Faculty of Economics and Business Administration, Quantitative Economics, P.O. Box 616, NL-6200, MD, Maastricht, The Netherlands","institution_ids":["https://openalex.org/I34352273"]},{"raw_affiliation_string":"Universiteit Maastricht, Faculty of Economics and Business Administration, Quantitative Economics, Maastricht, The Netherlands NL-6200#TAB#","institution_ids":["https://openalex.org/I34352273"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5052226987"],"corresponding_institution_ids":["https://openalex.org/I34352273"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":3.9648,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.92982906,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"102","issue":"1","first_page":"185","last_page":"203"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9994000196456909,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9994000196456909,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9980000257492065,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9972000122070312,"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/backtracking","display_name":"Backtracking","score":0.7224692702293396},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6482428312301636},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5347933173179626},{"id":"https://openalex.org/keywords/independence","display_name":"Independence (probability theory)","score":0.49872565269470215},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4682641625404358},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.4453860819339752},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4187038838863373},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3717826008796692},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33826881647109985}],"concepts":[{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.7224692702293396},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6482428312301636},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5347933173179626},{"id":"https://openalex.org/C35651441","wikidata":"https://www.wikidata.org/wiki/Q625303","display_name":"Independence (probability theory)","level":2,"score":0.49872565269470215},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4682641625404358},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.4453860819339752},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4187038838863373},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3717826008796692},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33826881647109985},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/s10107-004-0512-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-004-0512-0","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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","raw_type":"journal-article"},{"id":"pmh:oai:cris.maastrichtuniversity.nl:openaire_cris_publications/d736d1a9-664a-40cf-95ec-545f87eb8d23","is_oa":false,"landing_page_url":"https://cris.maastrichtuniversity.nl/en/publications/d736d1a9-664a-40cf-95ec-545f87eb8d23","pdf_url":null,"source":{"id":"https://openalex.org/S4306402616","display_name":"Research Publications (Maastricht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I34352273","host_organization_name":"Maastricht University","host_organization_lineage":["https://openalex.org/I34352273"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Stork, F & Uetz, M J 2005, 'On the Generation of Circuits and Minimal Forbidden Sets', Mathematical Programming, vol. 102, no. 1, pp. 185-203. https://doi.org/10.1007/s10107-004-0512-0","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:ris.utwente.nl:openaire_cris_publications/101571c5-8bcc-4c8d-a983-c6a0c5f9fac4","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/101571c5-8bcc-4c8d-a983-c6a0c5f9fac4","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Stork, F & Uetz, M 2005, 'On the generation of circuits and minimal forbidden sets', Mathematical programming, vol. 102, no. 1, pp. 185-203. https://doi.org/10.1007/s10107-004-0512-0","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.109.56","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.109.56","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.personeel.unimaas.nl/m.uetz/Preprints/forbsets_31.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.506.352","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.506.352","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arno.unimaas.nl/show.cgi?fid=2593","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.5699999928474426}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W178659373","https://openalex.org/W366472614","https://openalex.org/W1579049696","https://openalex.org/W1967618612","https://openalex.org/W1973131489","https://openalex.org/W1998076865","https://openalex.org/W1998987607","https://openalex.org/W2006912660","https://openalex.org/W2007940874","https://openalex.org/W2011039300","https://openalex.org/W2021200478","https://openalex.org/W2031497472","https://openalex.org/W2036112575","https://openalex.org/W2040296085","https://openalex.org/W2047899424","https://openalex.org/W2071532574","https://openalex.org/W2076129982","https://openalex.org/W2076358787","https://openalex.org/W2093776691","https://openalex.org/W2099782395","https://openalex.org/W2115826669","https://openalex.org/W2169586176","https://openalex.org/W2314893179","https://openalex.org/W2325174870","https://openalex.org/W2476096155","https://openalex.org/W2981347162"],"related_works":["https://openalex.org/W2760348722","https://openalex.org/W2783885583","https://openalex.org/W2120095724","https://openalex.org/W2368326437","https://openalex.org/W1631221657","https://openalex.org/W4247094814","https://openalex.org/W2357479099","https://openalex.org/W2364309619","https://openalex.org/W1525406239","https://openalex.org/W160089862"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":3}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}