Using the Unconstrained Binary Quadratic Programming (UBQP) problem as a case study, we present an experimental analysis of neighborhood combinations for local search based metaheuristic algorithms. In this work, we use one-flip and two-flip moves and investigate combined neighborhoods with these two moves within two metaheuristic algorithms. The goal of the analysis is to help understand why a...

In this paper, we develop a simple and fast online algorithm for solving class of binary integer linear programs (LPs) arisen in general resource allocation problem. The requires only one single pass through the input data is free matrix inversion. It can be viewed as both an approximate LPs LP problems. inspired by equivalent form dual problem relaxed it essentially performs (one-pass) project...

Abstract Local search algorithms are frequently used to handle complex optimization problems involving binary decision variables. One way of implementing a local procedure is by using mixed-integer programming solver explore neighborhood defined through constraint that limits the number variables whose values allowed change in given iteration. Recognizing not all equally promising when searchin...

We present a signomial programming optimization approach to restore binary images which are degraded by additive white Gaussian noise. Numerical experiments confirm the proposed approach is efficient with good accuracy. c © 2007 Optical Society of America OCIS codes: (100.2000) Digital image processing; (100.3020) Image reconstruction-restoration

1 The fundamental goal of an electric utility is to serve its customers with a reliable and low cost power supply. This goal has led to a number of standard protection engineering practices that ensure adequate service; however, with deregulation of the utility industry and increased competitive pressures, there is a desire to further improve service reliability and reduce costs. In this vein, ...

Implementing binary methods in traditional object-oriented languages is difficult: numerous problems arise regarding the relationship between types and classes in the context of inheritance, or the need for privileged access to the internal representation of objects. Most of these problems occur in the context of statically typed languages that lack multi-methods (polymorphism on multiple argum...

Nowadays, many researchers are working on Constraint Satisfaction Problems (CSPs). Combination of AI/OR methods is gaining a great deal of attention because many real problems can be efficiently modelled as CSPs and they can be solved by means of combined AI/OR techniques. Many CSPs can be modelled as discrete and non-binary CSPs and, theoretically, they can be transformed into an equivalent bi...

Multiparty Session Types (MPST) is a typing discipline for message-passing distributed processes that can ensure properties such as absence of communication errors and deadlocks, and protocol conformance. Can MPST provide a theoretical foundation for concurrent and distributed programming in “mainstream” languages? We address this problem by (1) developing the first encoding of a full-fledged m...