Pages that link to "Item:Q4766036"
From MaRDI portal
The following pages link to Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems (Q4766036):
Displaying 16 items.
- Dominance rules in combinatorial optimization problems (Q421551) (← links)
- General branch and bound, and its relation to \(A^*\) and \(AO^*\) (Q792768) (← links)
- A note on anomalies in parallel branch-and-bound algorithms with one-to- one bounding functions (Q1107978) (← links)
- Branch-and-bound as a higher-order function (Q1179748) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures (Q1837544) (← links)
- Compact representation of near-optimal integer programming solutions (Q2191768) (← links)
- Using branch-and-bound algorithms to obtain suboptimal solutions (Q3042297) (← links)
- Search techniques for a nonlinear multiprocessor scheduling problem (Q3319771) (← links)
- Resource allocation algorithm for light communication grid-based workflows within an SLA context (Q3612794) (← links)
- An extremal problem on random trees (Q3923968) (← links)
- Probability modeling of branch-and-bound method (Q3945970) (← links)
- Theoretical comparisons of search strategies in branch-and-bound algorithms (Q4192964) (← links)
- Depth-m search in branch-and-bound algorithms (Q4192965) (← links)
- Automatic generation of dominance breaking nogoods for a class of constraint optimization problems (Q6080646) (← links)
