Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 11 of 11 for “"Branching rule"”.

  1. Incidence homology for the hyperoctahedral group

    … In particular we show that they satisfy a branching rule. This branching rule is used to extract information about the representations and underlying combinatorial objects. Amongst the information extracted is a formula for the dimensions of the representations. This has applications in …

    east-anglia Download PDF for Incidence homology for the hyperoctahedral group (opens in a new tab)

  2. TRACTABLE DEPTH-BOUNDED APPROXIMATIONS TO SOME PROPOSITIONAL LOGICS. TOWARDS MORE REALISTIC MODELS OF LOGICAL AGENTS.

    … signed formulae, consist of linear operational rules and branching structural rule(s), can be used as a direct-proof and a refutation method, and is interesting independently of the approach in that it has an exponential speed-up on its tableau system counterpart. The latter given that we …

    milano Repository record for TRACTABLE DEPTH-BOUNDED APPROXIMATIONS TO SOME PROPOSITIONAL LOGICS. TOWARDS MORE REALISTIC MODELS OF LOGICAL AGENTS. (opens in a new tab)

  3. Some properties of Specht modules for the wreath product of symmetric groups

    … we prove analogues of the Specht module branching rule, we obtain results on homomorphisms and extensions between these modules, and, over an algebraically closed field whose characteristic is neither 2 nor 3, we prove that, if a module for Sm wr Sn has a filtration by these Specht module …

    kent Download PDF for Some properties of Specht modules for the wreath product of symmetric groups (opens in a new tab)

  4. Closing the Gap: A Theoretical and Practical Exploration of Branch-and-Bound Procedure for Mixed-Integer Programs

    … for MILPs. Given that node selection rules are well-understood, this thesis focuses primarily on branching rules. In Chapter 2, we consider the lot-sizing problem for which there exists a polynomial time dynamic programming algorithm and prove an (worst case) exponential lower bound on …

    gatech Repository record for Closing the Gap: A Theoretical and Practical Exploration of Branch-and-Bound Procedure for Mixed-Integer Programs (opens in a new tab)

  5. Methods and Algorithms for Process Synthesis and Intensification using Building Blocks

    … a single chemical process. Therefore, a novel branching rule based on the formulation group of optimization problem is proposed which is general to symmetric optimization problems. The performance of this branching rule is illustrated through computational experiments which demonstrates its …

    tamu Repository record for Methods and Algorithms for Process Synthesis and Intensification using Building Blocks (opens in a new tab)

  6. Strong convex relaxations for quadratically constrained quadratic programs

    … boolean quadric polytope. We then propose a new branching rule, inspired by the construction of the second-order cone relaxation. In addition, we describe a new application of bipartite bilinear program called finite element model updating problem, which is a fundamental problem in structural …

    gatech Repository record for Strong convex relaxations for quadratically constrained quadratic programs (opens in a new tab)

  7. Simultaneous Search and Monitoring by Unmanned Aerial Vehicles

    … method is combined with a heuristic branching rule, to generate a heuristic reactive policy. For the single pursuer SSM of evasive targets, an assumption is made and justified, which simplifies the search evasion game to a dynamic guaranteed search problem. For the multiple-pursuer …

    whiterose Download PDF for Simultaneous Search and Monitoring by Unmanned Aerial Vehicles (opens in a new tab)

  8. Data Driven Efficiency for E-Warehousing: Descriptive and Prescriptive Analytics

    … using dynamic programming. We also devise a new branching rule and new dynamic programming algorithm to solve the subproblem after branching. To assess the efficiency of the proposed branch-and-price methodology, we compare against the branch-and-price approach of Chen and Powell (1999) for the …

    waterloo Repository record for Data Driven Efficiency for E-Warehousing: Descriptive and Prescriptive Analytics (opens in a new tab)

  9. Characters of affine Kac-Moody algebras

    … generating functions are then used to obtain branching rule multiplicities for some affine embeddings. On the other hand, the Weyl-Kostant-Liu character formula provides a means of expressing irreducible characters of an affine algebra in terms of irreducible characters of a simple …

    soton Download PDF for Characters of affine Kac-Moody algebras (opens in a new tab)

  10. Data-driven Spatial Branch-and-bound Algorithm

    … to a data-driven algorithm: data-driven branching rules, data-driven underestimators, and constraint-handling techniques. The majority of the dissertation presents the development of theoretical and algorithmic strategies, including a support vector regression-based branching rule, two …

    gatech Repository record for Data-driven Spatial Branch-and-bound Algorithm (opens in a new tab)

  11. Novel Analysis of the Branch-and-Bound Method for Integer Programming

    … of branch-and-bound typically use variable branching, that is, the child nodes are obtained by fixing some integer constrained variable to one of its possible values. Even though modern MILP solvers are able to solve very large-scale instances efficiently, relatively little attention has …

    gatech Repository record for Novel Analysis of the Branch-and-Bound Method for Integer Programming (opens in a new tab)