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 20 of 1392 for “"Integer"”.

  1. Applying integer programming techniques to find minimum integer weights of voting games

    … I develop three algorithms to find the minimum integer weights for voting games. Games with up to at least 17 players can be solved in a reasonable amount of time. First, coalitions are mapped to constraints, reducing the problem to constraint optimization. The optimization techniques used are …

    mit Repository record for Applying integer programming techniques to find minimum integer weights of voting games (opens in a new tab)

  2. Integer cutting stock procedures

    … several methods for solving the one-dimensional. integer cutting stock problem and to synthesize a general integer cutting stock model for paper industry applications. Of the several integer programming and discrete alternative approaches that existed, the combinatorial programming procedure of …

    vt Repository record for Integer cutting stock procedures (opens in a new tab)

  3. On Efficient Solution Methods for Mixed-Integer Nonlinear and Mixed-Integer Quadratic Optimization Problems

    … we focus on solution methods for convex mixed-integer nonlinear optimization problems (MINLP). As one main result, we propose a new algorithm guaranteeing global optimality for convex MINLPs under standard assumptions. The new algorithm called MIQP-supported outer approximation (MIQPSOA) …

    bayreuth Repository record for On Efficient Solution Methods for Mixed-Integer Nonlinear and Mixed-Integer Quadratic Optimization Problems (opens in a new tab)

  4. Integer Programming With Groebner Basis

    Integer Programming problems are difficult to solve. The goal is to find an optimal solution that minimizes cost. With the help of Groebner based algorithms the optimal solution can be found if it exists. The application of the Groebner based algorithm and how it works is the topic of research. The …

    vcu Repository record for Integer Programming With Groebner Basis (opens in a new tab)

  5. Normal families of integer translations

    … C. We consider the normality of the family of integer translations of f, $\{ f(z + n):n = 0,\pm 1,\pm2,\...\}$. If the family is normal on a set G in C, then the set G is open and periodic with period 1, i.e., $z\pm 1\in G$ for all $z\in G$.

    uiuc Repository record for Normal families of integer translations (opens in a new tab)

  6. Combinatorial approaches to integer sequences

    Combinatorial methods are used to prove several results in number theory. The chapters may be read independently, and are briefly discussed below.

    uiuc Repository record for Combinatorial approaches to integer sequences (opens in a new tab)

  7. Integer optimization in data mining

    … and data mining over the last thirty years, integer optimization has had very limited impact in statistical computation. Thus, our objective is to develop a methodology utilizing state of the art integer optimization methods to exploit the discrete character of data mining problems. The …

    mit Repository record for Integer optimization in data mining (opens in a new tab)

  8. Probabilistic Firefighting on the Integer Lattice

    … directed graphs. We answer questions about the integer lattice, the area most commonly studied in firefighting.

    ku Repository record for Probabilistic Firefighting on the Integer Lattice (opens in a new tab)

  9. Using hyperbolic tangents in integer factoring

    Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1980.

    mit Repository record for Using hyperbolic tangents in integer factoring (opens in a new tab)

  10. Integer optimization methods for machine learning

    In this thesis, we propose new mixed integer optimization (MIO) methods to ad- dress problems in machine learning. The first part develops methods for supervised bipartite ranking, which arises in prioritization tasks in diverse domains such as information retrieval, recommender systems, natural …

    mit Repository record for Integer optimization methods for machine learning (opens in a new tab)

  11. On The Parallelization Of Integer Polynomial Multiplication

    … of dense univariate polynomials with integer coefficients targeting multi-core processors. Some of the proposed methods are based on well-known serial classical algorithms, whereas a novel algorithm is designed to make efficient use of the targeted hardware. Experimentation confirms …

    uwo Repository record for On The Parallelization Of Integer Polynomial Multiplication (opens in a new tab)

  12. Application-oriented Mixed Integer Non-Linear Programming

    … years there is a renovate interest for Mixed Integer Non-Linear Programming (MINLP) problems. This can be explained for different reasons: (i) the performance of solvers handling non-linear constraints was largely improved; (ii) the awareness that most of the applications from the real-world …

    bologna Repository record for Application-oriented Mixed Integer Non-Linear Programming (opens in a new tab)

  13. A Generalized Inverse Approach to Integer-Programming

    Made available in DSpace on 2014-12-10T23:09:03Z (GMT). No. of bitstreams: 1 7414645.pdf: 1571801 bytes, checksum: 5813da2de229103986aa4d852704fb64 (MD5) Previous issue date: 1974

    uiuc Repository record for A Generalized Inverse Approach to Integer-Programming (opens in a new tab)

  14. Global Non-Convex Optimization with Integer Variables

    … the RPT-BB approach to the binary, mixed-binary, integer, and mixed-integer variable domains. We outline a novel branch-and-bound algorithm that makes use of the Relaxation Perspectification Technique (RPT), as well as binary, integer, and eigenvector cuts. We demonstrate the performance of this …

    mit Repository record for Global Non-Convex Optimization with Integer Variables (opens in a new tab)

  15. Integer and Matrix Optimization: A Nonlinear Approach

    … entities and studied by separate subfields—integer and global optimization respectively—who propose entirely different strategies for optimizing over them. In this thesis, we adopt a different perspective on logical and rank constraints. We interpret both constraints as purely algebraic …

    mit Repository record for Integer and Matrix Optimization: A Nonlinear Approach (opens in a new tab)

  16. Multi-target tracking via mixed integer optimization

    … to these approaches, we propose the use of mixed integer optimization (MIO) models and local search algorithms that are (a) scalable, as they provide near optimal solutions for six targets and ten time periods in milliseconds to seconds, (b) general, as they make no assumptions on the data, (c) …

    mit Repository record for Multi-target tracking via mixed integer optimization (opens in a new tab)

  17. Trajectory optimization using mixed-integer linear programming

    … However, they can be formulated as mixed-integer linear programs (MILP) that can be solved for global optimality using powerful, commercial software. This thesis provides several extensions to previous work using MILP. The constraints for avoidance are extended to prevent plume …

    mit Repository record for Trajectory optimization using mixed-integer linear programming (opens in a new tab)

Page 1 of 70