This paper gives a straightforward implementation of simulated annealing for solving maximum cut problems and compare its performance to that of some existing heuristic solvers. The formulation used is classical, dating to a 1989 paper of Johnson, Aragon, McGeoch, and Schevon. This implementation uses no structure peculiar to the maximum cut problem, but its low per-iteration cost allows it to ...

the graphical technique for nonlinear circuits was described that enable us to optimize circuits to obtain maximum output power, maximum efficiency or minimum intermodulation. according to this method a high power amplifier in the ka band was designed. using a nonlinear model of the transistor, optimum slope for load-line was determined so that maximum power at the output was obtainable, then ...

We introduce and study an eigenvalue upper bound p(G) on the maximum cut mc (G) of a weighted graph. The function ~o(G) has several interesting properties that resemble the behaviour of mc (G). The following results are presented. We show that q~ is subadditive with respect to amalgam, and additive with respect to disjoint sum and 1-sum. We prove that ~(G) is never worse that 1.131 mc(G) for a ...

Consider the problem of keeping closely related objects together and seperating unrelated objects from each other. This idea has clear applications to statistics, computer science, mathematics, social studies, and natural sciences just to name a few. To model this idea, we de ne the maximum cut problem that is simple to state but di cult to solve. The aim of this report is to provide two known ...

Last lecture we studied duality of linear programs (LP), specifically how to construct the dual, the relation between the optimum of an LP and its dual, and some duality applications. In this lecture, we will talk about another application of duality to prove one of the theorems in combinatorics so called Maximum Flow-Minimum Cut Problem. The theorem roughly says that in any graph, the value of...

The Companhia Siderúrgica Paulista – COSIPA is an integrated steel plant of the Usiminas System located in the municipality of Cubatão, in the coastal region of the São Paulo state, Brazil. This works produces 4.5 millions tons of steel per year; 1.0 million tons of this output are delivered as rolled plates, which meet a wide range of uses, such as those in agricultural implements, industrial ...

The need of realistic models to evaluate the availability of multi-state, multi-output plants is felt in many advanced industries such as the nuclear, aerospace, oil and chemical ones. Indeed, often the complexity of the plant and of its maintenance and recon guration policies is such to render unfeasible its reliability/availibility evaluation by analytical models. In this paper we consider th...

Many lower bound computation methods for branch and bound Max-SAT solvers can be explained as procedures that search for disjoint inconsistent subformulas in the Max-SAT instance under consideration. The difference among them is the technique used to detect inconsistencies. In this paper, we define five new lower bound computation methods: two of them are based on detecting inconsistencies via ...