{"id":"https://openalex.org/W2585473484","doi":"https://doi.org/10.1080/10556788.2017.1281923","title":"Branch and price for covering shipments in a logistic distribution network with a fleet of aircraft","display_name":"Branch and price for covering shipments in a logistic distribution network with a fleet of aircraft","publication_year":2017,"publication_date":"2017-02-01","ids":{"openalex":"https://openalex.org/W2585473484","doi":"https://doi.org/10.1080/10556788.2017.1281923","mag":"2585473484"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2017.1281923","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2017.1281923","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","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/A5028890725","display_name":"George Kozanidis","orcid":"https://orcid.org/0000-0002-4325-2975"},"institutions":[{"id":"https://openalex.org/I145722265","display_name":"University of Thessaly","ror":"https://ror.org/04v4g9h31","country_code":"GR","type":"education","lineage":["https://openalex.org/I145722265"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"George Kozanidis","raw_affiliation_strings":["Systems Optimization Laboratory, Department of Mechanical Engineering, University of Thessaly, Volos 38334, Greece"],"affiliations":[{"raw_affiliation_string":"Systems Optimization Laboratory, Department of Mechanical Engineering, University of Thessaly, Volos 38334, Greece","institution_ids":["https://openalex.org/I145722265"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5028890725"],"corresponding_institution_ids":["https://openalex.org/I145722265"],"apc_list":null,"apc_paid":null,"fwci":0.6124,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.725743,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"33","issue":"2","first_page":"221","last_page":"248"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998999834060669,"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.9998999834060669,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9945999979972839,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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.9923999905586243,"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/column-generation","display_name":"Column generation","score":0.7722600698471069},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6417399048805237},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.6231643557548523},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6045058369636536},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5965961217880249},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5900306105613708},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5739442706108093},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.5528315901756287},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.5102725028991699},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4490266740322113},{"id":"https://openalex.org/keywords/logistic-distribution","display_name":"Logistic distribution","score":0.4464341402053833},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.22214779257774353},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14791229367256165},{"id":"https://openalex.org/keywords/logistic-regression","display_name":"Logistic regression","score":0.1381469964981079},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.12737414240837097}],"concepts":[{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.7722600698471069},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6417399048805237},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.6231643557548523},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6045058369636536},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5965961217880249},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5900306105613708},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5739442706108093},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5528315901756287},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.5102725028991699},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4490266740322113},{"id":"https://openalex.org/C94465730","wikidata":"https://www.wikidata.org/wiki/Q589603","display_name":"Logistic distribution","level":3,"score":0.4464341402053833},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.22214779257774353},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14791229367256165},{"id":"https://openalex.org/C151956035","wikidata":"https://www.wikidata.org/wiki/Q1132755","display_name":"Logistic regression","level":2,"score":0.1381469964981079},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.12737414240837097},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/10556788.2017.1281923","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2017.1281923","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"},{"id":"pmh:oai:ir.lib.uth.gr:11615/75480","is_oa":false,"landing_page_url":"http://hdl.handle.net/11615/75480","pdf_url":null,"source":{"id":"https://openalex.org/S4306400243","display_name":"University of Thessaly Institutional Repository (University of Thessaly)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I145722265","host_organization_name":"University of Thessaly","host_organization_lineage":["https://openalex.org/I145722265"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Optimization Methods and Software","raw_type":"journalArticle"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320338080","display_name":"European Social Fund","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W87186517","https://openalex.org/W562049468","https://openalex.org/W1515859558","https://openalex.org/W1544463637","https://openalex.org/W1578418143","https://openalex.org/W1593250917","https://openalex.org/W1979700544","https://openalex.org/W2016132296","https://openalex.org/W2017070898","https://openalex.org/W2027442194","https://openalex.org/W2028886191","https://openalex.org/W2036900823","https://openalex.org/W2038078432","https://openalex.org/W2038700684","https://openalex.org/W2039059059","https://openalex.org/W2043341809","https://openalex.org/W2045478232","https://openalex.org/W2051214409","https://openalex.org/W2066588605","https://openalex.org/W2071769426","https://openalex.org/W2076220277","https://openalex.org/W2076811471","https://openalex.org/W2090232076","https://openalex.org/W2100526970","https://openalex.org/W2115760878","https://openalex.org/W2117466569","https://openalex.org/W2136871443","https://openalex.org/W2137019587","https://openalex.org/W2149335048","https://openalex.org/W2155032754","https://openalex.org/W2164583065","https://openalex.org/W2167580124","https://openalex.org/W2193694527","https://openalex.org/W2313958064","https://openalex.org/W2408262133"],"related_works":["https://openalex.org/W2911906655","https://openalex.org/W1925942709","https://openalex.org/W2047683846","https://openalex.org/W1556053881","https://openalex.org/W2044902158","https://openalex.org/W2109912052","https://openalex.org/W1711527768","https://openalex.org/W2408706507","https://openalex.org/W2004466487","https://openalex.org/W2765086890"],"abstract_inverted_index":{"We":[0,41,94,112,125],"consider":[1],"the":[2,33,66,91,96],"problem":[3,63,110],"of":[4,8,18,35,70,76],"covering":[5],"a":[6,11,16,48,61,73,79],"set":[7,75],"shipments":[9,27,71],"in":[10,105],"logistic":[12],"distribution":[13],"network":[14],"with":[15,127],"fleet":[17],"aircraft.":[19],"The":[20,57],"aim":[21],"is":[22,118],"to":[23,107],"cover":[24],"as":[25,28],"many":[26],"possible,":[29],"while":[30],"also":[31,113],"minimizing":[32],"number":[34,69],"aircraft":[36],"utilized":[37],"for":[38,54],"that":[39,64,83],"purpose.":[40],"develop":[42],"an":[43],"integer":[44],"programming":[45],"model":[46],"and":[47,50,78],"branch":[49],"price":[51],"solution":[52],"algorithm":[53],"this":[55],"problem.":[56,93],"proposed":[58,97],"methodology":[59],"utilizes":[60],"master":[62,92],"covers":[65],"maximum":[67],"possible":[68],"using":[72],"given":[74],"aircraft-routes,":[77],"column":[80],"generation":[81],"subproblem":[82],"generates":[84],"cost-effective":[85],"aircraft-routes":[86],"which":[87],"are":[88],"fed":[89],"into":[90],"describe":[95],"methodology,":[98],"illustrating":[99],"how":[100,115],"it":[101],"can":[102],"be":[103],"modified":[104],"order":[106],"accommodate":[108],"several":[109],"extensions.":[111],"investigate":[114],"its":[116,132],"efficiency":[117],"affected":[119],"by":[120],"various":[121],"key":[122],"design":[123],"parameters.":[124],"conclude":[126],"extensive":[128],"experimental":[129],"results":[130],"demonstrating":[131],"computational":[133],"performance.":[134]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2017-02-10T00:00:00"}