This article introduces SATHYS (SAT HYbrid Solver), a novel hybrid approach for propositional satisfiability. It combines local search and conflict driven clause learning (CDCL) scheme. Each time the local search part reaches a local minimum, the CDCL is launched. For SAT problems it behaves like a tabu list, whereas for UNSAT ones, the CDCL part tries to focus on minimum unsatisfiable sub-form...

in this paper, we present a binary-linear optimization model to prevent the spread of an infectious disease in a community. the model is based on the remotion of some connections in a contact network in order to separate infected nodes from the others. by using this model we nd an exact optimal solution and determine not only the minimum number of deleted links but also their exact positions. ...

A new deterministic method for solving a global optimization problem is proposed. The proposed method consists of three phases. The first phase is a typical local search to compute a local minimum. The second phase employs a discrete sup-local search to locate a so-called sup-local minimum taking the lowest objective value among the neighboring local minima. The third phase is an attractor-base...

The problems of circumscribing and inscribing convex polygons with, respectively, minimum and maximum area k-gons have been studied extensively in the recent past because of their applications to robotics and collision avoidance problems [CY, DA]. In particular, Klee and Laskowski [KL] have given an O(n log%) algorithm for finding all local minima (with respect to area) among the triangles that...

In this paper, an iterative optimization algorithm, called the Comb algorithm, is presented for approximating the global solution to MAP image restoration and segementation. The Comb derives new initial conngurations based on the best local minimum found so far and leads a local search towards the global minimum. Experimental comparisons show that the Comb produces solutions of quality comparab...

where V (y) is a smooth bounded function with positive lower bound, ε > 0 is a small number, 2 < p < 2N/(N−2) if N > 2 and 2 < p <+∞ if N = 2. Many works have been done on problem (1.1) recently (cf. [6, 7, 8, 16, 21, 22, 23]). One of the results in the papers just mentioned is that if x1,x2, . . . ,xk are k different strictly local minimum points of V (y), then (1.1) has a k-peak solution uε, ...

We propose a new method for finding the minimum ratio-cut of a graph. Ratio-cut is NP-hard problem for which the best previously known algorithm gi ves an O(log n)-factor approximation by solving its dually related maximum concurrent flow problem. We formulate the minimum ratio-cut as a certain nondifferentiable optimization problem, and sho w that the global minimum of the optimization problem...

The Minimum Weight Dominating Set (MWDS) problem is an important generalization of the Minimum Dominating Set (MDS) problem with extensive applications. This paper proposes a new local search algorithm for the MWDS problem, which is based on two new ideas. The first idea is a heuristic called two-level configuration checking (CC), which is a new variant of a recent powerful configuration checki...

Local area networks (LANs) form the basis for worldwide data communication, and, during the last years, performance and size of these networks has been continuously increasing. Inevitably, the configuration of these networks became an important and sophisticated job. This paper presents solutions for the cable management problem, which is a central part of the network configuration process. Amo...