Results 11 to 20 of about 267 (48)
Relajacion lagrangeana para el problema de particionamiento de áreas geográficas
Entre las metodologías utilizadas en el particionamiento territorial, destacan los modelos de localización-asignación (“location-allocation”) y los de particionamiento de conjuntos ("set partitioning”), que agrupan pequeñas áreas geográficas llamadas ...
Juan Antonio Díaz García +4 more
doaj +1 more source
Ensemble methods of classification for power systems security assessment
One of the most promising approaches for complex technical systems analysis employs ensemble methods of classification. Ensemble methods enable a reliable decision rules construction for feature space classification in the presence of many possible ...
A. Zhukov +5 more
doaj +1 more source
Discrete Particle Swarm Optimization for the minimum labelling Steiner tree problem [PDF]
Particle Swarm Optimization is an evolutionary method inspired by the social behaviour of individuals inside swarms in nature. Solutions of the problem are modelled as members of the swarm which fly in the solution space.
AS Tanenbaum +19 more
core +2 more sources
Primal Recovery from Consensus-Based Dual Decomposition for Distributed Convex Optimization [PDF]
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
Matheuristics for optimizing the network in German wagonload traffic
In this paper, we consider a capacitated multiple allocation hub location problem derived from a practical application in network design of German wagonload traffic.
Julia Sender +3 more
doaj +1 more source
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
Multi-machine energy-aware scheduling
The traditional set of manufacturing scheduling problems concern general and easy-to-measure economic objectives such as makespan and tardiness. The variable nature of energy costs over the course of the day remains mostly ignored by most previous ...
David Van Den Dooren +4 more
doaj +1 more source
On Solving Travelling Salesman Problem with Vertex Requisitions
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]
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
Dense Packings of Congruent Circles in Rectangles with a Variable Aspect Ratio
We use computational experiments to find the rectangles of minimum area into which a given number n of non-overlapping congruent circles can be packed. No assumption is made on the shape of the rectangles.
A Thue +10 more
core +3 more sources

