Results 251 to 260 of about 791,112 (289)
Some of the next articles are maybe not open access.
A Generated Cut for Primal Integer Programming
Operations Research, 1974This paper develops a new cutting plane for primal integer programming. This cut, when it exists and is vised as pivot row, has the property that the minimum of the simplex evaluators of the next tableau is strictly larger (by an integer) than the minimum for the current tableau.
Larry R. Arnold, Mandell Bellmore
openaire +1 more source
Cut-Generating Functions for Integer Variables
Mathematics of Operations Research, 2016For an integer linear program, Gomory’s corner relaxation is obtained by ignoring the nonnegativity of the basic variables in a tableau formulation. In this paper, we do not relax these nonnegativity constraints. We generalize a classical result of Gomory and Johnson characterizing minimal cut-generating functions in terms of subadditivity, symmetry ...
Sercan Yildiz, Gérard Cornuéjols
openaire +2 more sources
Generalized reversible integer-to-integer transform framework
2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003) (Cat. No.03CH37490), 2004The generalized reversible ITI transform (GRITIT) framework, a single unified framework for reversible ITI wavelet/block transforms, is proposed. The relationship between the GRITIT framework and several previously proposed frameworks is also examined.
openaire +1 more source
Integer code generation for the TI TMS320C62X
2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221), 2002This paper presents a methodology which enables the generation of C62/spl times/ optimized fixed-point C-code from a floating-point description of an algorithm. The FRIDGE design environment transforms floating-point ANSI-C code with local fixed-point annotations into an internal bit-true representation.
Martin Coors +3 more
openaire +2 more sources
Lithuanian Mathematical Journal, 1996
Let \((q_i)\) be a sequence of generalized primes, i.e. \( q_i\) are real numbers and \( 1 = q_0 0\) the counting functions \[ B(x) :=\sum_{n_i \leq x} 1; \quad P(x) := \sum_{q_i\leq x}1 . \] \textit{A. Beurling} [Acta Math. 68, 255-291 (1937; Zbl 0017.29604)] started the study of such number systems.
openaire +2 more sources
Let \((q_i)\) be a sequence of generalized primes, i.e. \( q_i\) are real numbers and \( 1 = q_0 0\) the counting functions \[ B(x) :=\sum_{n_i \leq x} 1; \quad P(x) := \sum_{q_i\leq x}1 . \] \textit{A. Beurling} [Acta Math. 68, 255-291 (1937; Zbl 0017.29604)] started the study of such number systems.
openaire +2 more sources
A Generalized Base for Integers
The Mathematics Teacher, 1973One of the most important notations in mathematics, the positional system of no-tation of numbers, seems to have been invented in India by the Hindus. It was certainly transmitted to the Western world by the Arabs in about the eighth century A.D. At first the Hindu-Arabic system of notation was of interest only in the marketplace, but eventually it ...
openaire +1 more source
Constant Time Generation of Integer Partitions
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2007In this paper we give a simple algorithm to generate all partitions of a positive integer n. The problem is one of the basic problems in combinatorics, and has been extensively studied for a long time. Our algorithm generates each partition of a given integer in constant time for each without repetition, while best known algorithm generates each ...
Katsuhisa Yamanaka +3 more
openaire +1 more source
A Generalized Wedelin Heuristic for Integer Programming
INFORMS Journal on Computing, 2010A very important ingredient for solving hard general integer programs are heuristics that try to quickly find good feasible solutions. One of these heuristics is Wedelin's algorithm, which works for the limited class of 0-1 integer programs. A big advantage of Wedelin's approach is that it does not depend on a solution of the linear programming (LP ...
Oliver Bastert +2 more
openaire +2 more sources
On the generation of `magic integers'
Acta Crystallographica Section A, 1978The results of a new method of generating `magic integers' are given. The integers are considerably smaller than those described by Main [Acta Cryst. (1977). A33, 750-757].
openaire +1 more source
Generalized Universal Coding of Integers
2021 IEEE Information Theory Workshop (ITW), 2021Wei Yan 0014, Sian-Jheng Lin
openaire +1 more source