Results 41 to 50 of about 243,465 (164)
Reformulating mixed-integer quadratically constrained quadratic programs [PDF]
, 2011 It is well known that semidefinite programming (SDP) can be used to derive useful relaxations for a variety of optimisation problems. Moreover, in the particular case of mixed-integer quadratic programs, SDP has been used to reformulate problems, rather ...
Galli, L, Letchford, A. N.
core
A primal (all-integer) integer programming algorithm
, 1965 The algorithm is most closely related to three existing procedures: the simplex method of G. B. Dantzig for linear programming problems, the Gomory all-integer integer programming algorithm, and the direct algorithm for integer programming of Ben-Israel ...
Young, Richard D.
core +1 more source
EURO Journal on Transportation and LogisticsIn this work, we consider the integrated problem of locomotive scheduling and driver assignment in rail freight companies. Our aim is to compute an optimal simultaneous assignment of locomotives and drivers to the trains listed in a given order-book ...
Andreas Bärmann +2 more
doaj +1 more source
Comparative Study of Integer and Non-Integer Order Models of Synchronous Generator
Energies, 2020 This article presents a comparison between integer and non-integer order modelling of a synchronous generator, in the frequency domain as well as in the time domain. The classical integer order model was compared to one containing half-order systems. The
Szymon Racewicz +3 more
doaj +1 more source
Verifying Sierpiński and Riesel Numbers in ACL2 [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 A Sierpinski number is an odd positive integer, k, such that no positive integer of the form k * 2^n + 1 is prime. Similar to a Sierpinski number, a Riesel number is an odd positive integer, k, such that no positive integer of the form k * 2^n + 1 is ...
John R. Cowles, Ruben Gamboa
doaj +1 more source
Two row mixed integer cuts via lifting [PDF]
Recently, Andersen et al. [1], Borozan and Cornuéjols [6] and Cornuéjols and Margot [9] characterized extreme inequalities of a system of two rows with two free integer variables and nonnegative continuous variables.
WOLSEY, Laurence A., SANTANU, Dey
core
Cutting plane methods for general integer programming
, 1993 Integer programming (IP) problems are difficult to solve due to the integer restrictions imposed on them. A technique for solving these problems is the cutting plane method.
Mitra, G +5 more
core
Binary positive semidefinite matrices and associated integer polytopes [PDF]
, 2010 We consider the positive semidefinite (psd) matrices with binary entries, along with the corresponding integer polytopes.We begin by establishing some basic properties of these matrices and polytopes.
Sorensen, M M +3 more
core
An elementary proof of Fermat’s last theorem for all even exponents
Journal of Mathematical Cryptology, 2020 An elementary proof that the equation x2n + y2n = z2n can not have any non-zero positive integer solutions when n is an integer ≥ 2 is presented. To prove that the equation has no integer solutions it is first hypothesized that the equation has integer ...
Karmakar Sudhangshu B.
doaj +1 more source