- Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruningDavid R., Morrison; Sheldon H., Jacobson; Jason J., Sauppe; Edward C., SewellDiscrete Optimization, 2016, 19: 79-102.被引 88
- A Black Hole Algorithm for Solving the Set Covering ProblemRicardo, Soto; Broderick, Crawford; Ignacio, Figueroa; Stefanie, Niklander; Eduardo, OlguínTrends in Applied Knowledge-Based Systems and Data Science, Springer International Publishing, 855-861, 2016.
- Information in the Traveling Salesman ProblemGilad Barach; Hugo Fort; Yoni Mehlman; Fredy ZypmanApplied Mathematics, 2012, 03(08): 926-930.
期刊论文
A branch-and-price-and-cut method for computing an optimal bramble
2被引2阅读
