Results 251 to 260 of about 52,409 (312)

Reduction in Discrete Optimization Problem

2018 IEEE 13th International Scientific and Technical Conference on Computer Sciences and Information Technologies (CSIT), 2018
Discrete optimization problems are used for description of models in project management. The need for solution of such problems stimulated the search for effective techniques of calculations. Currently, many combinatorial methods for solution of discrete optimization problems have been developed.
Sergii K. Chernov, Lubava S. Chernova, Sergey D. Titov   +2 more
openaire   +1 more source

Global Optimization for Discrete Magnetostatic Problems

Digest of the Fifth Biennial IEEE Conference on Electromagnetic Field Computation, 1993
The problem of global optimization of magnetic structures composed of solenoids is examined, using a modified simulated annealing algorithm able to deal with the functions of continuous and/or discrete variables. The algorithm is tested using a discrete problem which allows determination of the cost function for every possible configuration of the ...
MARCHESI, MICHELE, MOLINARI G., REPETTO M.   +2 more
openaire   +2 more sources

On a discrete optimization problem

International Journal of Computer Mathematics, 1993
In this paper we are concerned with the following optimization problem: given a matroid on a finite set E and w 1,w 2 two real weight function on E, find a base B 0 minimizing w 1(B) + √w 2(B) on the family of all basis B of the matroid (w i (B) = Σ e∈B w i (e)i = 1, 2; w 2(B) > 0).
C. Croitoru, A. Andrei, C. Coclici
openaire   +1 more source

A discrete optimality system for an optimal harvesting problem

Computational Management Science, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hacer Öz Bakan, Fikriye Yilmaz, Gerhard-Wilhelm Weber   +2 more
openaire   +3 more sources

Discrete Monotonic Optimization with Application to a Discrete Location Problem

SIAM Journal on Optimization, 2006
A general discrete optimization problem is investigated that includes integer polynomial programs as special cases. To exploit the discrete monotonic structure of these problems, a special class of cuts called monotonicity cuts are developed and then adjusted according to a suitable procedure to accommodate discrete requirements.
Hoang, Tuy, Minoux, Michel, Nguyen, Thi Hoai-Phuong   +2 more
openaire   +1 more source

Fragmentary Structures in Discrete Optimization Problems

Cybernetics and Systems Analysis, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kozin, I. V., Maksyshko, N. K., Perepelitsa, V. A.   +2 more
openaire   +1 more source

A critical review of discrete filled function methods in solving nonlinear discrete optimization problems [PDF]

Applied Mathematics and Computation, 2010
Many real life problems can be modeled as nonlinear discrete optimization problems.Such problems often have multiple local minima and thus require global optimization methods.Due to high complexity of these problems, heuristic based global optimization ...
V Rehbock
exaly   +2 more sources