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 5932 for “"Integer"”.
-
Integer Programming
… in which all variables can assume nonnegative integer values only are called pure integer programming problems. If in the absence of the integrality conditions the objective and constraint functions are linear, the resulting model is called an integer linear program. Such problems are hard to …
-
Distributed integer programming
In this thesis, we study distributed integer programming problems that involve multiple players with integer programming problems linked together with a common resource constraint. Our goal is to design decentralized algorithms that do not require a central processor to allocate the resource across …
-
Integer programming with Gröbner bases and applications to multiobjective integer programming
Integer programming and its multiobjective variants are important NP-hard problems with applications in graph theory, scheduling, logistics and decision making, among others. One approach to solving these classes of optimization problems that is underexplored in the literature is the algebraic …
-
Congruences related to Hilbert modular forms of integer and half-integer weights.
… p congruences between Fourier coefficients of integer weight ordinary Hilbert eigenforms that are at the same level but whose weights differ by an odd multiple of (p-1). These eigenforms belong to Hida’s p-adic family of eigenforms. We are then able to lift these congruences to congruences …
-
Dynamic Unbounded Integer Compression
… procedures and do not fully exploit dynamic integer compression capabilities. In this research, we have exploited dynamic Huffman compression method referred to as δ-Huffman coding for compressing integers and improved the attainable compression ratios. To achieve this, we have explored a …
-
Discriminators of Integer Sequences
The discriminator of an integer sequence \textbf{s} = $(s(n))_{n \geq 0}$, first introduced by Arnold, Benkoski and McCabe in 1985, is the function $D_s (n)$ that maps the integer $n \geq 1$ to the smallest positive integer $m$ such that the first $n$ terms of \textbf{s} are pairwise incongruent …
-
Counting Restricted Integer Partitions
The first chapter examines $p_b(n)$, the number of partitions of $n$ into powers of $b$, along with a family of identities which can be deduced by iterating a recurrence satisfied by $p_b(n)$ in a suitable way. These identities can then be used to calculate $p_b(n)$ for large values of $n$. The …
-
On integer linear programming.
A survey of the methods of solving the integer program, max summation from j=1 to j=n of the quantity (c sub j x sub j) subject to summation, j=1 to j=n of the quantity (a sub ij x sub j) = b sub i, i=1,...,m, and x sub j = or 0 and integer (j=1,...,n) is presented. Emphasis is placed on methods …
-
Sparsity in integer programming
… explored direction of research in the context of Integer Programming. Harnessing the sparsity present in the underlying linear relaxation, using decomposition/reformulation techniques and complexity results for approximation algorithms correspond to most of the previous results in this area. In …
-
Integer programming based search
When integer programming (IP) models are used in operational situations there is a need to consider the tradeoff between the conflicting goals of solution quality and solution time, since for many problems solving realistic-size instances to a tight tolerance is still beyond the capability of …
-
Dissecting an integer polymatroid
One way to define an integer polymatroid ρ is via its independent set polytope, whose faces are parallel translates of the independent set polytopes of the minors of ρ. To better understand the interior of this polytope, we endow a structure on this polytope which relates to the polymatroid …
-
Consistency in integer programming
… the size of the branch-and-bound tree for integer programs. Cutting planes are traditionally used to tighten relaxations of the problem by excluding fractional solutions, which leads to improving the dual bounds. In this research, we study a fundamentally different role of cutting planes …
-
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 …
Page 1 of 297