A co-operative parallel heuristic for mixed zero–one linear programming: Combining simulated annealing with branch and bound-Reference-Cited by-同舟云学术

A co-operative parallel heuristic for mixed zero–one linear programming: Combining simulated annealing with branch and bound

Published:2005-07 Issue:1 Volume:164 Page:12-23
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Nwana V.,Darby-Dowman K.,Mitra G.

Publisher

Elsevier BV

Subject

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

Reference22 articles.

1. An updated mixed integer programming library: MIPLIB 3.0;Bixby;Optima,1998

2. R.E. Bixby, W. Cook, A. Cox, E.K. Lee, Parallel mixed integer programming. Research Monograph CRPC- TR95554, Center for Research on Parallel Computation, Rice University, 1995

3. Simulated annealing––an annotated bibliography;Collins;American Journal of Mathematical and Management Sciences,1988

4. General purpose simulated annealing;Connolly;Journal of the Operational Research Society,1992

5. Properties of some combinatorial optimization problems and their effect on the performance of integer programming and constraint logic programming;Darby-Dowman;INFORMS Journal on Computing,1998

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

1. Fifty years of metaheuristics;European Journal of Operational Research;2024-04

2. The New Era of Hybridisation and Learning in Heuristic Search Design;The Palgrave Handbook of Operations Research;2022

3. A hybrid algorithm combining lexisearch and genetic algorithms for the quadratic assignment problem;Cogent Engineering;2018-01-01

4. Hybridisation Search;Heuristic Search;2017

5. Combining metaheuristics with mathematical programming, constraint programming and machine learning;Annals of Operations Research;2015-10-16