Pages that link to "Item:Q4133408"

The following pages link to The Power of Dominance Relations in Branch-and-Bound Algorithms (Q4133408):

Displaying 26 items.

• Dominance rules in combinatorial optimization problems (Q421551) (← links)
• On the exact separation of mixed integer knapsack cuts (Q543396) (← links)
• General branch and bound, and its relation to \(A^*\) and \(AO^*\) (Q792768) (← links)
• Data-dependency graph transformations for instruction scheduling (Q880512) (← links)
• Combinatorial optimization problems in wireless switch design (Q926564) (← links)
• Robust algorithms: a different approach to oracles (Q1063417) (← links)
• Systolic processing for dynamic programming problems (Q1099090) (← links)
• A simulation tool for the performance evaluation of parallel branch and bound algorithms (Q1111941) (← links)
• Generalized best first search using single and multiple heuristics (Q1186365) (← links)
• A new variant of the \(A^*\)-algorithm which closes a node at most once. (Q1354068) (← 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)
• The application of automated reasoning to formal models of combinatorial optimization (Q1854978) (← links)
• Compact representation of near-optimal integer programming solutions (Q2191768) (← links)
• Dominance breaking constraints (Q2342647) (← links)
• On a resource-constrained scheduling problem with application to distributed systems reconfiguration (Q2371345) (← links)
• Discrete optimization with decision diagrams (Q2806864) (← links)
• Using branch-and-bound algorithms to obtain suboptimal solutions (Q3042297) (← links)
• A hybrid approach to discrete mathematical programming (Q4170534) (← links)
• Heuristic estimates in shortest path algorithms (Q5422014) (← links)
• The \(PN^{*}\)-search algorithm: Application to tsume-shogi (Q5941318) (← links)
• Automatic generation of dominance breaking nogoods for a class of constraint optimization problems (Q6080646) (← links)
• Exploiting functional constraints in automatic dominance breaking for constraint optimization (Q6488814) (← links)
• Towards an abstract parallel branch and bound machine (Q6560207) (← links)
• Parallel best-first branch-and-bound in discrete optimization: a framework (Q6560208) (← links)