Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem

Author： Katayama K.   Narihisa H.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.134, Iss.1, 2001-10, pp. : 103-119

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

Simulated annealing for the unconstrained quadratic pseudo-Boolean function

By Alkhamis T.M.   Hasan M.   Ahmed M.A.  

European Journal of Operational Research, Vol. 108, Iss. 3, 1998-08 ,pp. : 641-652

Elsevier

Access to resources Recommend Favorite

Two simulated annealing-based heuristics for the job shop scheduling problem

By Steinhofel K.   Albrecht A.   Wong C.K.  

European Journal of Operational Research, Vol. 118, Iss. 3, 1999-11 ,pp. : 524-548

Elsevier

Access to resources Recommend Favorite

A simulated annealing heuristic for the one-dimensional cutting stock problem

By Chuen-Lung S.C.   Hart S.M.   Wai M.T.  

European Journal of Operational Research, Vol. 93, Iss. 3, 1996-09 ,pp. : 522-535

Elsevier

Access to resources Recommend Favorite

Application of chance-constrained programming based on multi-objective simulated annealing to solve a mineral blending problem

By Kumral Mustafa  

Engineering Optimization, Vol. 35, Iss. 6, 2003-12 ,pp. : 661-673

Taylor & Francis Ltd

Access to resources Recommend Favorite

Simulated annealing-based multiobjective algorithms and their application for system reliability

By Suman Balram  

Engineering Optimization, Vol. 35, Iss. 4, 2003-08 ,pp. : 391-416

Taylor & Francis Ltd

Access to resources Recommend Favorite