Parallel processing for difficult combinatorial optimization problems-Reference-Cited by-同舟云学术

Parallel processing for difficult combinatorial optimization problems

Published:1996-08 Issue:3 Volume:92 Page:573-590
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Roucairol Catherine

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference109 articles.

1. Simulated Annealing and Boltzmann Machines;Aarts,1989

2. Constructing school time tables using simulated annealing: Sequential and parallel algorithms;Abramson;Management Science,1991

3. A distributed implementation of simulated annealing for the travelling salesman problem;Allwright;Parallel Computing,1989

4. Efficient parallel algorithms for search problems: Applications in VLSI CAD;Arvindam,1990

5. Méthodes de recherche tabou massivement parallèle pour le problème d'affectation quadratique;August,1994

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Parallelization of the Branch-and-Bound Algorithm in Transportation Discrete Network Design;Scientia Iranica;2016-04-01

2. State-copying and Recomputation in Parallel Constraint Programming with Global Constraints;16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008);2008-02

3. Dynamic search tree decomposition for balancing assembly lines by parallel search;International Journal of Production Research;2003-01

4. A parallel branch-and-bound method for cluster analysis;Annals of Operations Research;1999