Parallel processing for difficult combinatorial optimization problems
type: Item
instance of: scholarly article
title: Parallel processing for difficult combinatorial optimization problems
zbMATH Open document ID: 0914.90229
DOI: 10.1016/0377-2217(96)00009-4
author: Catherine Roucairol
published in: European Journal of Operational Research
publication date: 1998-12-03T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 1212260
zbMATH Keywords: metaheuristics
zbMATH Keywords: branch-and-bound
zbMATH Keywords: parallelization
zbMATH Keywords: heuristic search
describes a project that uses: BOB
MaRDI profile type: Publication
full work available at URL: 0377-2217(96)00009-4
OpenAlex ID: W2097144096
cites work: Q3994799
cites work: A distributed implementation of simulated annealing for the travelling salesman problem
cites work: Q4324979
cites work: A parallel integer linear programming algorithm
cites work: Large-scale 0-1 linear programming on distributed workstations
cites work: Massively parallel tabu search for the quadratic assignment problem
cites work: Implementation of parallel branch-and-bound algorithms --- experiences with the graph partitioning problem
cites work: Parallel branch and bound on fine-grained hypercube multiprocessors
cites work: Parallel Implementations Of A Branch-And-Bound Algorithm For Multicommodity Location With Balancing Requirements
cites work: Parallel Branch-and-Branch Algorithms: Survey and Synthesis
cites work: A PARALLEL BEST-FIRST B&B ALGORITHM AND ITS AXIOMATIZATION
cites work: Q4385522
cites work: Q3221759
cites work: OR Forum—Perspectives on Parallel Computing
cites work: Q4003182
cites work: Parallel depth first search. II: Analysis
cites work: Anomalies in parallel branch-and-bound algorithms
cites work: Performance of parallel branch-and-bound algorithms
cites work: An execution model for exploiting AND-parallelism in logic programs
cites work: Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
cites work: Performances of parallel branch and bound algorithms with best-first search
cites work: A parallel depth first search branch and bound algorithm for the quadratic assignment problem
cites work: Branch-and-bound as a higher-order function
cites work: A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
cites work: Evolution algorithms in combinatorial optimization
cites work: A study of parallel branch-and-bound algorithms with best-bound-first search
cites work: Q4739657
cites work: Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
cites work: Branch-and-bound and parallel computation: A historical note
cites work: Q3773322
cites work: Efficiency considerations in the implementation of parallel branch-and- bound
cites work: An Improved Heuristic for the Quadratic Assignment Problem
cites work: Q3777451
cites work: A parallel branch and bound algorithm for the quadratic assignment problem
cites work: Parallel state-space search for a first solution with consistent linear speedups
cites work: Multiple stack branch and bound
cites work: Parallel iterative search methods for vehicle routing problems
cites work: Experiments with parallel algorithms for combinatorial problems
cites work: MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems
description: scientific article; zbMATH DE number 1212260