Simulated annealing approach to the max cut problem

Sandip Sen

doi:10.1117/12.141755

23 March 1993 Simulated annealing approach to the max cut problem

Sandip Sen

Proceedings Volume 1963, Applications of Artificial Intelligence 1993: Knowledge-Based Systems in Aerospace and Industry; (1993) https://doi.org/10.1117/12.141755
Event: Optical Engineering and Photonics in Aerospace Sensing, 1993, Orlando, FL, United States

Abstract

In this paper we address the problem of partitioning the nodes of a random graph into two sets, so as to maximize the sum of the weights on the edges connecting nodes belonging to different sets. This problem has important real-life counterparts, but has been proven to be NP-complete. As such, a number of heuristic solution techniques have been proposed in literature to address this problem. We propose a stochastic optimization technique, simulated annealing, to find solutions for the max cut problem. Our experiments verify that good solutions to the problem can be found using this algorithm in a reasonable amount of time.

Citation Download Citation

Sandip Sen "Simulated annealing approach to the max cut problem", Proc. SPIE 1963, Applications of Artificial Intelligence 1993: Knowledge-Based Systems in Aerospace and Industry, (23 March 1993); https://doi.org/10.1117/12.141755

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available