Target-oriented branch and bound method for global optimization
From MaRDI portal
Publication:1422887
DOI10.1023/A:1023245011830zbMath1060.90080MaRDI QIDQ1422887
Publication date: 12 February 2004
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1023245011830
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C26: Nonconvex programming, global optimization
90C27: Combinatorial optimization
Related Items
Probabilistic subproblem selection in branch-and-bound algorithms, An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments, All roads lead to Rome -- new search methods for the optimal triangulation problem