Results 1 to 20 of 276
Sort by:

  • Knapsack
  • Referenced in 488 articles [sw04723]
  • Knapsack problems are the simplest NP-hard problems in combinatorial optimization, as they maximize...

  • SQPlab
  • Referenced in 179 articles [sw05161]
  • solve however; in particular it is NP-hard when the quadratic objective is nonconvex...

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

  • GLOB
  • Referenced in 37 articles [sw00357]
  • functions and on a class of NP-hard global optimization problems arising in practice...

  • DARCLASS
  • Referenced in 17 articles [sw06195]
  • complexity classes: solvable in polynomial time, NP-hard, or open. For a selection ... proof of polynomial-time solvability or NP-hardness...

  • GeoSteiner
  • Referenced in 23 articles [sw04320]
  • GeoSteiner package solves the following NP-hard problems: Euclidean Steiner Tree Problem in the Plane...

  • Algorithm 864
  • Referenced in 22 articles [sw05045]
  • dimensional rectangular bins. The problem is NP-hard in the strong sense and extremely difficult...

  • RAPTOR
  • Referenced in 20 articles [sw09002]
  • making the protein threading problem NP-hard. A surprising result is that, most...

  • Ts2pack
  • Referenced in 14 articles [sw23796]
  • orthogonal bin packing is a problem NP-hard in the strong sense where...

  • NuMVC
  • Referenced in 13 articles [sw08219]
  • Cover (MVC) problem is a prominent NP-hard combinatorial optimization problem of great importance...

  • htd
  • Referenced in 12 articles [sw21112]
  • tractable algorithms for problems that are NP-hard in general. Tree decompositions are the most...

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

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

  • RIATA-HGT
  • Referenced in 7 articles [sw17371]
  • gene tree is computationally very hard (NP-hard). Efficient algorithms exist for solving restricted cases...

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

  • ADMM_QAP
  • Referenced in 8 articles [sw31756]
  • proven to be extremely strong for many hard discrete optimization problems. This is in particular ... arguably one of the hardest NP-hard discrete optimization problems. There are several difficulties that...

  • 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 NP-hard. Due to its complexity and relevance in practice...

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

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