{"id":"https://openalex.org/W2022590561","doi":"https://doi.org/10.1016/s0167-6377(03)00025-7","title":"Minimizing breaks by maximizing cuts","display_name":"Minimizing breaks by maximizing cuts","publication_year":2003,"publication_date":"2003-05-12","ids":{"openalex":"https://openalex.org/W2022590561","doi":"https://doi.org/10.1016/s0167-6377(03)00025-7","mag":"2022590561"},"language":"en","primary_location":{"id":"doi:10.1016/s0167-6377(03)00025-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0167-6377(03)00025-7","pdf_url":null,"source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Letters","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/A5042669889","display_name":"Matthias Elf","orcid":null},"institutions":[{"id":"https://openalex.org/I180923762","display_name":"University of Cologne","ror":"https://ror.org/00rcxh774","country_code":"DE","type":"education","lineage":["https://openalex.org/I180923762"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Matthias Elf","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, Cologne, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, Cologne, Germany","institution_ids":["https://openalex.org/I180923762"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016595075","display_name":"Michael J\u00fcnger","orcid":"https://orcid.org/0000-0002-7574-6646"},"institutions":[{"id":"https://openalex.org/I180923762","display_name":"University of Cologne","ror":"https://ror.org/00rcxh774","country_code":"DE","type":"education","lineage":["https://openalex.org/I180923762"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Michael J\u00fcnger","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, Cologne, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, Cologne, Germany","institution_ids":["https://openalex.org/I180923762"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103158920","display_name":"Giovanni Rinaldi","orcid":"https://orcid.org/0000-0003-0148-2470"},"institutions":[{"id":"https://openalex.org/I4210162062","display_name":"Istituto di Analisi dei Sistemi ed Informatica Antonio Ruberti","ror":"https://ror.org/054ye0e45","country_code":"IT","type":"facility","lineage":["https://openalex.org/I4210155236","https://openalex.org/I4210162062"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Giovanni Rinaldi","raw_affiliation_strings":["Istituto di Analisi dei Sistemi ed Informatica del CNR, Rome, Italy","Istituto di Analisi dei Sistemi ed Informatica del CNR, Rome, Italy#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Istituto di Analisi dei Sistemi ed Informatica del CNR, Rome, Italy","institution_ids":["https://openalex.org/I4210162062"]},{"raw_affiliation_string":"Istituto di Analisi dei Sistemi ed Informatica del CNR, Rome, Italy#TAB#","institution_ids":["https://openalex.org/I4210162062"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5042669889"],"corresponding_institution_ids":["https://openalex.org/I180923762"],"apc_list":{"value":2760,"currency":"USD","value_usd":2760},"apc_paid":null,"fwci":5.6934,"has_fulltext":false,"cited_by_count":59,"citation_normalized_percentile":{"value":0.95753099,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"31","issue":"5","first_page":"343","last_page":"349"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9984999895095825,"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.9984999895095825,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9943000078201294,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.967199981212616,"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.7347772121429443},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.6495060920715332},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6456812620162964},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5346912741661072},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.5330765247344971},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5203697085380554},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.4827634394168854},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4770169258117676},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4542475640773773},{"id":"https://openalex.org/keywords/cut","display_name":"Cut","score":0.4261898398399353},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3991211950778961},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3655296564102173},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35226815938949585},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2563028335571289},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20659971237182617},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.13528171181678772}],"concepts":[{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.7347772121429443},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.6495060920715332},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6456812620162964},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5346912741661072},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.5330765247344971},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5203697085380554},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.4827634394168854},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4770169258117676},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4542475640773773},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.4261898398399353},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3991211950778961},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3655296564102173},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35226815938949585},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2563028335571289},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20659971237182617},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.13528171181678772},{"id":"https://openalex.org/C124504099","wikidata":"https://www.wikidata.org/wiki/Q56933","display_name":"Image segmentation","level":3,"score":0.0},{"id":"https://openalex.org/C89600930","wikidata":"https://www.wikidata.org/wiki/Q1423946","display_name":"Segmentation","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1016/s0167-6377(03)00025-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0167-6377(03)00025-7","pdf_url":null,"source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Letters","raw_type":"journal-article"},{"id":"pmh:oai:USBKOELN.ub.uni-koeln.de:54854","is_oa":false,"landing_page_url":"https://orcid.org/0000-0003-0148-2470>","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"pmh:oai:e-archive.informatik.uni-koeln.de:409","is_oa":false,"landing_page_url":"http://e-archive.informatik.uni-koeln.de/409/1/zaik2001-409.ps","pdf_url":null,"source":{"id":"https://openalex.org/S4306401304","display_name":"Computer Science Publication Server (University of Cologne)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I180923762","host_organization_name":"University of Cologne","host_organization_lineage":["https://openalex.org/I180923762"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.28.753","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.753","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.zpr.uni-koeln.de/pub/paper/zpr2001-409.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W2012605254","https://openalex.org/W2038195012","https://openalex.org/W2038997204","https://openalex.org/W2060660073","https://openalex.org/W2065007370","https://openalex.org/W2156172772","https://openalex.org/W2159739530","https://openalex.org/W2166264273","https://openalex.org/W2303916956","https://openalex.org/W2578638655","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2990947859","https://openalex.org/W2188917685","https://openalex.org/W2071982496","https://openalex.org/W1508494103","https://openalex.org/W2096788301","https://openalex.org/W2067690322","https://openalex.org/W2165765741","https://openalex.org/W2095219966","https://openalex.org/W1642635841","https://openalex.org/W2022590561"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}