Chung, Chia-Shin; Flynn, James; Rom, Walter; … - 2013
, known to be NP-hard. Branch and bound, the usual approach to finding an optimal solution, experiences difficulty when n … study comparing GA with an optimal branch and bound algorithm, and various heuristic algorithms including the well known NEH …