Cut-and-solve

ClimerSharlee, ZhangWeixiong · 2006

Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy which we refer to...

Read the paper · More papers on PaperTik