Buscar
Mostrando ítems 11-20 de 898
Set covering problem solved by new binary firefly algorithm [Problema de Cobertura de Conjunto Resuelto por el Nuevo Algoritmo Luciérnaga Binario]
(Institute of Electrical and Electronics Engineers Inc., 2015)
Metaheurísticas evolutivas para o problema de roteamento de unidades móveis de pistoneio
(Universidade Federal do Rio Grande do NorteBRUFRNPrograma de Pós-Graduação em Engenharia de ProduçãoEstratégia; Qualidade; Gestão Ambiental; Gestão da Produção e Operações, 2010-12-23)
This paper presents metaheuristic strategies based on the framework of evolutionary
algorithms (Genetic and Memetic) with the addition of Technical Vocabulary Building for
solving the Problem of Optimizing the Use of ...
The total-chromatic number of some families of snarks
(Elsevier Science BvAmsterdamHolanda, 2011)
Approximation algorithms for clique transversals on some graph classes
(Elsevier Science, 2015-09)
Given a graph G=(V,E) a clique is a maximal subset of pairwise adjacent vertices of V of size at least 2. A clique transversal is a subset of vertices that intersects the vertex set of each clique of G. Finding a ...
On star and biclique edge-colorings
(Wiley, 2017-01)
A biclique of G is a maximal set of vertices that induces a complete bipartite subgraph Kp,q of G with at least one edge, and a star of a graph G is a maximal set of vertices that induces a complete bipartite graph K1,q. ...
Determination of Feeder Areas for the Design of Large Distribution Networks
(2010)
One of the methods for setting distribution tariffs is benchmarking competition. In Chile, a yardstick competition scheme is applied. This yardstick consists of a “model company†that is designed in order to quantify ...
On neighborhood-Helly graphs
(Elsevier Science, 2017-01)
A family F of subsets of some set is intersecting when sets of F pairwise intersect. The family F is Helly when every intersecting subfamily of it contains a common element. In this paper we examine the families of vertex ...
Theory of constraints and the combinatorial complexity of the product-mix decision
(Elsevier Science Bv, 2009-09)
The theory of constraints (TOC) proposes that, when production is bounded by a single bottleneck, the best product mix heuristic is to select products based on their ratio of throughput per constraint use. This, however, ...
Computing Minimum Dilation Spanning Trees In Geometric Graphs
(SPRINGER-VERLAG BERLINBERLIN, 2015)