Parallel processing for difficult combinatorial optimization problems
From MaRDI portal
Publication:1268289
DOI10.1016/0377-2217(96)00009-4zbMath0914.90229OpenAlexW2097144096MaRDI QIDQ1268289
Publication date: 3 December 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(96)00009-4
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Large-scale 0-1 linear programming on distributed workstations
- Parallel state-space search for a first solution with consistent linear speedups
- Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
- Parallel branch and bound on fine-grained hypercube multiprocessors
- Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
- Multiple stack branch and bound
- Experiments with parallel algorithms for combinatorial problems
- A parallel branch and bound algorithm for the quadratic assignment problem
- An execution model for exploiting AND-parallelism in logic programs
- A parallel integer linear programming algorithm
- Branch-and-bound and parallel computation: A historical note
- Evolution algorithms in combinatorial optimization
- Parallel depth first search. II: Analysis
- A parallel depth first search branch and bound algorithm for the quadratic assignment problem
- Implementation of parallel branch-and-bound algorithms --- experiences with the graph partitioning problem
- Branch-and-bound as a higher-order function
- A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
- Efficiency considerations in the implementation of parallel branch-and- bound
- A distributed implementation of simulated annealing for the travelling salesman problem
- A study of parallel branch-and-bound algorithms with best-bound-first search
- Performances of parallel branch and bound algorithms with best-first search
- Massively parallel tabu search for the quadratic assignment problem
- Parallel Implementations Of A Branch-And-Bound Algorithm For Multicommodity Location With Balancing Requirements
- MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems
- An Improved Heuristic for the Quadratic Assignment Problem
- Performance of parallel branch-and-bound algorithms
- Anomalies in parallel branch-and-bound algorithms
- OR Forum—Perspectives on Parallel Computing
- Parallel iterative search methods for vehicle routing problems
- A PARALLEL BEST-FIRST B&B ALGORITHM AND ITS AXIOMATIZATION
- Parallel Branch-and-Branch Algorithms: Survey and Synthesis
