Can a Branch and Bound algorithm solve all instances of SALBP-1 efficiently?
Sign Up to like & getrecommendations! Published in 2019 at "IFAC-PapersOnLine"
DOI: 10.1016/j.ifacol.2019.11.630
Abstract: Abstract Following the publication by Sewell and Jacobson of a Branch and Bound algorithm which has solved all existing benchmarks for the simple assembly line balancing problem of type 1 (SALBP-1) in less than 1… read more here.
Keywords: bound algorithm; algorithm solve; solve instances; problem ... See more keywords
A Practical Algorithm to Solve the Near-Congruence Problem for Rigid Molecules and Clusters
Sign Up to like & getrecommendations! Published in 2023 at "Journal of chemical information and modeling"
DOI: 10.1021/acs.jcim.2c01187
Abstract: We present an improved algorithm to solve the near-congruence problem for rigid molecules and clusters based on the iterative application of assignment and alignment steps with biased Euclidean costs. The algorithm is formulated as a… read more here.
Keywords: algorithm; near congruence; solve near; congruence problem ... See more keywords