Results 11 to 20 of about 6,356,541 (351)
Nonlinear Integer Programming [PDF]
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+86 more
core +6 more sources
Stochastic Integer Programming [PDF]
no abstract.
Stougie, L., van der Vlerk, M.H.
openaire +8 more sources
Research of Project Portfolio Selection Model Based on Organizational Strategy [PDF]
Based on the theory of the existing research of the project portfolio management, the paper analyzes the key factors of the project portfolio selection, and evaluates them using the fuzzy comprehensive evaluation method.
Wang Yaping
doaj +1 more source
Preventive maintenance scheduling with integer programming and constraint programming [PDF]
Preventive maintenance scheduling is to perform a series of tasks that prevents or minimizes production breakdowns and improves the reliability. Mathematical models have been developed to solve the preventive maintenance scheduling problem.
Majid Esmaelian, Hajar Bakran
doaj +1 more source
Parametric Integer Programming Algorithm for Bilevel Mixed Integer Programs [PDF]
11 ...
Köppe, Matthias+2 more
openaire +6 more sources
The purpose of this paper is to apply multistage stochastic programming to the transmission line expansion planning problem, especially when uncertain demand scenarios exist. Since the problem of transmission line expansion planning requires an intensive
Sini Han, Hyeon-Jin Kim, Duehee Lee
doaj +1 more source
Theory of linear and integer programming
Introduction and Preliminaries. Problems, Algorithms, and Complexity. LINEAR ALGEBRA. Linear Algebra and Complexity. LATTICES AND LINEAR DIOPHANTINE EQUATIONS. Theory of Lattices and Linear Diophantine Equations.
A. Schrijver
semanticscholar +1 more source
Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma [PDF]
We consider integer programming problems in standard form max { cTx : Ax = b, x⩾ 0, x ∈ Zn} where A ∈ Zm × n, b ∈ Zm, and c ∈ Zn. We show that such an integer program can be solved in time (m ⋅ Δ)O(m) ⋅ \Vert b\Vert∞2, where Δ is an upper bound on each ...
F. Eisenbrand, R. Weismantel
semanticscholar +1 more source