The imposition of general disjunctions of the form “πx ≤ π0 ∨ πx ≥ π0 + 1”, where π, π0 are integer valued, is a fundamental operation in both the branch-and-bound and cuttingplane algorithms for solving mixed integer linear programs. Such disjunctions can be used for branching at each iteration of the branch-and-bound algorithm or to generate split inequalities for the cutting-plane algorithm....

We develop and experiment with new upper bounds for the constrained maximum-entropy sampling problem. Our partition bounds are based on Fischer’s inequality. Further new upper bounds combine the use of Fischer’s inequality with previously developed bounds. We demonstrate this in detail by using the partitioning idea to strengthen the spectral bounds of Ko, Lee and Queyranne and of Lee. Computat...

In deterministic continuous constrained global optimization, upper bounding the objective function generally resorts to local minimization at several nodes/iterations of the branch and bound. We propose in this paper an alternative approach when the constraints are inequalities and the feasible space has a non-null volume. First, we extract an inner region, i.e., an entirely feasible convex pol...

valid for f 2 Lp(IR ) and an arbitrary nite sequence of points in IR, is discussed. The linear functional f 7! R f was introduced by Micchelli [M80] in connection with Kergin interpolation. This functional also naturally occurs in other multivariate generalisations of Lagrange interpolation, including Hakopian interpolation, and the Lagrange maps of Section 5. For each of these schemes, (1) imp...

In this paper we first describe a new deviation inequality for sums of independent random variables which uses the precise constants appearing in the tails of their distributions, and can reflect in full their concentration properties. In the proof we make use of Chernoff’s bounds. We then apply this inequality to prove a global diameter reduction theorem for abstract families of linear operato...

In Missing Feature Theory (MFT), it is assumed that some of the features that are extracted from an observation are missing or unreliable. Applied to spectral features for noisy speech recognition, the clean feature values are known to be less than the observed noisy features. Based on this inequality constraint, an HMM-state-dependent clean speech value of the missing features can be inferred ...

We develop and experiment with new upper bounds for the constrained maximum-entropy sampling problem. Our partition bounds are based on Fischer's inequality. Further new upper bounds combine the use of Fischer's inequality with previously developed bounds. We demonstrate this in detail by using the partitioning idea to strengthen the spectral bounds of Ko, Lee and Queyranne and of Lee. Computat...

Although induction is omnipresent, inductive theorem proving in the form of descente infinie has not yet been integrated into full first-order deductive calculi. We present such an integration that even works for higher-order logic. This integration is based on lemma and induction hypothesis application for free variable sequent and tableau calculi. We discuss the appropriateness of these types...

The problem of finding a Bayesian network structure which maximizes a score function is known as Bayesian network structure learning from data. We study this problem in this paper with respect to a decomposable score function. Solving this problem is known to be NP-hard. Several algorithms are proposed to overcome this problem such as hill-climbing, dynamic programming, branch and bound, and so...

We study lower bounds on the optimal error probability in classical coding over classicalquantum channels at rates below the capacity, commonly termed quantum sphere-packing bounds. Winter and Dalai have derived such bounds for classical-quantum channels; however, the exponents in their bounds only coincide when the channel is classical. In this paper, we show that these two exponents admit a v...