scholarly journals An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments

2008 ◽  
Vol 44 (2) ◽  
pp. 311-311 ◽  
Author(s):  
Etsuji Tomita ◽  
Toshikatsu Kameda
Keyword(s):  
Branch And Bound ◽  
Maximum Clique ◽  
Branch And Bound Algorithm ◽  
Computational Experiments

A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique

2016 ◽  
pp. 215-226 ◽  
Author(s):  
Etsuji Tomita ◽  
Kohei Yoshida ◽  
Takuro Hatta ◽  
Atsuki Nagao ◽  
Hiro Ito ◽  
...  
Keyword(s):  
Branch And Bound ◽  
Maximum Clique ◽  
Branch And Bound Algorithm

scholarly journals Optimizing the Paths of Trains Formed at the Loading Area in a Multi-loop Rail Network

Symmetry ◽  
2019 ◽  
Vol 11 (7) ◽  
pp. 844
Author(s):  
Xingkui Li ◽  
Boliang Lin ◽  
Yinan Zhao
Keyword(s):  
Genetic Algorithm ◽  
Branch And Bound ◽  
Large Scale ◽  
Path Selection ◽  
Branch And Bound Algorithm ◽  
Computational Experiments ◽  
Commercial Software ◽  
Rail Network ◽  
Selection For

Each loop in a multi-loop rail network consists of two segments, both of which have roughly the same conditions and mileage and are approximately symmetrical. This paper is devoted to optimizing the paths of trains formed at the loading area in a multi-loop rail network. To attain this goal, three different situations are analyzed, and two models are proposed for networks with adequate and inadequate capabilities. Computational experiments are also carried out using the commercial software Lingo, with the branch and bound algorithm. The results show that the models can achieve the same solution with different solution times. To solve the problem of path selection for large-scale train flows, a genetic algorithm is also designed and proves to perform well in a set of computational experiments.

Sign in / Sign up

Export Citation Format

Share Document