
Knapsack
 Referenced in 452 articles
[sw04723]
 Knapsack problems are the simplest NPhard problems in combinatorial optimization, as they maximize...

SQPlab
 Referenced in 144 articles
[sw05161]
 solve however; in particular it is NPhard when the quadratic objective is nonconvex...

SDPpack
 Referenced in 51 articles
[sw04333]
 computing provably good approximations to NPhard graph problems in polynomial time. Semidefinite programs...

GLOB
 Referenced in 33 articles
[sw00357]
 functions and on a class of NPhard global optimization problems arising in practice...

DARCLASS
 Referenced in 15 articles
[sw06195]
 complexity classes: solvable in polynomial time, NPhard, or open. For a selection ... proof of polynomialtime solvability or NPhardness...

Algorithm 864
 Referenced in 20 articles
[sw05045]
 dimensional rectangular bins. The problem is NPhard in the strong sense and extremely difficult...

GeoSteiner
 Referenced in 20 articles
[sw04320]
 GeoSteiner package solves the following NPhard problems: Euclidean Steiner Tree Problem in the Plane...

RAPTOR
 Referenced in 19 articles
[sw09002]
 making the protein threading problem NPhard. A surprising result is that, most...

Ts2pack
 Referenced in 13 articles
[sw23796]
 orthogonal bin packing is a problem NPhard in the strong sense where...

azove
 Referenced in 12 articles
[sw04634]
 optimal variable ordering is an NPhard problem. We derive a $0/1$ IP for finding...

Algorithm 787
 Referenced in 11 articles
[sw13182]
 between them. A solution to the NPhard maximum independent set problem is an independent...

RPOLY
 Referenced in 10 articles
[sw05301]
 haplotype inference and also an interesting NPhard problem in itself. Recently, the introduction...

NuMVC
 Referenced in 10 articles
[sw08219]
 Cover (MVC) problem is a prominent NPhard combinatorial optimization problem of great importance...

NSPLib
 Referenced in 8 articles
[sw11952]
 nurses to shifts per day taking both hard and soft constraints into account. The objective ... problem is known to be NPhard. Due to its complexity and relevance in practice...

SLIDE
 Referenced in 8 articles
[sw08449]
 propagator for CardPath. Since propagation is NPhard in general, we identify special cases where...

iOpt
 Referenced in 8 articles
[sw00448]
 their efficiency and effectiveness in solving NPHard problems. However, there has been limited success...

RIATAHGT
 Referenced in 5 articles
[sw17371]
 gene tree is computationally very hard (NPhard). Efficient algorithms exist for solving restricted cases...

RecIDCM3
 Referenced in 5 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 5 articles
[sw11787]
 sets is known to be difficult (NPhard). Therefore, heuristic methods are used in practice...