
StdPoolingPolyAlgos
 Referenced in 5 articles
[sw34823]
 from sparse stronglypolynomial solutions to NPhardness. The standard pooling problem ... NPhard subclass of nonconvex quadraticallyconstrained optimization problems that commonly arises in process...

Cross
 Referenced in 7 articles
[sw30282]
 implementation of some previous methods are NPhard. In this article, we propose a framework...

Quartets MaxCut
 Referenced in 7 articles
[sw29616]
 quartet trees the problem is NPhard, as opposed to the problem for triples where...

RecIDCM3
 Referenced in 6 articles
[sw29614]
 Phylogenetic trees are commonly reconstructed based on hard optimization problems such as maximum parsimony ... since MP (and presumably ML) is NPhard, such approaches do not scale when applied...

VMDAV
 Referenced in 6 articles
[sw11787]
 sets is known to be difficult (NPhard). Therefore, heuristic methods are used in practice...

ADMBB
 Referenced in 5 articles
[sw31752]
 applications and is known to be NPhard even with one negative eigenvalue (QP1NE...

NeMa
 Referenced in 5 articles
[sw18899]
 show that the problem is NPhard, and also hard to approximate. (3) We propose...

GASTS
 Referenced in 5 articles
[sw29624]
 these rearrangements. However, rearrangements lead to NPhard problems, so that current approaches, such...

ToTo
 Referenced in 3 articles
[sw19369]
 retrieval of tree decompositions. Many NPhard problems on graphs become tractable on graphs ... Unfortunately computation of treewidth is itself NPhard and a wide variety of exact, heuristic...

CoReS
 Referenced in 4 articles
[sw28116]
 problem of finding its core is NPhard. Using the Tool {it CoReS}, we automatically...

AllDifferent
 Referenced in 4 articles
[sw08967]
 consistency on this global constraint is NPhard in general...

ParSSSE
 Referenced in 4 articles
[sw17623]
 literature. Solving such problems is generally NPhard, so that a bruteforce approach...

FastRFS
 Referenced in 2 articles
[sw29617]
 analyses, but maximum likelihood approaches are NPhard and Bayesian MCMC methods do not scale ... heterogeneous datasets. Supertree estimation is itself NPhard, and no current supertree method has sufficient...

kNeighborhood
 Referenced in 3 articles
[sw13966]
 limited memory) influence diagram is an NPhard problem, often approached through local search...

VOROPACKD
 Referenced in 3 articles
[sw40483]
 circular container. DPP is known NPhard and reported algorithms are slow for finding good...

GlobalMIT
 Referenced in 3 articles
[sw38463]
 regulatory network (GRN). Due to the NPhard nature of learning static Bayesian network structure...

Grid BnB
 Referenced in 3 articles
[sw12931]
 optimal solutions of search problems and NPhard optimization problems. Grid’BnB is a Java...

speedy_colorful_subtrees
 Referenced in 3 articles
[sw14026]
 involves finding exact solutions to the NPhard {sc Maximum Colorful Subtree} problem. Existing solvers...

TFRP
 Referenced in 3 articles
[sw37089]
 minimum information loss is an NPhard problem. Existing fixedsize techniques can obtain...

BetaSCP
 Referenced in 3 articles
[sw08772]
 sidechain positioning problem is NPhard. On the other hand, popular heuristic approaches focusing...