Results 31 to 40 of about 359,233 (279)

Accelerated non-negative tensor completion via integer programming

Frontiers in Applied Mathematics and Statistics, 2023
The problem of tensor completion has applications in healthcare, computer vision, and other domains. However, past approaches to tensor completion have faced a tension in that they either have polynomial-time computation but require exponentially more ...
Wenhao Pan, Wenhao Pan, Anil Aswani, Chen Chen   +3 more
doaj   +1 more source

Nonlinear Integer Programming

, 2009
Research efforts of the past fifty years have led to a development of linear integer programming as a mature discipline of mathematical optimization.
A. Ben-Tal, A. Frangioni, A. Frangioni, A.I. Barvinok, A.I. Barvinok, A.M. Geoffrion, B. Bank, C. Buchheim, C.A. Meyer, C.H. Papadimitriou, D. Goldfarb, D. Vandenbussche, D. Vandenbussche, E. Balas, E. Balas, E. Balas, E. Boros, E.M.B. Smith, F. Santos, F.A. Al-Khayyal, G.P. McCormick, H.W. Lenstra, I. Quesada, J. Lee, J. Lee, J. Linderoth, J. Renegar, J. Renegar, J.A. Loera De, J.A. Loera De, J.A. Loera De, J.A. Loera De, J.A. Loera De, J.A. Loera De, J.B. Lasserre, J.E. Graver, J.E. Kelley Jr, J.P. Jones, K. Mulmuley, L. Liberti, L. Lovász, L.G. Khachiyan, M. Brion, M. Brion, M. Jach, M. Köppe, M. Köppe, M. Laurent, M. Putinar, M. Tawarmalani, M. Tawarmalani, M. Tawarmalani, M.A. Duran, M.D. Choi, M.E. Hartmann, M.R. Garey, M.T. Çezik, M.X. Goemans, N.V. Sahinidis, N.Z. Shor, O.K. Gupta, P. Bonami, P. Bonami, P. Bonami, P. Bonami, P.A. Parrilo, R. Hemmecke, R. Pörn, R.A. Stubbs, R.E. Gomory, R.G. Jeroslow, R.K. Ahuja, R.R. Thomas, S. Aktürk, S. Burer, S. Ceria, S. Heinz, S. Hoşten, S. Onn, S.P. Tarasov, T. Jacobi, T. Westerlund, T. Westerlund, W.J. Cook, Y. Berstein, Y. Berstein, Y.V. Matiyasevich   +86 more
core   +2 more sources

The parallel approximability of a subclass of quadratic programming [PDF]

, 1997
In this paper we deal with the parallel approximability of a special class of Quadratic Programming (QP), called Smooth Positive Quadratic Programming. This subclass of QP is obtained by imposing restrictions on the coefficients of the QP instance.
Serna Iglesias, María José, Xhafa Xhafa, Fatos   +1 more
core   +1 more source

Synthesis of the integer FIR filters with short coefficient word length

Wasit Journal for Pure Sciences, 2022
The integer simulation and development finite impulse response (FIR) filters taking into account the possibilities of their realization on digital integer platforms are considered.
Osamah Waleed allawi, Mohammed Hassan Abd   +1 more
doaj   +1 more source

N-fold integer programming in cubic time [PDF]

, 2011
N-fold integer programming is a fundamental problem with a variety of natural applications in operations research and statistics. Moreover, it is universal and provides a new, variable-dimension, parametrization of all of integer programming. The fastest
Hemmecke, Raymond, Onn, Shmuel, Romanchuk, Lyubov   +2 more
core   +1 more source

Integer programming

Discrete Mathematics, 1972
Integer problems are ones in which the variables are required to have integer answers. All of the variables may be required to be integer or only some of the variables. This latter is called mixed integer programming. Some problems only require that the integer variables take on the value of 0 or 1 while other problems allow a range of integer values ...
openaire   +2 more sources

Integer programming model for distance-edge-monitoring problem [PDF]

Yugoslav Journal of Operations Research
The paper considers the recently introduced distance-edge-monitoring problem. For a given graph G = (V,E), the set M is called distance-edge-monitoring if it is a subset of V and for every edge e of E there is a vertex x of M and a vertex y of V such ...
Kartelj Aleksandar, Filipović Vladimir, Kratica Jozef   +2 more
doaj   +1 more source

On Integer Programming, Discrepancy, and Convolution

, 2019
Integer programs with a constant number of constraints are solvable in pseudo-polynomial time. We give a new algorithm with a better pseudo-polynomial running time than previous results.
Jansen, Klaus, Rohwedder, Lars
core   +1 more source

Mixed-Integer Programming to Solve Distribution Problems

Journal of New Results in Science, 2020
Mixed-integer linear and quadratic programming problems are considered to solve distribution problems in this paper. The first problem is the distribution of proctors with respect to the student placements to the class- rooms by mixed-integer linear ...
Kamil Oruçoğlu, Elif Adaköy, Melis Mumcuoğlu, Seray Şengül, Gökhan Göksu   +4 more
doaj  

From Integer Programming to Machine Learning: A Technical Review on Solving University Timetabling Problems

Computation
Solving the university timetabling problem is crucial as it ensures efficient use of resources, minimises scheduling conflicts, and enhances overall productivity. This paper presents a comprehensive review of university timetabling problems using integer
Xin Gu, Muralee Krish, Shaleeza Sohail, Sweta Thakur, Fariza Sabrina, Zongwen Fan   +5 more
doaj   +1 more source