While many forms of schedule decision problems are knownto be NP-complete, two forms of schedule analysisproblems are shown to be coNP-complete in the strong sense.Each of these involve guaranteeing that all deadlines are met for aset of task-graphs in statically-mapped,priority-based, ...
variant of the orthogonal colouring game, but this could be an interesting direction for future work. we have also shown that recognising graphs that admit a strictly matched involution is np-complete. lastly, the complexity of the very much related colouring construction game introduced by bodlaend...
Thanks so much for your quick response! Your answer has been very useful but now i have another problem, it just appears one name instead of at least couple of them, even when i choose the area, and do the ctrl+shift+enter at the end of the formule. What am i doing wrong...
Since two-stage flow shop is the extension of two-machine flow shop and our objective function is total tardiness plus delivery costs; thus, the complexity of this problem is more than the problem studied by Bank et al. (2012) and considered as NP-Hard. Show abstract Total tardiness ...
For the NP-hardness of the problem, we propose in this paper two algorithms mainly for large problem instances: an adaptive variable neighborhood search (AVNS) and a Partially Matched Crossover PMX-based Genetic Algorithm to solve this problem with the goal of ensuring a better solution quality...
Also the corresponding recognition problem is set. The problem is closely related to the classical graph colouring problem. In the article, we study and prove the polynomial reduction of the problems to each other. So it allows us to prove NP-completeness of the problem of two-step colouring....
They show that the problem is NP-hard, propose an integer programming formulation and describe a tabu search heuristic. Thomadsen and Stidsen [32] study the ring/ring network design problem. They suggest to solve the design problems associated with different levels sequentially. They propose a ...
A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem. Science 292, 472–475 (2001). Article CAS ADS MathSciNet PubMed MATH Google Scholar Lloyd, S., Mohseni, M. & Rebentrost, P. Quantum principal component analysis. Nature Phys. 10, 631–633 (...
The reason why the problem could not be reproduced is because the docker containers were deployed on the same machine, which means that the containers can communicate with each other. In other words, all the docker containers are in the same internal network, so the problem could not be repro...
In this work we present a heuristic algorithm to solve the Maximum Algebraic Connectivity Augmentation Problem (MACAP). This is an NP-complete problem (proved by Mosk-Aoyama in 2008) and consists in, given a graph, determining the smallest set of edges not belonging to it in such a way th...