{"id":"https://openalex.org/W2010360426","doi":"https://doi.org/10.1007/s10479-010-0828-5","title":"A branch-and-cut procedure for\u00a0the\u00a0Udine Course Timetabling problem","display_name":"A branch-and-cut procedure for\u00a0the\u00a0Udine Course Timetabling problem","publication_year":2011,"publication_date":"2011-02-01","ids":{"openalex":"https://openalex.org/W2010360426","doi":"https://doi.org/10.1007/s10479-010-0828-5","mag":"2010360426"},"language":"en","primary_location":{"id":"doi:10.1007/s10479-010-0828-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10479-010-0828-5","pdf_url":null,"source":{"id":"https://openalex.org/S57667410","display_name":"Annals of Operations Research","issn_l":"0254-5330","issn":["0254-5330","1572-9338"],"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":"Annals of Operations Research","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/A5004567468","display_name":"Edmund Burke","orcid":"https://orcid.org/0000-0003-0712-4762"},"institutions":[{"id":"https://openalex.org/I142263535","display_name":"University of Nottingham","ror":"https://ror.org/01ee9ar58","country_code":"GB","type":"education","lineage":["https://openalex.org/I142263535"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Edmund K. Burke","raw_affiliation_strings":["Automated Scheduling, Optimisation and Planning Group, School of Computer Science, The University of Nottingham, Nottingham, NG8 1BB, UK","Automated Scheduling, Optimisation and Planning Group, School of Computer Science, The University of Nottingham, Nottingham, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Automated Scheduling, Optimisation and Planning Group, School of Computer Science, The University of Nottingham, Nottingham, NG8 1BB, UK","institution_ids":["https://openalex.org/I142263535"]},{"raw_affiliation_string":"Automated Scheduling, Optimisation and Planning Group, School of Computer Science, The University of Nottingham, Nottingham, UK","institution_ids":["https://openalex.org/I142263535"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003656133","display_name":"Jakub Mare\u010dek","orcid":"https://orcid.org/0000-0003-0839-0691"},"institutions":[{"id":"https://openalex.org/I142263535","display_name":"University of Nottingham","ror":"https://ror.org/01ee9ar58","country_code":"GB","type":"education","lineage":["https://openalex.org/I142263535"]},{"id":"https://openalex.org/I21449261","display_name":"Masaryk University","ror":"https://ror.org/02j46qs45","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21449261"]}],"countries":["CZ","GB"],"is_corresponding":true,"raw_author_name":"Jakub Mare\u010dek","raw_affiliation_strings":["Automated Scheduling, Optimisation and Planning Group, School of Computer Science, The University of Nottingham, Nottingham, NG8 1BB, UK","Faculty of Informatics, Masaryk University, Botanick\u00e1 68a, Brno, 602 00, The Czech Republic","The University of Nottingham","Masaryk University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Automated Scheduling, Optimisation and Planning Group, School of Computer Science, The University of Nottingham, Nottingham, NG8 1BB, UK","institution_ids":["https://openalex.org/I142263535"]},{"raw_affiliation_string":"Faculty of Informatics, Masaryk University, Botanick\u00e1 68a, Brno, 602 00, The Czech Republic","institution_ids":["https://openalex.org/I21449261"]},{"raw_affiliation_string":"The University of Nottingham","institution_ids":["https://openalex.org/I142263535"]},{"raw_affiliation_string":"Masaryk University","institution_ids":["https://openalex.org/I21449261"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049853918","display_name":"Andrew J. Parkes","orcid":"https://orcid.org/0000-0002-8847-1856"},"institutions":[{"id":"https://openalex.org/I142263535","display_name":"University of Nottingham","ror":"https://ror.org/01ee9ar58","country_code":"GB","type":"education","lineage":["https://openalex.org/I142263535"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Andrew J. Parkes","raw_affiliation_strings":["Automated Scheduling, Optimisation and Planning Group, School of Computer Science, The University of Nottingham, Nottingham, NG8 1BB, UK","Automated Scheduling, Optimisation and Planning Group, School of Computer Science, The University of Nottingham, Nottingham, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Automated Scheduling, Optimisation and Planning Group, School of Computer Science, The University of Nottingham, Nottingham, NG8 1BB, UK","institution_ids":["https://openalex.org/I142263535"]},{"raw_affiliation_string":"Automated Scheduling, Optimisation and Planning Group, School of Computer Science, The University of Nottingham, Nottingham, UK","institution_ids":["https://openalex.org/I142263535"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063434417","display_name":"Hana Rudov\u00e1","orcid":"https://orcid.org/0000-0002-6410-4250"},"institutions":[{"id":"https://openalex.org/I21449261","display_name":"Masaryk University","ror":"https://ror.org/02j46qs45","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21449261"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Hana Rudov\u00e1","raw_affiliation_strings":["Faculty of Informatics, Masaryk University, Botanick\u00e1 68a, Brno, 602 00, The Czech Republic","Faculty of Informatics, Masaryk University, Brno, The Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Informatics, Masaryk University, Botanick\u00e1 68a, Brno, 602 00, The Czech Republic","institution_ids":["https://openalex.org/I21449261"]},{"raw_affiliation_string":"Faculty of Informatics, Masaryk University, Brno, The Czech Republic","institution_ids":["https://openalex.org/I21449261"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5003656133"],"corresponding_institution_ids":["https://openalex.org/I142263535","https://openalex.org/I21449261"],"apc_list":{"value":2990,"currency":"USD","value_usd":2990},"apc_paid":null,"fwci":5.6096,"has_fulltext":false,"cited_by_count":58,"citation_normalized_percentile":{"value":0.95805067,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"194","issue":"1","first_page":"71","last_page":"87"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9717000126838684,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9538999795913696,"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.718729555606842},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.7144443988800049},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.591118335723877},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.5610457062721252},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.55569988489151},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.52791428565979},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5271002054214478},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5265013575553894},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4277377426624298},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4265854060649872},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4197993874549866},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3252703845500946},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.290723979473114},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22708982229232788},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.11711853742599487}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.718729555606842},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7144443988800049},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.591118335723877},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.5610457062721252},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.55569988489151},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.52791428565979},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5271002054214478},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5265013575553894},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4277377426624298},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4265854060649872},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4197993874549866},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3252703845500946},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.290723979473114},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22708982229232788},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.11711853742599487},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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":7,"locations":[{"id":"doi:10.1007/s10479-010-0828-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10479-010-0828-5","pdf_url":null,"source":{"id":"https://openalex.org/S57667410","display_name":"Annals of Operations Research","issn_l":"0254-5330","issn":["0254-5330","1572-9338"],"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":"Annals of Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.158.6830","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.6830","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://w1.cirrelt.ca/~patat2008/PATAT_7_PROCEEDINGS/Papers/Marecek-WC1d.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.159.6960","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.159.6960","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.nott.ac.uk/~jxm/timetabling/patat2008-paper.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.216.215","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.216.215","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.nott.ac.uk/%7Ejxm/timetabling/patat2008-paper.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.219.7153","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.219.7153","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.nott.ac.uk/~ekb/Publications/patat-08.pdf","raw_type":"text"},{"id":"pmh:oai:RePEc:spr:annopr:v:194:y:2012:i:1:p:71-87:10.1007/s10479-010-0828-5","is_oa":false,"landing_page_url":"http://hdl.handle.net/10.1007/s10479-010-0828-5","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":null,"raw_type":"article"},{"id":"pmh:oai:dspace.stir.ac.uk:1893/15714","is_oa":false,"landing_page_url":"http://hdl.handle.net/1893/15714","pdf_url":null,"source":{"id":"https://openalex.org/S4306400268","display_name":"Stirling Online Research Repository (University of Stirling)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I12093191","host_organization_name":"University of Stirling","host_organization_lineage":["https://openalex.org/I12093191"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":67,"referenced_works":["https://openalex.org/W62280645","https://openalex.org/W181266127","https://openalex.org/W592806941","https://openalex.org/W1488119866","https://openalex.org/W1501066815","https://openalex.org/W1501505525","https://openalex.org/W1534308429","https://openalex.org/W1546012270","https://openalex.org/W1556448886","https://openalex.org/W1570131048","https://openalex.org/W1577845686","https://openalex.org/W1601081952","https://openalex.org/W1966942146","https://openalex.org/W1970686950","https://openalex.org/W1977545325","https://openalex.org/W1979743058","https://openalex.org/W1987796198","https://openalex.org/W1990932294","https://openalex.org/W1993342066","https://openalex.org/W1998069267","https://openalex.org/W2000686525","https://openalex.org/W2006743657","https://openalex.org/W2010360426","https://openalex.org/W2020250274","https://openalex.org/W2025270047","https://openalex.org/W2028379670","https://openalex.org/W2028480548","https://openalex.org/W2045837509","https://openalex.org/W2048483530","https://openalex.org/W2052435807","https://openalex.org/W2055658410","https://openalex.org/W2060916759","https://openalex.org/W2062660149","https://openalex.org/W2070313595","https://openalex.org/W2077104763","https://openalex.org/W2081192873","https://openalex.org/W2081953250","https://openalex.org/W2087215158","https://openalex.org/W2093118045","https://openalex.org/W2094224826","https://openalex.org/W2096645078","https://openalex.org/W2099942580","https://openalex.org/W2102199027","https://openalex.org/W2102642246","https://openalex.org/W2108301529","https://openalex.org/W2108375259","https://openalex.org/W2111590511","https://openalex.org/W2127670720","https://openalex.org/W2135942405","https://openalex.org/W2145243417","https://openalex.org/W2156897434","https://openalex.org/W2160429376","https://openalex.org/W2309179828","https://openalex.org/W2327315803","https://openalex.org/W2394599163","https://openalex.org/W2484500153","https://openalex.org/W2561675875","https://openalex.org/W2610183793","https://openalex.org/W2739148627","https://openalex.org/W2750627547","https://openalex.org/W3164335680","https://openalex.org/W4285719527","https://openalex.org/W4401338609","https://openalex.org/W6741471169","https://openalex.org/W6743644516","https://openalex.org/W6828273540","https://openalex.org/W6992951189"],"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/W1925942709","https://openalex.org/W2941986668","https://openalex.org/W3116484972","https://openalex.org/W4232431455"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-25T09:21:30.201066","created_date":"2025-10-10T00:00:00"}