Target-oriented branch and bound method for global optimization

DOI10.1023/A:1023245011830zbMath1060.90080OpenAlexW1573516464MaRDI QIDQ1422887

Volker Stix

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

zbMATH Keywords

global optimizationcombinatorial optimizationbranch and boundmaximum clique problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27)

Related Items (3)

All roads lead to Rome -- new search methods for the optimal triangulation problem ⋮ An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments ⋮ Probabilistic subproblem selection in branch-and-bound algorithms

This page was built for publication: Target-oriented branch and bound method for global optimization