Results 241 to 250 of about 7,335,515 (304)
AI-enhanced inverse design of photonic crystal fiber optical modulator using deep reinforcement learning technique. [PDF]
Dawood NYM +5 more
europepmc +1 more source
Design of absorbing material distribution for noise barrier via accelerated BEM and optimality criteria method. [PDF]
Zhao A, Lei G, Jiang J, Ming H, Liu K.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Reduction in Discrete Optimization Problem
2018 IEEE 13th International Scientific and Technical Conference on Computer Sciences and Information Technologies (CSIT), 2018Discrete 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 +2 more
openaire +1 more source
A Critical Review of Discrete Filled Function Methods in Solving Nonlinear Discrete Optimization Problems [PDF]
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
Volker Rehbock
exaly +3 more sources
Global Optimization for Discrete Magnetostatic Problems
Digest of the Fifth Biennial IEEE Conference on Electromagnetic Field Computation, 1993The 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 +2 more
openaire +2 more sources
On a discrete optimization problem
International Journal of Computer Mathematics, 1993In 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
Discretization of Optimal Control Problems
2011Solutions to optimization problems with pde constraints inherit special properties; the associated state solves the pde which in the optimization problem takes the role of a equality constraint, and this state together with the associated control solves an optimization problem, i.e., together with multipliers satisfies first- and second-order necessary
Hinze, Michael, Rösch, Arnd
openaire +1 more source
A discrete optimality system for an optimal harvesting problem
Computational Management Science, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hacer Öz Bakan +2 more
openaire +4 more sources
Discrete Monotonic Optimization with Application to a Discrete Location Problem
SIAM Journal on Optimization, 2006A 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 +2 more
openaire +2 more sources

