A Zero-Suppressed Binary Decision Diagram Approach for Constrained Path Enumeration

Combinatorial optimization over graphs has been the subject of research. Recently, the solution of such problems by enumeration using a compact data structure called the zero-suppressed binary decision diagram was proposed and studied. The paper augments the existing frontier-based search method of...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Lecture notes in engineering and computer science Jg. 2240; S. 132
Hauptverfasser: Tan, Renzo, Kawahara, Jun, Garciano, Agnes, Sin, Immanuel
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Hong Kong International Association of Engineers 03.07.2019
Schlagworte:
Algorithms
Combinatorial analysis
Constraints
Data structures
Enumeration
Integer programming
Optimization
Subways
ISSN:2078-0958, 2078-0966
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract Combinatorial optimization over graphs has been the subject of research. Recently, the solution of such problems by enumeration using a compact data structure called the zero-suppressed binary decision diagram was proposed and studied. The paper augments the existing frontier-based search method of construction and puts forth a technique for accommodating additional constraints during computation. The shortest and longest path problems for the Osaka Metro transit network are simultaneously solved as demonstration. Furthermore, a comparison of the approach with a conventional integer programming method is presented towards justifying the effectiveness of the algorithm.
AbstractList Combinatorial optimization over graphs has been the subject of research. Recently, the solution of such problems by enumeration using a compact data structure called the zero-suppressed binary decision diagram was proposed and studied. The paper augments the existing frontier-based search method of construction and puts forth a technique for accommodating additional constraints during computation. The shortest and longest path problems for the Osaka Metro transit network are simultaneously solved as demonstration. Furthermore, a comparison of the approach with a conventional integer programming method is presented towards justifying the effectiveness of the algorithm.
Author Garciano, Agnes
Tan, Renzo
Sin, Immanuel
Kawahara, Jun
Author_xml – sequence: 1
  givenname: Renzo
  surname: Tan
  fullname: Tan, Renzo
– sequence: 2
  givenname: Jun
  surname: Kawahara
  fullname: Kawahara, Jun
– sequence: 3
  givenname: Agnes
  surname: Garciano
  fullname: Garciano, Agnes
– sequence: 4
  givenname: Immanuel
  surname: Sin
  fullname: Sin, Immanuel
BookMark eNo9jstKAzEYhYNUsNa-Q8D1QCb3LMdpvUBBoV25Kf9kMjZikzGZWfj2BpSuzll853KLFiEGd4WWlChdESPl4uKFvkHrnH1HOFeiZoQs0b7B7y7Faj-PY3I5ux4_-ADpB2-c9dnHgDcePhKccVOICPaEh5hwG0OeEvhQAm8wnfA2zGeXYCqJO3Q9wFd2639docPj9tA-V7vXp5e22VWj0VPFZG2AUgNSDkJKTpQwlnGqB2KN5lRRKxiQjtdOWK3qHnSnC2mcIbXqB7ZC93-15db37PJ0_IxzCmXxSKnUrFCCs18cO05E
ContentType Journal Article
Copyright Copyright International Association of Engineers Jul 3-Jul 5, 2019
Copyright_xml – notice: Copyright International Association of Engineers Jul 3-Jul 5, 2019
DBID 7SC
7TB
8FD
FR3
JQ2
KR7
L7M
L~C
L~D
DatabaseName Computer and Information Systems Abstracts
Mechanical & Transportation Engineering Abstracts
Technology Research Database
Engineering Research Database
ProQuest Computer Science Collection
Civil Engineering Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle Civil Engineering Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Mechanical & Transportation Engineering Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Engineering Research Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList Civil Engineering Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 2078-0966
GroupedDBID 5VS
7SC
7TB
8FD
ALMA_UNASSIGNED_HOLDINGS
FR3
JQ2
KQ8
KR7
L7M
L~C
L~D
ID FETCH-LOGICAL-p98t-3619a229a66f56640759c3428f0c984272c53a0b41e5c871da8b8f569e9017df3
ISSN 2078-0958
IngestDate Mon Jun 30 11:23:18 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-p98t-3619a229a66f56640759c3428f0c984272c53a0b41e5c871da8b8f569e9017df3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
PQID 2268301754
PQPubID 2049556
ParticipantIDs proquest_journals_2268301754
PublicationCentury 2000
PublicationDate 20190703
PublicationDateYYYYMMDD 2019-07-03
PublicationDate_xml – month: 07
  year: 2019
  text: 20190703
  day: 03
PublicationDecade 2010
PublicationPlace Hong Kong
PublicationPlace_xml – name: Hong Kong
PublicationTitle Lecture notes in engineering and computer science
PublicationYear 2019
Publisher International Association of Engineers
Publisher_xml – name: International Association of Engineers
SSID ssib044751300
ssj0000495498
Score 2.104495
Snippet Combinatorial optimization over graphs has been the subject of research. Recently, the solution of such problems by enumeration using a compact data structure...
SourceID proquest
SourceType Aggregation Database
StartPage 132
SubjectTerms Algorithms
Combinatorial analysis
Constraints
Data structures
Enumeration
Integer programming
Optimization
Subways
Title A Zero-Suppressed Binary Decision Diagram Approach for Constrained Path Enumeration
URI https://www.proquest.com/docview/2268301754
Volume 2240
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2078-0966
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib044751300
  issn: 2078-0958
  databaseCode: M~E
  dateStart: 20060101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Pb9MwFLa6iQMcJn4K2EA-TFyiICdOGvtYRgeTSpm0IFVcKidxEBJzS9eNiQNn_uy95x9NxqQJDlyiym2jKO-z_d7z-95HyL4uGta2iYSZlog4SxsWK61g4oErO6wRYq1VLZkU06mYzeTxYPA7cGEuvhXGiMtLufyvpoYxMDZSZ__B3JubwgB8BqPDFcwO178y_Cj6rFeLGOU6bWPwJnrjOLdvvZwOLHMKa7LQA3V8Kiw1ROVOqxcBfzgGtzAaG6RmdoYLpGl_6GAWa1vLFemuo2EgyVmdiMhvrl1uwIX72vxcbJZ59UNhx2jHD9ng9B0KHCnjGDhfTFfmeOI6Hhydnipz7ov9fcrCsqRixrsw9lquswdDW0zpH7qXqkwZdgGWrsX7a90fc4otYSVH96S3GCc-c3qtyfb04_zw02QyL8ez8tXye4z6Y3hO78VYtsgWZ6jB8OHXOKxL2BMRT_02uTuIqiCstmKH4dFubOXWPynvkx0fWNCRA8QDMtDmIbnXazf5iJyM6B_QoA4aNECDemjQAA0K0KA9aFCEBu1B4zEpD8flwfvYi2rESynWMYeAWaWpVMNhC548hPO5rDnEoC2rpcjSIq1zrliVJTqvYf42SlQCfik1OI5F0_InZNssjH5KaMuk4jnX2ZDVGS8qWeVSJHCvrGFZxZtnZC-8krmfH2dz8PYF7ClFnj2__etdcreDzh7ZXq_O9Qtyp75Yfz1bvbT2uQKidGac
linkProvider ISSN International Centre
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Zero-Suppressed+Binary+Decision+Diagram+Approach+for+Constrained+Path+Enumeration&rft.jtitle=Lecture+notes+in+engineering+and+computer+science&rft.au=Tan%2C+Renzo&rft.au=Kawahara%2C+Jun&rft.au=Garciano%2C+Agnes&rft.au=Sin%2C+Immanuel&rft.date=2019-07-03&rft.pub=International+Association+of+Engineers&rft.issn=2078-0958&rft.eissn=2078-0966&rft.volume=2240&rft.spage=132&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2078-0958&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2078-0958&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2078-0958&client=summon