Parallel processing for difficult combinatorial optimization problems

Author： Roucairol C.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.92, Iss.3, 1996-08, pp. : 573-590

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems

By Toth P.  

European Journal of Operational Research, Vol. 125, Iss. 2, 2000-09 ,pp. : 222-238

Elsevier

Access to resources Recommend Favorite

Probabilistic combinatorial optimization problems on graphs: A new domain in operational research

By Paschos V.T.   Bellalouna M.   Murat C.  

European Journal of Operational Research, Vol. 87, Iss. 3, 1995-12 ,pp. : 693-706

Elsevier

Access to resources Recommend Favorite

A parallel particle swarm optimization algorithm for multi-objective optimization problems

By Fan Shu-Kai   Chang Ju-Ming  

Engineering Optimization, Vol. 41, Iss. 7, 2009-07 ,pp. : 673-697

Taylor & Francis Ltd

Access to resources Recommend Favorite

Connectedness of efficient solutions in multiple criteria combinatorial optimization

By Ehrgott M.   Klamroth K.  

European Journal of Operational Research, Vol. 97, Iss. 1, 1997-02 ,pp. : 159-166

Elsevier

Access to resources Recommend Favorite

Guidelines for the use of meta-heuristics in combinatorial optimization

By Hertz A.   Widmer M.  

European Journal of Operational Research, Vol. 151, Iss. 2, 2003-12 ,pp. : 247-252

Elsevier

Access to resources Recommend Favorite