swMATH8221MaRDI QIDQ20231FDOQ20231
Author name not available (Why is that?)
Official website: http://dimacs.rutgers.edu/Challenges/
Cited In (only showing first 100 items - show all)
- OREX-J: Towards a universal software framework for the experimental analysis of optimization algorithms
- Minimum-cost flow algorithms: an experimental evaluation
- Fortran subroutines for network flow optimization using an interior point algorithm
- CsegGraph
- Hyperheuristics
- LEDA
- ManySAT
- March_eq
- FiberSCIP—A Shared Memory Parallelization of SCIP
- NetworkX
- Pueblo
- QAPLIB
- SDPLIB
- SNAP
- SNDlib
- GRASP
- TSPLIB
- UnitWalk
- GraphBase
- SatEx
- ClaiMaker
- xQx
- SATLIB
- VLSI
- EVE-OPT
- PSATO
- TABARIS
- ABACUS
- UBCSAT
- DSATUR
- CALMA
- Pajek
- EasyLocal++
- SDPT3
- OGDF
- OR-Library
- Pajek datasets
- SNAP
- GeoSteiner
- VSDP
- SteinLib
- QingTing1
- SATO
- CHOMPACK
- Walksat
- PBS
- Blossom V
- Blossom IV
- Concorde
- CirCut
- COL
- Knapsack
- LKH
- PPRN
- QSDP
- PDNET
- QUALEX
- SMCP
- SDPLR
- PORTA
- BG-WalkSAT
- Cliquer
- JOSTLE
- LEMON
- Max-AO
- FIR toolbox
- PENSDP
- MCF
- MCFClass
- Netsoft
- PFNRN
- RelaxIV
- Kiss FFT
- JBool
- KaFFPa
- EXTRACOL
- LAMG
- ACCPM
- Bubble-FOS/C
- BerkMin
- Chaff
- PaQuBE
- SpeeDP
- OREX-J
- SSPMO
- Zoltan
- LPAm+
- CEACOL
- E2COL
- SE2COL
- VNDS
- TTTPLOTS
- Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones
- LocalSolver 1.x: A black-box local-search solver for 0-1 programming
- An efficient method for nonlinearly constrained networks
- Blossom V: A new implementation of a minimum cost perfect matching algorithm
- On the solution of large-scale SDP problems by the modified barrier method using iterative solvers
- \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver
- The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study
- Coloring large graphs based on independent set extraction
This page was built for software: DIMACS
