{"id":"https://openalex.org/W1508494103","doi":"https://doi.org/10.1007/11757375_15","title":"The Timetable Constrained Distance Minimization Problem","display_name":"The Timetable Constrained Distance Minimization Problem","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1508494103","doi":"https://doi.org/10.1007/11757375_15","mag":"1508494103"},"language":"en","primary_location":{"id":"doi:10.1007/11757375_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11757375_15","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5110177572","display_name":"Rasmus V. Rasmussen","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Rasmus V. Rasmussen","raw_affiliation_strings":["Department of Operations Research, University of Aarhus, Ny Munkegade, Building 1530, 8000, Aarhus C, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Operations Research, University of Aarhus, Ny Munkegade, Building 1530, 8000, Aarhus C, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034256567","display_name":"Michael A. Trick","orcid":"https://orcid.org/0000-0002-9357-4681"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael A. Trick","raw_affiliation_strings":["Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA, 15213, USA"],"affiliations":[{"raw_affiliation_string":"Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA, 15213, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5110177572"],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":4.3853,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.94090771,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"167","last_page":"181"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9998000264167786,"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.9998000264167786,"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.9951000213623047,"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/integer-programming","display_name":"Integer programming","score":0.7425356507301331},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7184286713600159},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.6823254823684692},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6629311442375183},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.6227214932441711},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.49229609966278076},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4901362359523773},{"id":"https://openalex.org/keywords/cutting-stock-problem","display_name":"Cutting stock problem","score":0.4635922312736511},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.461757630109787},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.4617235064506531},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.44358181953430176},{"id":"https://openalex.org/keywords/branch-and-price","display_name":"Branch and price","score":0.43417686223983765},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.4259647727012634},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.30013322830200195},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2396354377269745},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.12659099698066711},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11315059661865234},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.0657677948474884}],"concepts":[{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.7425356507301331},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7184286713600159},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.6823254823684692},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6629311442375183},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6227214932441711},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.49229609966278076},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4901362359523773},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.4635922312736511},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.461757630109787},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.4617235064506531},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.44358181953430176},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.43417686223983765},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.4259647727012634},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.30013322830200195},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2396354377269745},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.12659099698066711},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11315059661865234},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0657677948474884},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/11757375_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11757375_15","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:repository.cmu.edu:tepper-1511","is_oa":false,"landing_page_url":"http://repository.cmu.edu/tepper/510","pdf_url":null,"source":{"id":"https://openalex.org/S4306400668","display_name":"Research Showcase @ Carnegie Mellon University (Carnegie Mellon University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I74973139","host_organization_name":"Carnegie Mellon University","host_organization_lineage":["https://openalex.org/I74973139"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Tepper School of Business","raw_type":"text"},{"id":"pmh:doi:10.1184/r1/6708788","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Journal contribution"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.163.6285","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.163.6285","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://mat.gsia.cmu.edu/trick/aor_final.pdf","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:publications/90fd0f60-5aac-11db-bee9-02004c4f4f50","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/90fd0f60-5aac-11db-bee9-02004c4f4f50","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Rasmussen, R V & Trick, M 2006, 'The Timetable Constrained Distance Minimization Problem', Lecture Notes in Computer Science, vol. 3990, pp. 167-181.","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W96818046","https://openalex.org/W122471005","https://openalex.org/W1550183085","https://openalex.org/W1601564682","https://openalex.org/W1605404869","https://openalex.org/W1971110338","https://openalex.org/W1977762003","https://openalex.org/W1982007983","https://openalex.org/W2022590561","https://openalex.org/W2044566891","https://openalex.org/W2054432392","https://openalex.org/W2078281801","https://openalex.org/W2096399907","https://openalex.org/W2118240569","https://openalex.org/W2156172772","https://openalex.org/W2166264273","https://openalex.org/W2167580124","https://openalex.org/W2303916956","https://openalex.org/W2618566035","https://openalex.org/W2913288853","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2009796757","https://openalex.org/W2084616826","https://openalex.org/W2024753861","https://openalex.org/W1997215277","https://openalex.org/W1971357083","https://openalex.org/W2008600006","https://openalex.org/W1983294952","https://openalex.org/W1968202374","https://openalex.org/W2889871839","https://openalex.org/W2941986668"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}