Metaheuristics for NP hard combinatorial optimization problems
... Dad for his children’s further study was not recalled This thesis, thereupon, is dedicated to them for their infinite stability margin iv v METAHEURISTICS FOR NP- HARD COMBINATORIAL OPTIMIZATION PROBLEMS ... subsequent subsection will give more formal definitions for combinatorial optimization problems 1.1.1.2 Combinatorial Optimization If F has combinatorial feat...
Ngày tải lên: 12/09/2015, 08:19
... pattern formation in Cellular Neural Networks: a tutorial,” IEEE Transactions on Circuits and Systems I, vol 42, no 10, pp 583–601, 1995 [14] M Ercsey-Ravasz, T Roska, and Z N´ da, “Perspectives for ... on Cellular Neural Networks and Their Applications (CNNA ’96), pp 433–438, Seville, Spain, June 1996 EURASIP Journal on Advances in Signal Processing [13] K R Crounse and L O Chu...
Ngày tải lên: 21/06/2014, 22:20
... article as: Jung: A general composite iterative method for generalized mixed equilibrium problems, variational inequality problems and optimization problems Journal of Inequalities and Applications ... method for generalized mixed equilibrium problems, fixed point problems and variational inequality problems Taiwan J Math 12, 1401–1432 (...
Ngày tải lên: 21/06/2014, 00:20
báo cáo hóa học: " On ε-optimality conditions for multiobjective fractional optimization problems" pptx
... al.: On ε-optimality conditions for multiobjective fractional optimization problems Fixed Point Theory and Applications 2011 2011:6 Submit your manuscript to a journal and benefit from: Convenient ... efficiency for (MFP) (see the definition of efficient solution of a multiobjective optimization problem in [21]) Using parametric approach, we transform the problem (MFP) into...
Ngày tải lên: 21/06/2014, 02:20
Báo cáo hóa học: " Research Article Optimality Conditions for Approximate Solutions in Multiobjective Optimization Problems" pdf
... 2 Journal of Inequalities and Applications During the past decades, researchers and practitioners in optimization had a keen interest in approximate solutions of optimization problems ... reasons for considering this kind of solutions One of them is that an approximate solution of an optimization problem can be computed by using iterative algorithms or heuristic methods I...
Ngày tải lên: 21/06/2014, 07:20
Báo cáo hóa học: " Research Article Hybrid Method for a Class of Stochastic Bi-Criteria Optimization Problems" docx
... constraints for the expectation method Final Remarks In this paper, a class of stochastic bi-criteria optimization problems was studied by a new hybrid method where the chance-constrained programming ... objective achieve its maximal value Next, taking into account that the expectation value represents the average level and the variance indicates the deviation of the...
Ngày tải lên: 21/06/2014, 07:20
Báo cáo hóa học: " Research Article Some Iterative Methods for Solving Equilibrium Problems and Optimization Problems" potx
... Mathematics and Computation, vol 186, no 2, pp 1551–1558, 2007 17 Y Su, M Shang, and X Qin, “An iterative method of solution for equilibrium and optimization problems, ” Nonlinear Analysis: Theory, Methods ... points problems, equilibrium points problems, and variational inequalities problems Therefore, the constrained set F : Fix S ∩EP F ∩VI C, B is very important a...
Ngày tải lên: 21/06/2014, 07:20
Báo cáo hóa học: " Research Article Existence of Solutions for Nonconvex and Nonsmooth Vector Optimization Problems" pot
... solution for a class of nonconvex and nonsmooth vector optimization problems in Banach spaces We show the equivalence between the nonconvex and nonsmooth vector optimization problem and the vector ... Optimization Theory and Applications, vol 106, no 3, pp 475–488, 2000 11 G Y Chen and B D Craven, Existence and continuity of solutions for vector o...
Ngày tải lên: 22/06/2014, 03:20
31 OPTIMIZATION PROBLEMS AND MODELS FOR PLANNING CELLULAR NETWORKS
... and F Malucelli Radio planning and coverage optimization of 3G cellular networks Wireless Networks, 2005c Submitted for publication E Amaldi, A Capone, F Malucelli, and F Signori UMTS radio planning: ... Mannino, and A Sassano Models and solution techniques for frequency assignment problems 4OR, 1(4):261 317 , 2003 K.I Aardal, A Hipolito, C.P.M van Hoesel, and B...
Ngày tải lên: 08/07/2014, 16:56
Báo cáo sinh học: "A combinatorial optimization approach for diverse motif finding applications" pdf
... in the basic motif finding case above, employing the same LP formulation and DEE techniques Subtle motifs Another widely studied formulation of motif finding is the 'subtle' motifs formulation ... solution for the original SP-based motif finding problem This is interesting, since the motif finding formulation is known to be NP-hard [27], and nevertheless our approach runs...
Ngày tải lên: 12/08/2014, 17:20
combinatorial type problems for triangulation graphs
... VEL type of G is the same as its CP type The RW type, electrical type, and EEL type of G are the same If G has bounded degree, then all described forms of combinatorial type – electrical type, ... equilateral type of G to be the classical conformal type of |G|eq Equilateral type is defined as the classical type of a surface that is described purely combinatorially As such,...
Ngày tải lên: 13/11/2014, 11:13
AUGMENTED LAGRANGIAN BASED ALGORITHMS FOR CONVEX OPTIMIZATION PROBLEMS WITH NON SEPARABLE l1 REGULARIZATION
... performs favourably in comparison to several state-of-the-art first-order algorithms for solving fused lasso problems, and outperforms the best available algorithms for clustered lasso problems With ... feature learning problems in statistics, as well as from problems in image processing We present those problems under the unified framework of convex minimization with non...
Ngày tải lên: 10/09/2015, 09:08
Regret models and preprocessing techniques for combinatorial optimization under uncertainty
... probabilistic models for linear and quadratic combinatorial optimization problems under uncertainty Firstly, we propose a new probabilistic model for minimizing the anticipated regret in combinatorial optimization ... develop compact MILP formulations for the minmax regret problem (2.4) (refer to Yaman et al [121] and Kasperski [76]) The minmax regret models ha...
Ngày tải lên: 10/09/2015, 09:29
A water flow algorithm for optimization problems
... 7.7 Flow Chart of the Modified WFA for the CVRP 189 xv GLOSSARY WFA Water flow algorithm MOWFA Multi-objective water flow algorithm 2LWFA Two-level water flow algorithm PFSP Permutation flow ... termite algorithm, ant colony optimization and bee colony optimization Finally, the group of swarm-based optimization algorithms includes particle swarm optimization, f...
Ngày tải lên: 10/09/2015, 15:48
Optimality conditions for vector optimization problems with generalized order
... solutions to setvalued optimization problems However, we are not familiar with any sufficient optimality conditions for nonconvex vector optimization problems with generalized order This motivates ... sufficient optimality conditions for vector optimization problems with respect to generalized order optimality The rest of this paper is organized as...
Ngày tải lên: 14/10/2015, 08:35