Buscar
Mostrando ítems 11-20 de 3982
A NEW TRUST REGION ALGORITHM FOR BOUND CONSTRAINED MINIMIZATION
(Springer VerlagNew York, 1994)
On the solution of mathematical programming problems with equilibrium constraints
(Physica-verlag Gmbh & CoHeidelbergAlemanha, 2001)
Parametric Analysis of BFOA for Minimization Problems Using a Benchmark Function
(Universidad UTE, 2019)
BOX-QUACAN and the implementation of Augmented Lagrangian algorithms for minimization with inequality constraints
(Springer HeidelbergHeidelbergAlemanha, 2000)
New convergence results on an algorithm for norm constrained regularization and related problems
(Gauthier-villarsParisFrança, 1997)
Two-phase model algorithm with global convergence for nonlinear programming
(Plenum Publ CorpNew YorkEUA, 1998)
Algorithms for symmetric submodular function minimization under hereditary constraints and generalizations
(SIAM publications, 2013)
We present an efficient algorithm to find nonempty minimizers of a symmetric submodular function f over any family of sets I closed under inclusion. Our algorithm makes O(n(3)) oracle calls to f and I, where n is the ...
A Comprehensive Review of Metaheuristic Methods for the Reconfiguration of Electric Power Distribution Systems and Comparison with a Novel Approach Based on Efficient Genetic Algorithm
(2021-01-01)
The distribution system reconfiguration (DSR) is a complex large-scale optimization problem, which is usually formulated with one or more objective functions and should satisfy multiple sets of linear and non-linear ...
Hybridizing a multi-objective simulated annealing algorithm with a multi-objective evolutionary algorithm to solve a multi-objective project scheduling problem
(Elsevier, 2012-11)
In this paper, a multi-objective project scheduling problem is addressed. This problem considers two conflicting, priority optimization objectives for project managers. One of these objectives is to minimize the project ...
On minimizing the makespan when some jobs cannot be assigned on the same machine
(Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017)
We study the classical scheduling problem of assigning jobs to machines in order to minimize
the makespan. It is well-studied and admits an EPTAS on identical machines and a (2 − 1/m)-
approximation algorithm on unrelated ...