Old Web
English
Sign In
Acemap
>
Paper
>
BDD-Constrained A * Search: A Fast Method for Solving Constrained Shortest-Path Problems
BDD-Constrained A * Search: A Fast Method for Solving Constrained Shortest-Path Problems
2017
Fumito Takeuchi
Masaaki Nishino
Norihito Yasuda
Takuya Akiba
Shin-ichi Minato
Masaaki Nagata
Keywords:
Computer science
Pattern recognition
Mathematical optimization
Artificial intelligence
Shortest path problem
Algorithm
Combinatorial optimization
Binary decision diagram
Correction
Source
Cite
Save
Machine Reading By IdeaReader
14
References
0
Citations
NaN
KQI
[]