Pages that link to "Item:Q3713596"

The following pages link to Anomalies in parallel branch-and-bound algorithms (Q3713596):

Displaying 36 items.

• Large-scale 0-1 linear programming on distributed workstations (Q750295) (← links)
• Parallel state-space search for a first solution with consistent linear speedups (Q757044) (← links)
• Parallel radial basis function methods for the global optimization of expensive functions (Q881510) (← links)
• An upper bound for the speedup of parallel best-bound branch-and-bound algorithms (Q1072940) (← links)
• An introduction to parallelism in combinatorial optimization (Q1076605) (← links)
• A parallel branch and bound algorithm for the quadratic assignment problem (Q1095791) (← links)
• A parallel integer linear programming algorithm (Q1098778) (← links)
• Branch-and-bound and parallel computation: A historical note (Q1099088) (← links)
• The general problem solving algorithm and its implementation (Q1104126) (← links)
• A note on anomalies in parallel branch-and-bound algorithms with one-to- one bounding functions (Q1107978) (← links)
• A simulation tool for the performance evaluation of parallel branch and bound algorithms (Q1111941) (← links)
• Parallel depth first search. I: Implementation (Q1116343) (← links)
• Parallel depth first search. II: Analysis (Q1116344) (← links)
• Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem (Q1118534) (← links)
• Implementation of parallel branch-and-bound algorithms --- experiences with the graph partitioning problem (Q1179744) (← links)
• Branch-and-bound as a higher-order function (Q1179748) (← links)
• Data-movement-intensive problems: Two folk theorems in parallel computation revisited (Q1184985) (← links)
• A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems (Q1194853) (← links)
• A multiple-tree search procedure for the resource-constrained project scheduling problem (Q1266726) (← links)
• Parallel processing for difficult combinatorial optimization problems (Q1268289) (← links)
• Efficiency considerations in the implementation of parallel branch-and- bound (Q1309863) (← links)
• Parallel evolutionary algorithms can achieve super-linear performance (Q1603567) (← links)
• Nagging: A scalable fault-tolerant paradigm for distributed search (Q1614863) (← links)
• On parallel branch and bound frameworks for global optimization (Q1683320) (← links)
• Multi-threading a state-of-the-art maximum clique algorithm (Q1736587) (← links)
• A parallel interval method implementation for global optimization using dynamic load balancing (Q1899458) (← links)
• Performances of parallel branch and bound algorithms with best-first search (Q1917301) (← links)
• A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning (Q2340528) (← links)
• A parallel branch and bound algorithm for the maximum labelled clique problem (Q2355318) (← links)
• PARSSSE: AN ADAPTIVE PARALLEL STATE SPACE SEARCH ENGINE (Q3144924) (← links)
• A review of literature on parallel constraint solving (Q4559826) (← links)
• Parallel algorithms for a multi-level network optimization problem (Q4819658) (← links)
• AN EFFICIENT ALGORITHM FOR MANAGING A PARALLEL HEAP∗ (Q4820057) (← links)
• Speedup estimates for some variants of the parallel implementations of the branch-and-bound method (Q6200659) (← links)
• Parallel best-first branch-and-bound in discrete optimization: a framework (Q6560208) (← links)
• Building a parallel branch and bound library (Q6560211) (← links)