• Biq Mac

  • Referenced in 72 articles [sw10532]
  • problem of finding a cut of maximum weight in a weighted graph ... optimal” solution of the basic semidefinite Max-Cut relaxation, strengthened by triangle inequalities. The expensive...
  • sdpt3r

  • Referenced in 5 articles [sw27792]
  • graph theory problems including the maximum cut problem. Technical details surrounding SDPT3 can be found...
  • ordinal

  • Referenced in 24 articles [sw12561]
  • ordered logit/probit/... models. Estimation is via maximum likelihood and mixed models are fitted with ... equidistance can be imposed on the thresholds (cut-points/intercepts). Standard model methods are available...
  • MFMC_Countable

  • Referenced in 1 article [sw38014]
  • formalises a proof of the maximum-flow minimal-cut theorem for networks with countably many...
  • PipLib

  • Referenced in 19 articles [sw23763]
  • software that finds the lexicographic minimum (or maximum) in the set of integer points belonging ... parametrized Gomory’s cuts algorithm followed by the parameterized dual simplex method. The PIP Library...
  • PPCI

  • Referenced in 1 article [sw36581]
  • /papers/volume17/15-307/15-307.pdf>; minimum normalised cut, Hofmeyr (2017) ; and maximum variance ratio clusterability, Hofmeyr...
  • Peklo

  • Referenced in 0 articles [sw05763]
  • balanced flows), minimum cuts, shortest path, minimum spanning tree, and maximum matching...
  • revisiting_mp_conditions

  • Referenced in 2 articles [sw34864]
  • handling bids with a minimum profit or maximum payment condition in a uniform and computationally ... exact decomposition procedure with sparse strengthened Benders cuts derived from the MILP formulation is also...
  • HapCUT

  • Referenced in 6 articles [sw35352]
  • haplotype assembly problem based on computing max-cuts in certain graphs derived from the sequenced ... significantly more accurate (20–25% lower maximum error correction scores for all chromosomes) than...
  • Xeggora

  • Referenced in 2 articles [sw35050]
  • Statistical Relational Models. We present improvements in maximum a-posteriori inference for Markov Logic ... hard in general. Several approaches, including Cutting Plane Aggregation (CPA), perform inference through translation...
  • Kink-detector

  • Referenced in 2 articles [sw29680]
  • helices with applications. Motivated by a cutting edge problem related to the shape of (alpha ... straight (alpha)-helix and derive the maximum likelihood estimation procedure. The cylinder is an accepted...
  • Power-Spectral-Clustering

  • Referenced in 1 article [sw36494]
  • varGamma)-convergence, which is an amalgamation of maximum spanning tree clustering and spectral clustering. This ... combinatorial grouping is used, where the normalized cut is replaced with the proposed algorithm...
  • ADOL-C

  • Referenced in 242 articles [sw00019]
  • ADOL-C: Automatic Differentiation of C/C++. We present...
  • CCSP

  • Referenced in 14 articles [sw00111]
  • CCSP: A formal system for distributed program debugging...
  • cdd

  • Referenced in 112 articles [sw00114]
  • The program cdd+ (cdd, respectively) is a C...
  • CGAL

  • Referenced in 362 articles [sw00118]
  • The goal of the CGAL Open Source Project...
  • CoCoA

  • Referenced in 634 articles [sw00143]
  • CoCoA is a system for Computations in Commutative...
  • Coq

  • Referenced in 1818 articles [sw00161]
  • Coq is a formal proof management system. It...
  • CSDP

  • Referenced in 200 articles [sw00169]
  • CSDP, A C Library for Semidefinite Programming. This...
  • DEA

  • Referenced in 242 articles [sw00194]
  • Data Envelopment Analysis (DEA) is becoming an increasingly...