Buscar
Mostrando ítems 1-10 de 1167
Solving multicommodity flow problems by an approximation scheme
(SIAM PUBLICATIONS, 2005)
We study an approximation scheme to solve minimum cost multicommodity flow problems to a relative accuracy of epsilon is an element of (0, 1]. The proposed scheme, which we shall call Algorithm A, is a bisection-based ...
Approximate max-min resource sharing for structured concave optimization
(SIAM PUBLICATIONS, 2001)
We present a Lagrangian decomposition algorithm which uses logarithmic potential reduction to compute an epsilon -approximate solution of the general max-min resource sharing problem with M nonnegative concave constraints ...
Minimal separators in extended P-4-laden graphs
(Elsevier Science BvAmsterdamHolanda, 2012)
On the convergence of decomposition algorithms in many-objective problems
(Universidade Federal de Minas GeraisBrasilICX - DEPARTAMENTO DE MATEMÁTICAUFMGSpringer, 2019)
CHAIN DECOMPOSITIONS OF 4-CONNECTED GRAPHS
(Siam PublicationsPhiladelphiaEUA, 2005)
Benders decomposition applied to security constrained unit commitment: Initialization of the algorithm
(Elsevier, 2015-03)
Benders decomposition has been broadly used for security constrained unit commitment problems, despite the fact that it may present convergence difficulties due to instabilities and to the mixed integer nature of the unit ...
EEG Feature Extraction for Person Identification Using Wavelet Decomposition and Multi-Objective Flower Pollination Algorithm
(Ieee-inst Electrical Electronics Engineers Inc, 2018-01-01)
In the modern life, the authentication technique for any system is considered as one of the most important and challenging tasks. Therefore, many researchers have developed traditional authentication systems to deal with ...
LU matrix decomposition algorithm
How to perform matrix decomposition from matrix A. In which cases we have such decomposition
Comparative Analysis of the Efficiency of the Transformation Algorithm and the Cycles Decomposition Algorithm for the Synthesis of Ternary Reversible Circuits
(Old City Publishing Inc, 2022-01-01)
The design algorithm for binary reversible circuits based on the decomposition of permutations as cascade of disjoint cycles (CD algorithm) is extended to the ternary domain. Its performance is evaluated using as a benchmark ...
Randomized Methods For Higher-order Subspace Separation
(IEEENew York, 2016)