{"id":"https://openalex.org/W2053834570","doi":"https://doi.org/10.1007/s10878-011-9406-2","title":"A branch-and-bound algorithm for the minimum cut linear arrangement problem","display_name":"A branch-and-bound algorithm for the minimum cut linear arrangement problem","publication_year":2011,"publication_date":"2011-06-18","ids":{"openalex":"https://openalex.org/W2053834570","doi":"https://doi.org/10.1007/s10878-011-9406-2","mag":"2053834570"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-011-9406-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-011-9406-2","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"Journal of Combinatorial Optimization","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/A5060672971","display_name":"Gintaras Palubeckis","orcid":"https://orcid.org/0000-0002-4991-1505"},"institutions":[{"id":"https://openalex.org/I172574986","display_name":"Kaunas University of Technology","ror":"https://ror.org/01me6gb93","country_code":"LT","type":"education","lineage":["https://openalex.org/I172574986"]}],"countries":["LT"],"is_corresponding":true,"raw_author_name":"Gintaras Palubeckis","raw_affiliation_strings":["Multimedia Engineering Department, Kaunas University of Technology, Studentu 50-408, 51368, Kaunas, Lithuania","Multimedia Engineering Department, Kaunas University of Technology, Kaunas, Lithuania 51368"],"affiliations":[{"raw_affiliation_string":"Multimedia Engineering Department, Kaunas University of Technology, Studentu 50-408, 51368, Kaunas, Lithuania","institution_ids":["https://openalex.org/I172574986"]},{"raw_affiliation_string":"Multimedia Engineering Department, Kaunas University of Technology, Kaunas, Lithuania 51368","institution_ids":["https://openalex.org/I172574986"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048427608","display_name":"Dalius Rubliauskas","orcid":null},"institutions":[{"id":"https://openalex.org/I172574986","display_name":"Kaunas University of Technology","ror":"https://ror.org/01me6gb93","country_code":"LT","type":"education","lineage":["https://openalex.org/I172574986"]}],"countries":["LT"],"is_corresponding":false,"raw_author_name":"Dalius Rubliauskas","raw_affiliation_strings":["Multimedia Engineering Department, Kaunas University of Technology, Studentu 50-408, 51368, Kaunas, Lithuania","Multimedia Engineering Department, Kaunas University of Technology, Kaunas, Lithuania 51368"],"affiliations":[{"raw_affiliation_string":"Multimedia Engineering Department, Kaunas University of Technology, Studentu 50-408, 51368, Kaunas, Lithuania","institution_ids":["https://openalex.org/I172574986"]},{"raw_affiliation_string":"Multimedia Engineering Department, Kaunas University of Technology, Kaunas, Lithuania 51368","institution_ids":["https://openalex.org/I172574986"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5060672971"],"corresponding_institution_ids":["https://openalex.org/I172574986"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.8081,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.7597056,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"24","issue":"4","first_page":"540","last_page":"563"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T12176","display_name":"Optimization and Packing Problems","score":0.9986000061035156,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9970999956130981,"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/branch-and-bound","display_name":"Branch and bound","score":0.7628544569015503},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6941437721252441},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.6538777351379395},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5556827187538147},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.529519259929657},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.43706828355789185},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.41671133041381836},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3468562364578247},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3403487801551819}],"concepts":[{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.7628544569015503},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6941437721252441},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.6538777351379395},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5556827187538147},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.529519259929657},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.43706828355789185},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.41671133041381836},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3468562364578247},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3403487801551819}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10878-011-9406-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-011-9406-2","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:jcomop:v:24:y:2012:i:4:d:10.1007_s10878-011-9406-2","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-011-9406-2","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W101322347","https://openalex.org/W104621033","https://openalex.org/W1481175673","https://openalex.org/W1518606313","https://openalex.org/W1567030152","https://openalex.org/W1587936952","https://openalex.org/W1713435687","https://openalex.org/W1967902949","https://openalex.org/W1968062615","https://openalex.org/W1980008391","https://openalex.org/W1995596152","https://openalex.org/W2017724268","https://openalex.org/W2030033386","https://openalex.org/W2049825837","https://openalex.org/W2060955779","https://openalex.org/W2063054346","https://openalex.org/W2065528988","https://openalex.org/W2079966248","https://openalex.org/W2083103669","https://openalex.org/W2101400962","https://openalex.org/W2104670598","https://openalex.org/W2135481845","https://openalex.org/W2150683370","https://openalex.org/W2154286377","https://openalex.org/W2160467939","https://openalex.org/W2162557634","https://openalex.org/W3031999497","https://openalex.org/W3105049882","https://openalex.org/W4246598646"],"related_works":["https://openalex.org/W2084616826","https://openalex.org/W1983294952","https://openalex.org/W2009796757","https://openalex.org/W2568448495","https://openalex.org/W2008600006","https://openalex.org/W1972259521","https://openalex.org/W4249573192","https://openalex.org/W2941986668","https://openalex.org/W2089185195","https://openalex.org/W4255223395"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}