{"id":"https://openalex.org/W2406843818","doi":"https://doi.org/10.5220/0004827800570062","title":"A New Mathematical Model For the Minimum Linear Arrangement Problem","display_name":"A New Mathematical Model For the Minimum Linear Arrangement Problem","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2406843818","doi":"https://doi.org/10.5220/0004827800570062","mag":"2406843818"},"language":"en","primary_location":{"id":"doi:10.5220/0004827800570062","is_oa":false,"landing_page_url":"https://doi.org/10.5220/0004827800570062","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.59452434,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.79196103,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"57","last_page":"62"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9671000242233276,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9671000242233276,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.95660001039505,"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"}},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9532999992370605,"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/benchmark","display_name":"Benchmark (surveying)","score":0.708324670791626},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6048548817634583},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5860891342163086},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5071017742156982},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4817807376384735},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.4578489363193512},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4463709890842438},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41319847106933594},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3136104345321655},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.14496952295303345}],"concepts":[{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.708324670791626},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6048548817634583},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5860891342163086},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5071017742156982},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4817807376384735},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.4578489363193512},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4463709890842438},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41319847106933594},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3136104345321655},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.14496952295303345},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.5220/0004827800570062","is_oa":false,"landing_page_url":"https://doi.org/10.5220/0004827800570062","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2474680198","https://openalex.org/W2597689725","https://openalex.org/W2363855676","https://openalex.org/W1569102320","https://openalex.org/W4381955737","https://openalex.org/W2770186408","https://openalex.org/W2049828308","https://openalex.org/W4385652378","https://openalex.org/W4385967446","https://openalex.org/W2998274290"],"abstract_inverted_index":{"This":[0],"paper":[1,41],"addresses":[2],"a":[3,45],"classical":[4],"combinatorial":[5],"optimization":[6],"problem":[7,17],"called":[8],"the":[9],"Minimum":[10],"Linear":[11],"Arrangement":[12],"(MinLA)":[13],"Problem.":[14],"The":[15,37],"MinLA":[16],"has":[18],"numerous":[19],"applications":[20],"in":[21],"different":[22],"domains":[23],"of":[24,39],"science":[25],"and":[26,49],"engineering.":[27],"It":[28],"is":[29,42],"known":[30],"to":[31,43],"be":[32],"NP-hard":[33],"for":[34],"general":[35],"graphs.":[36],"objective":[38],"this":[40],"introduce":[44],"new":[46],"mathematical":[47],"model":[48],"associated":[50],"theoretical":[51],"results,":[52],"including":[53],"novel":[54],"rank":[55],"inequalities.":[56],"Preliminary":[57],"computational":[58],"experiments":[59],"are":[60],"reported":[61],"on":[62],"some":[63],"benchmark":[64],"instances.":[65]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}
