
GeoSteiner
 Referenced in 20 articles
[sw04320]
 described a new branchandcut code for finding minimum spanning trees in arbitrary hyper...

FlipCut
 Referenced in 2 articles
[sw08374]
 matrix, and methods based on finding minimum cuts in some graph. Matrix representation methods compute ... method combines the computation of minimum cuts from graphbased methods with a matrix representation...

DuneUDG
 Referenced in 2 articles
[sw23901]
 implement completely new cutcell representations with a minimum of work...

Peklo
 Referenced in 0 articles
[sw05763]
 including multicommodity and balanced flows), minimum cuts, shortest path, minimum spanning tree, and maximum...

Pueblo
 Referenced in 29 articles
[sw00743]
 problems. To achieve this, we adopt the cuttingplane technique to draw inferences among ... clause and a PB constraint with minimum overhead and use both to determine the backtrack...

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...

Poissonsolver
 Referenced in 2 articles
[sw29705]
 using a spectral cutoff function approach to impose a minimum length scale...

eha
 Referenced in 8 articles
[sw06775]
 life examples. Keeping mathematical details to a minimum, the book covers key topics, including both ... package, eha, containing special treatments, including making cuts in the Lexis diagram, creating communal covariates...

Monopoly
 Referenced in 2 articles
[sw25689]
 2deg(v)⌉ neighbors in M. The minimum static monopoly problem has been extensively studied ... that in the presence of a vertex cut or an edge cut in the graph ... algorithm is given that solves the minimum monopoly problem in trees and cactus graphs...

BEDFix
 Referenced in 8 articles
[sw04469]
 Shellman and Sikorski [2002] by utilizing “deep cuts”, that is, eliminating additional segments ... gradient information; also, it handles functions with minimum Lipschitz constants equal to 1, whereas...

EBPCC
 Referenced in 1 article
[sw20118]
 region and the computing process of the minimum nodes required for covering the whole monitored ... improves the network’s coverage quality and cuts down the rapid network nodes energy consumption...

CGAL
 Referenced in 344 articles
[sw00118]
 The goal of the CGAL Open Source Project...

CoCoA
 Referenced in 607 articles
[sw00143]
 CoCoA is a system for Computations in Commutative...

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

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

GAP
 Referenced in 2735 articles
[sw00320]
 GAP is a system for computational discrete algebra...

gmp
 Referenced in 260 articles
[sw00363]
 GMP is a free library for arbitrary precision...

LAPACK
 Referenced in 1599 articles
[sw00503]
 LAPACK is written in Fortran 90 and provides...

LEDA
 Referenced in 258 articles
[sw00509]
 In the core computer science areas  data structures...