Pages that link to "Item:Q4834061"
From MaRDI portal
The following pages link to Parallel Branch-and-Branch Algorithms: Survey and Synthesis (Q4834061):
Displaying 36 items.
- An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP (Q319782) (← links)
- A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems (Q429470) (← links)
- An efficient data structure for branch-and-bound algorithm (Q558042) (← links)
- A heterogeneous cooperative parallel search of branch-and-bound method and tabu search algorithm (Q652663) (← links)
- Parallel branch and bound for multidimensional scaling with city-block distances (Q693147) (← links)
- A combined parallel algorithm for solving the knapsack problem (Q734010) (← links)
- An exact combinatorial algorithm for minimum graph bisection (Q747771) (← links)
- Airline crew scheduling: state-of-the-art (Q817210) (← links)
- A comparison of problem decomposition techniques for the FAP (Q972658) (← links)
- Parallel processing for difficult combinatorial optimization problems (Q1268289) (← links)
- A parallel branch-and-bound algorithm for multicommodity location with balancing requirements (Q1370711) (← links)
- Service network design in freight transportation (Q1582187) (← links)
- SelfSplit parallelization for mixed-integer linear programming (Q1652584) (← links)
- On parallel branch and bound frameworks for global optimization (Q1683320) (← links)
- Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: development and computational evaluation of a parallel branch-and-price algorithm (Q1725624) (← links)
- Multi-threading a state-of-the-art maximum clique algorithm (Q1736587) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- Multi-objective branch and bound (Q1753506) (← links)
- Performances of parallel branch and bound algorithms with best-first search (Q1917301) (← links)
- Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties (Q2018512) (← links)
- Parallel computational optimization in operations research: a new integrative framework, literature review and research directions (Q2189911) (← links)
- A branch-and-bound framework for unsupervised common event discovery (Q2193773) (← links)
- New quadratic lower bound for multivariate functions in global optimization (Q2228598) (← links)
- A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning (Q2340528) (← links)
- Large-scale parallelism for constraint-based local search: the costas array case study (Q2342606) (← links)
- On estimating workload in interval branch-and-bound global optimization algorithms (Q2392108) (← links)
- Experience of multilevel parallelizing of the branch and bound method in discrete optimization problems (Q2458085) (← links)
- Combining metaheuristics and exact methods for solving exactly multi-objective problems on the grid (Q2466400) (← links)
- On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization (Q2660812) (← links)
- P2P B&B and GA for the Flow-Shop Scheduling Problem (Q3603121) (← links)
- An Event-Driven Algorithm for Agents on the Web (Q3627855) (← links)
- Parallel algorithms for a multi-level network optimization problem (Q4819658) (← links)
- Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers (Q5057997) (← links)
- A Parallel Macro Partitioning Framework for Solving Mixed Integer Programs (Q5387645) (← links)
- Application of parallel heuristic algorithms for speeding up parallel implementations of the branch-and-bound method (Q6123149) (← links)
- Speedup estimates for some variants of the parallel implementations of the branch-and-bound method (Q6200659) (← links)
