Pages that link to "Item:Q1422887"
From MaRDI portal
The following pages link to Target-oriented branch and bound method for global optimization (Q1422887):
Displaying 7 items.
- Probabilistic subproblem selection in branch-and-bound algorithms (Q557739) (← links)
- An optimal algorithm for global optimization and adaptive covering (Q727397) (← links)
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments (Q868636) (← links)
- Generalized target-allocation functions and their evaluation by the branch-and-bound method (Q2130723) (← links)
- All roads lead to Rome -- new search methods for the optimal triangulation problem (Q2375332) (← links)
- A bridging method for global optimization (Q4260211) (← links)
- B&B method for discrete partial order and quasiorder optimizations (Q5383041) (← links)