Pages that link to "Item:Q4192964"
From MaRDI portal
The following pages link to Theoretical comparisons of search strategies in branch-and-bound algorithms (Q4192964):
Displaying 19 items.
- Pareto optimality and robustness in bi-blending problems (Q458955) (← links)
- Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints (Q925234) (← links)
- The semi-continuous quadratic mixture design problem: description and branch-and-bound approach (Q932200) (← links)
- On a branch-and-bound approach for a Huff-like Stackelberg location problem (Q1027988) (← links)
- An upper bound for the speedup of parallel best-bound branch-and-bound algorithms (Q1072940) (← links)
- A note on anomalies in parallel branch-and-bound algorithms with one-to- one bounding functions (Q1107978) (← links)
- An effective structured approach to finding optimal partitions of networks (Q1164549) (← links)
- Optimization of template-driven scheduling mechanisms: Regularity measures and computational techniques (Q1283915) (← links)
- A new node selection strategy in the branch-and-bound procedure (Q1342946) (← links)
- Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization (Q1592632) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- Performances of parallel branch and bound algorithms with best-first search (Q1917301) (← links)
- Some new perspectives for solving 0--1 integer programming problems using balas method (Q2051155) (← links)
- The stochastic transportation problem with single sourcing (Q2275818) (← links)
- Discrete optimization methods for multiprocessor computer systems (Q3034793) (← links)
- Using branch-and-bound algorithms to obtain suboptimal solutions (Q3042297) (← links)
- An extremal problem on random trees (Q3923968) (← links)
- Probability modeling of branch-and-bound method (Q3945970) (← links)
- Depth-m search in branch-and-bound algorithms (Q4192965) (← links)
