Solving Combinatorial Optimization Problems Using Augmented Lagrange Chaotic Simulated Annealing

ISSN： 0971-3514

Source： Differential Equations and Dynamical Systems, Vol.19, Iss.1-2, 2011-01, pp. : 171-179

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

Asymptotic convergence of a simulated annealing algorithm for multiobjective optimization problems

By Villalobos-Arias Mario

Mathematical Methods of Operations Research, Vol. 64, Iss. 2, 2006-10 ,pp. : 353-362

Springer Publishing Company

Access to resources Recommend Favorite

Solving a part classification problem using simulated annealing-like hybrid algorithm

By Tiwari M.K. Roy D.

Robotics and Computer-Integrated Manufacturing, Vol. 19, Iss. 5, 2003-10 ,pp. : 415-424

Elsevier

Access to resources Recommend Favorite

Solving Linear Conditional Completely Combinatorial Optimization Problems on Permutations by the Branch and Bound Method

By Iemets O.

Cybernetics and Systems Analysis, Vol. 49, Iss. 2, 2013-03 ,pp. : 264-278

Springer Publishing Company

Access to resources Recommend Favorite

Cones of multipowers and combinatorial optimization problems

By Vyalyi M.

Computational Mathematics and Mathematical Physics, Vol. 53, Iss. 5, 2013-05 ,pp. : 647-654

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Solving Convex MINLP Optimization Problems Using a Sequential Cutting Plane Algorithm

By Still Claus Westerlund Tapio

Computational Optimization and Applications, Vol. 34, Iss. 1, 2006-05 ,pp. : 63-83

Springer Publishing Company

Access to resources Recommend Favorite