We describe three combinatorial branch-and-bound solvers for the maximum weight independent set problem. All use weighted clique covers to generate upper bounds, and all branch according to the method of Balas and Yu (1986). One extends and speeds up the method of Babel (1994). A second one employs a modified method from Balas and Yu (1986) to produce clique covers that share structural similar...

In this paper we generalize the cut strengthening method of Balas and Perregaard for 0/1 mixed-integer programming to disjunctive programs with general two-term disjunctions. We apply our results to linear programs with complementarity constraints.

In this paper, we consider a fitness-level model of a non-elitist mutation-only evolutionary algorithm (EA) with tournament selection. The model provides upper and lower bounds for the expected proportion of the individuals with fitness above given thresholds. In the case of so-called monotone mutation, the obtained bounds imply that increasing the tournament size improves the EA performance. A...

In this paper we generalise the method of Balas and Perregaard for 0/1 mixed-integer programming to facial disjunctive programs with two-term disjunction. We apply our results to linear programs with complementarity constraints.

Split cuts constitute a class of cutting planes that has been successfully employed by the majority of Branch-and-Cut solvers for Mixed Integer Linear Programs. Given a basis of the LP relaxation and a split disjunction, the corresponding split cut can be computed with a closed form expression. In this paper, we use the Lift-and-Project framework [10] to provide the basis, and the Reduce-andSpl...

This paper is about the work on user relevance feedback in image retrieval. We take this problem as a standard two-class pattern classification problem aiming at refining the retrieval precision by learning through the user relevance feedback data. However, we have investigated the problem by noting two important unique characteristics of the problem: small sample collection and asymmetric samp...

We characterize graphs H with the following property: Let G be a graph and F be a subgraph of G such that (i) each component of F is isomorphic to H or K2, (ii) the order of F is maximum. and (iii) the number of H-components in F is minimum subject to (ii). Then a maximum matching of F is also a maximum matching of G. This result is motivated by an analogous property of fractional matching disc...