{"id":"https://openalex.org/W2785769805","doi":"https://doi.org/10.1109/ssci.2017.8280805","title":"Solving the sequential ordering problem using branch and bound","display_name":"Solving the sequential ordering problem using branch and bound","publication_year":2017,"publication_date":"2017-11-01","ids":{"openalex":"https://openalex.org/W2785769805","doi":"https://doi.org/10.1109/ssci.2017.8280805","mag":"2785769805"},"language":"en","primary_location":{"id":"doi:10.1109/ssci.2017.8280805","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci.2017.8280805","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE Symposium Series on Computational Intelligence (SSCI)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/11380/1177202","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009957294","display_name":"Jafar Jamal","orcid":"https://orcid.org/0009-0003-9368-1094"},"institutions":[{"id":"https://openalex.org/I2614128279","display_name":"Dalle Molle Institute for Artificial Intelligence Research","ror":"https://ror.org/013355g38","country_code":"CH","type":"facility","lineage":["https://openalex.org/I15196421","https://openalex.org/I2614128279","https://openalex.org/I57201433"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"J. Jamal","raw_affiliation_strings":["Dalle Molle Institute for Artificial Intelligence, University of Applied Sciences of Southern Switzerland, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dalle Molle Institute for Artificial Intelligence, University of Applied Sciences of Southern Switzerland, Switzerland","institution_ids":["https://openalex.org/I2614128279"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009270700","display_name":"Ghassan Shobaki","orcid":"https://orcid.org/0000-0001-8727-671X"},"institutions":[{"id":"https://openalex.org/I2614128279","display_name":"Dalle Molle Institute for Artificial Intelligence Research","ror":"https://ror.org/013355g38","country_code":"CH","type":"facility","lineage":["https://openalex.org/I15196421","https://openalex.org/I2614128279","https://openalex.org/I57201433"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"G. Shobaki","raw_affiliation_strings":["Dalle Molle Institute for Artificial Intelligence, University of Applied Sciences of Southern Switzerland, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dalle Molle Institute for Artificial Intelligence, University of Applied Sciences of Southern Switzerland, Switzerland","institution_ids":["https://openalex.org/I2614128279"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010166299","display_name":"Vassilis Papapanagiotou","orcid":null},"institutions":[{"id":"https://openalex.org/I43522216","display_name":"California State University, Sacramento","ror":"https://ror.org/03e26wv14","country_code":"US","type":"education","lineage":["https://openalex.org/I43522216"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"V. Papapanagiotou","raw_affiliation_strings":["Department of Computer Science, California State University, Sacramento, Sacramento, California, United States of America"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, California State University, Sacramento, Sacramento, California, United States of America","institution_ids":["https://openalex.org/I43522216"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109533956","display_name":"Luca Maria Gambardella","orcid":"https://orcid.org/0009-0004-2555-1762"},"institutions":[{"id":"https://openalex.org/I2614128279","display_name":"Dalle Molle Institute for Artificial Intelligence Research","ror":"https://ror.org/013355g38","country_code":"CH","type":"facility","lineage":["https://openalex.org/I15196421","https://openalex.org/I2614128279","https://openalex.org/I57201433"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"L.M. Gambardella","raw_affiliation_strings":["Dalle Molle Institute for Artificial Intelligence, University of Applied Sciences of Southern Switzerland, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dalle Molle Institute for Artificial Intelligence, University of Applied Sciences of Southern Switzerland, Switzerland","institution_ids":["https://openalex.org/I2614128279"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017492288","display_name":"Roberto Montemanni","orcid":"https://orcid.org/0000-0002-0229-0465"},"institutions":[{"id":"https://openalex.org/I2614128279","display_name":"Dalle Molle Institute for Artificial Intelligence Research","ror":"https://ror.org/013355g38","country_code":"CH","type":"facility","lineage":["https://openalex.org/I15196421","https://openalex.org/I2614128279","https://openalex.org/I57201433"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"R. Montemanni","raw_affiliation_strings":["Dalle Molle Institute for Artificial Intelligence, University of Applied Sciences of Southern Switzerland, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dalle Molle Institute for Artificial Intelligence, University of Applied Sciences of Southern Switzerland, Switzerland","institution_ids":["https://openalex.org/I2614128279"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","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"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","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/T12176","display_name":"Optimization and Packing Problems","score":0.9976000189781189,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9965000152587891,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7444185018539429},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6849367618560791},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.6009194850921631},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.5848531723022461},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5679810643196106},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5487974882125854},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.4810048043727875},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4655300974845886},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4441727101802826},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.44181787967681885},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4195462465286255},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3987770080566406},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.25690245628356934},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.23530688881874084},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22475925087928772},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.06839647889137268}],"concepts":[{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7444185018539429},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6849367618560791},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.6009194850921631},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.5848531723022461},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5679810643196106},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5487974882125854},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.4810048043727875},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4655300974845886},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4441727101802826},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.44181787967681885},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4195462465286255},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3987770080566406},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.25690245628356934},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.23530688881874084},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22475925087928772},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.06839647889137268},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ssci.2017.8280805","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci.2017.8280805","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE Symposium Series on Computational Intelligence (SSCI)","raw_type":"proceedings-article"},{"id":"pmh:oai:iris.unimore.it:11380/1177202","is_oa":true,"landing_page_url":"http://hdl.handle.net/11380/1177202","pdf_url":null,"source":{"id":"https://openalex.org/S4306400718","display_name":"IRIS UNIMORE (University of Modena and Reggio Emilia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122346577","host_organization_name":"University of Modena and Reggio Emilia","host_organization_lineage":["https://openalex.org/I122346577"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:iris.unimore.it:11380/1177202","is_oa":true,"landing_page_url":"http://hdl.handle.net/11380/1177202","pdf_url":null,"source":{"id":"https://openalex.org/S4306400718","display_name":"IRIS UNIMORE (University of Modena and Reggio Emilia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122346577","host_organization_name":"University of Modena and Reggio Emilia","host_organization_lineage":["https://openalex.org/I122346577"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W126325332","https://openalex.org/W152613852","https://openalex.org/W1594443529","https://openalex.org/W1964651230","https://openalex.org/W1994184140","https://openalex.org/W1997039203","https://openalex.org/W2014147547","https://openalex.org/W2015411837","https://openalex.org/W2017069727","https://openalex.org/W2018474648","https://openalex.org/W2079697662","https://openalex.org/W2091873169","https://openalex.org/W2101028855","https://openalex.org/W2119650324","https://openalex.org/W2126730730","https://openalex.org/W2135140407","https://openalex.org/W2137045485","https://openalex.org/W2144931885","https://openalex.org/W2154338060","https://openalex.org/W2162944551","https://openalex.org/W2222512263","https://openalex.org/W2322966705","https://openalex.org/W2544648385","https://openalex.org/W3145128584","https://openalex.org/W4372046852","https://openalex.org/W6678857808"],"related_works":["https://openalex.org/W2009796757","https://openalex.org/W1931020284","https://openalex.org/W2568448495","https://openalex.org/W2165085685","https://openalex.org/W1591098987","https://openalex.org/W4319942994","https://openalex.org/W405521126","https://openalex.org/W4394849239","https://openalex.org/W2741597579","https://openalex.org/W2389899617"],"abstract_inverted_index":{"The":[0,23,65,80,99,122,140,160],"Sequential":[1],"Ordering":[2],"Problem":[3],"(SOP)":[4],"is":[5,68,120,128],"an":[6,53],"NP-hard":[7],"problem":[8,59],"with":[9],"a":[10,61,71,76,91,116],"wide":[11],"range":[12],"of":[13,18,25,45,96,124,142],"applications":[14],"in":[15,111],"the":[16,85,97,105,108,112,125,143,148,165,174],"domains":[17],"scheduling,":[19],"logistics":[20],"and":[21,28,75,138,171,179],"compilers.":[22],"development":[24],"powerful":[26],"computers":[27],"effective":[29],"algorithmic":[30],"techniques":[31],"has":[32],"made":[33],"it":[34],"possible":[35],"to":[36,89,168],"devise":[37],"exact":[38,55,152],"algorithms":[39],"that":[40,147,183],"can":[41],"solve":[42,90],"larger":[43],"instances":[44,182],"this":[46,49,58],"problem.":[47],"In":[48],"paper,":[50],"we":[51],"present":[52],"enhanced":[54],"algorithm":[56,67,88,127,150],"for":[57,173],"using":[60,131],"branch-and-bound":[62],"(B&B)":[63],"approach.":[64],"proposed":[66,126,149,158,161],"based":[69],"on":[70],"new":[72,81],"lower-bound":[73,82],"technique":[74,83,103],"local-search":[77],"domination":[78,102],"technique.":[79],"uses":[84],"dynamic":[86],"Hungarian":[87],"Minimum-Cost":[92],"Perfect":[93],"Matching":[94],"relaxation":[95],"SOP.":[98],"local":[100],"search":[101],"prunes":[104],"sub-tree":[106],"below":[107],"current":[109],"node":[110],"B&B":[113],"tree":[114],"if":[115],"better":[117],"partial":[118],"solution":[119],"found.":[121],"performance":[123],"evaluated":[129],"experimentally":[130],"three":[132,175],"different":[133],"benchmark":[134,177],"suites:":[135],"TSPLIB,":[136],"SOPLIB":[137],"COMPILERS.":[139],"results":[141],"experimental":[144],"evaluation":[145],"show":[146],"finds":[151],"solutions":[153],"considerably":[154],"faster":[155],"than":[156],"previously":[157,185],"algorithms.":[159],"approach":[162],"significantly":[163],"reduces":[164],"optimality":[166],"gap":[167],"0.217,":[169],"0.122,":[170],"0.004":[172],"respective":[176],"sets,":[178],"closes":[180],"five":[181],"were":[184],"open.":[186]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}