Results 71 to 80 of about 35,538 (168)
Engineering ProceedingsThis article proposes a simulation-based hierarchical heuristic (SHH) method to optimize nozzle assignment, feeder assignment, and component sequencing in a single spin-head gantry type surface mounter.
Longlong Xu, Yarong Chen
doaj +1 more source
GRID SCHEDULING USING ENHANCED ANT COLONY ALGORITHM [PDF]
ICTACT Journal on Soft Computing, 2010 Grid computing is a high performance computing used to solve larger scale computational demands. Task scheduling is a major issue in grid computing systems. Scheduling of tasks is the NP hard problem.
P. Mathiyalagan +2 more
doaj
On the Computational Complexity of Optimization Convex Covering Problems of Graphs [PDF]
Computer Science Journal of Moldova, 2020 In this paper we present further studies of convex covers and convex partitions of graphs. Let $G$ be a finite simple graph. A set of vertices $S$ of $G$ is convex if all vertices lying on a shortest path between any pair of vertices of $S$ are in $S ...
Radu Buzatu
doaj
A Special Role of Boolean Quadratic Polytopes among Other Combinatorial Polytopes
Моделирование и анализ информационных систем, 2016 We consider several families of combinatorial polytopes associated with the following NP-complete problems: maximum cut, Boolean quadratic programming, quadratic linear ordering, quadratic assignment, set partition, set packing, stable set, 3-assignment.
A. N. Maksimenko
doaj +1 more source
An Efficient Polynomial Time Approximation Scheme for the Vertex Cover P3 Problem on Planar Graphs
Discussiones Mathematicae Graph Theory, 2019 Given a graph G = (V,E), the task in the vertex cover P3(V C P3) problem is to find a minimum subset of vertices F ⊆ V such that every path of order 3 in G contains at least one vertex from F.
Tu Jianhua, Shi Yongtang
doaj +1 more source
B-Chromatic Number: Beyond NP-Hardness
, 2015 The b-chromatic number of a graph G, chi_b(G), is the largest integer k such that G has a k-vertex coloring with the property that each color class has a vertex which is adjacent to at least one vertex in each of the other color classes. In the B-Chromatic Number problem, the objective is to decide whether chi_b(G) >= k. Testing whether chi_b(G)=Delta(
Panolan, Fahad +2 more
openaire +4 more sources
De Bruijn Superwalk with Multiplicities Problem is NP-hard. [PDF]
BMC Bioinformatics, 2013 Kapun E, Tsarev F.
europepmc +1 more source
Why Districting Becomes NP-hard
This paper investigates why and when the edge-based districting problem becomes computationally intractable. The overall problem is represented as an exact mathematical programming formulation consisting of an objective function and several constraint groups, each enforcing a well-known districting criterion such as balance, contiguity, or compactness.
Jost, Niklas +2 more
openaire +2 more sources
Finding the probability of infection in an SIR network is NP-Hard. [PDF]
Math Biosci, 2012 Shapiro M, Delgado-Eckert E.
europepmc +1 more source