Linear search algorithms have been shown to be particularly effective for solving partial Maximum Satisfiability (MaxSAT) problem instances. These algorithms start by adding a new relaxation variable to each soft clause and solving the resulting formula with a SAT solver. Whenever a model is found, a new constraint on the relaxation variables is added such that models with a greater or equal va...

Given a mixed-integer linear programming (MILP) model and an optimal basis of the associated linear programming relaxation, the Gomory’s corner relaxation is obtained by dropping nonnegativity constraints on the basic variables. Although this relaxation received a considerable attention in the literature in the last 40 years, the crucial issue of evaluating the practical quality of the corner-r...

Simulated annealing (SA) is a kind of relaxation method for finding equilibria Hamiltonian systems. A set evolution equations solved with SA, which derived from the original system so that energy changes monotonically while preserving Casimir invariants inherent to noncanonical The extremum reached by SA an equilibrium. Since searches extremum, it can also be used stability analysis when initia...

As part of the SemEval-2015 shared task on Broad-Coverage Semantic Dependency Parsing, we evaluate the performace of our last year’s system (TurboSemanticParser) on multiple languages and out-of-domain data. Our system is characterized by a feature-rich linear model, that includes scores for first and second-order dependencies (arcs, siblings, grandparents and co-parents). For decoding this sec...