{"id":"https://openalex.org/W2925098328","doi":"https://doi.org/10.1201/9781351236423-41","title":"Linear Ordering Problem","display_name":"Linear Ordering Problem","publication_year":2018,"publication_date":"2018-05-15","ids":{"openalex":"https://openalex.org/W2925098328","doi":"https://doi.org/10.1201/9781351236423-41","mag":"2925098328"},"language":"en","primary_location":{"id":"doi:10.1201/9781351236423-41","is_oa":false,"landing_page_url":"https://doi.org/10.1201/9781351236423-41","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Handbook of Approximation Algorithms and Metaheuristics, Second Edition","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/A5025346192","display_name":"Celso Satoshi Sakuraba","orcid":"https://orcid.org/0000-0003-4874-7042"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Celso S.Sakuraba","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5046237399","display_name":"Mutsunori Yagiura","orcid":"https://orcid.org/0000-0003-0970-9414"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mutsunori Yagiura","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5025346192"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5664,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.73391011,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"737","last_page":"751"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.37720000743865967,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.37720000743865967,"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/T12176","display_name":"Optimization and Packing Problems","score":0.2973000109195709,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.08429999649524689,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/mathematics","display_name":"Mathematics","score":0.36393603682518005},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3617762327194214}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36393603682518005},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3617762327194214}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1201/9781351236423-41","is_oa":false,"landing_page_url":"https://doi.org/10.1201/9781351236423-41","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Handbook of Approximation Algorithms and Metaheuristics, Second Edition","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":1,"referenced_works":["https://openalex.org/W2324141829"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694"],"abstract_inverted_index":{"This":[0],"chapter":[1,72],"reviews":[2],"several":[3,113],"methods":[4,31,75],"developed":[5,32],"for":[6,33,42,65,79,117],"the":[7,14,34,43,51,54,57,69,80,86,91,100,105,118,124,130],"linear":[8],"ordering":[9],"problem":[10,15],"(LOP)":[11],"and":[12,20,28,56,84,96,137,146],"explores":[13],"formally,":[16],"discussing":[17],"its":[18,62],"complexity":[19],"some":[21,74],"approximation":[22],"algorithms.":[23],"It":[24],"presents":[25],"exact,":[26],"greedy,":[27],"local":[29],"search":[30],"LOP,":[35],"followed":[36],"by":[37,82],"a":[38,47,133,152],"summary":[39],"of":[40,53,88,123,135],"metaheuristics":[41],"problem.":[44],"The":[45,71,120],"branch-and-cut,":[46],"method":[48],"resulting":[49],"from":[50],"combination":[52],"branch-and-bound":[55],"cutting":[58],"plane":[59],"methods,":[60],"has":[61],"efficiency":[63],"shown":[64],"many":[66],"problems,":[67],"including":[68],"LOP.":[70,119],"provides":[73],"that":[76],"build":[77],"solutions":[78],"LOP":[81],"inserting":[83],"changing":[85],"position":[87,106],"vertices":[89,101],"in":[90,102],"permutation":[92],"using":[93,151],"different":[94],"rules":[95],"measures":[97],"to":[98,104,143,148],"evaluate":[99],"relation":[103],"they":[107],"should":[108],"be":[109,144,149],"allocated.":[110],"There":[111],"are":[112],"metaheuristic":[114],"algorithms":[115],"proposed":[116],"iterative":[121],"part":[122],"algorithm":[125],"is":[126,139],"as":[127],"follows:":[128],"form":[129],"current":[131],"population,":[132],"number":[134],"crossovers":[136],"mutations":[138],"applied,":[140],"choosing":[141],"parents":[142],"combined":[145],"individuals":[147],"mutated":[150],"uniform":[153],"distribution.":[154]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-03-03T08:47:05.690250","created_date":"2025-10-10T00:00:00"}