Results 11 to 20 of about 284 (55)
Solving maximum independent set by asynchronous distributed hopfield-type neural networks
RAIRO - Theoretical Informatics and Applications, 2006 We propose a heuristic for solving the maximum indepen- dent set problem for a set of processors in a network with arbitrary topology. We assume an asynchronous model of computation and we use modified Hopfield neural networks to find high quality ...
G. Grossi, M. Marchi, Roberto Posenato
semanticscholar +1 more source
, 2018 In this paper, we study the portfolio optimization problem under an extended Heston stochastic volatility model. By using asymptotic analysis technique, we are able to derive approximations of the optimal value function and the optimal strategy.
Ji‐Hun Yoon, Sotheara Veng
semanticscholar +1 more source
Mobility offer allocations in corporate settings
EURO Journal on Computational Optimization, 2021 Corporate mobility is often based on a fixed assignment of vehicles to employees. Relaxing this fixation and including alternatives such as public transportation or taxis for business and private trips could increase fleet utilization and foster the use ...
Sebastian Knopp +2 more
doaj
A feasibility approach for constructing combinatorial designs of circulant type [PDF]
, 2017 In this work, we propose an optimization approach for constructing various classes of circulant combinatorial designs that can be defined in terms of autocorrelations.
Artacho, Francisco J. Aragón +3 more
core +3 more sources
Ingeniería y Ciencia, 2012 Unbalanced operation of distribution systems deteriorates power quality andincreases investment and operation costs. Feeder reconfiguration and phaseswapping are the two main approaches for load balancing, being the formermore difficult to execute due to
Mauricio Granada Echeverri +2 more
doaj +1 more source
Minimum Perimeter Rectangles That Enclose Congruent Non-Overlapping Circles [PDF]
, 2008 We use computational experiments to find the rectangles of minimum perimeter into which a given number n of non-overlapping congruent circles can be packed. No assumption is made on the shape of the rectangles.
Graham, Ronald L., Lubachevsky, Boris D.
core +3 more sources
Primal Recovery from Consensus-Based Dual Decomposition for Distributed Convex Optimization [PDF]
, 2015 Dual decomposition has been successfully employed in a variety of distributed convex optimization problems solved by a network of computing and communicating nodes.
Jamali-Rad, Hadi, Simonetto, Andrea
core +2 more sources
On Solving Travelling Salesman Problem with Vertex Requisitions
, 2017 We consider the Travelling Salesman Problem with Vertex Requisitions, where for each position of the tour at most two possible vertices are given. It is known that the problem is strongly NP-hard.
Eremeev, Anton, Kovalenko, Yulia
core +2 more sources
Rank-Sparsity Incoherence for Matrix Decomposition [PDF]
, 2009 Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown low-rank matrix. Our goal is to decompose the given matrix into its sparse and low-rank components.
Chandrasekaran, Venkat +3 more
core +7 more sources
Evolution Strategies in Optimization Problems [PDF]
, 2007 Evolution Strategies are inspired in biology and part of a larger research field known as Evolutionary Algorithms. Those strategies perform a random search in the space of admissible functions, aiming to optimize some given objective function.
Cruz, Pedro A. F., Torres, Delfim F. M.
core +3 more sources