- Combinatorial/Gobal Optimal Methods
- Integer Linear Programming (ILP)*** [43]
- Multicut*** [45,40]
- Multiway Cut*** [45,40]
- Asymetric Multiway Cut*** [3]
- A-star branch-and-bound search (AStar) [25]
- Reduced Inference [41]
- BruteForce
- CombiLP [17]
- DAOOPT [15]
- AD3 with Branch and Bound [16]
- Linear Programming Relaxations
- Dual Decomposition with Bundle [44]
- Dual Decomposition with Subgradients [44]
- Sequntial Tree-reweighted Message Passing (TRWS)** [51]
- Adaptive Diminishing Smoothing ALgorithm (ADSAL) [61]
- Quadratic Pseudo Boolean Optimization (QPBO)* [60]
- Higher order QPBO [34]
- MQPBO** [50,63]
- Multiway Cut Relaxations*** [45,40]
- Linear Programming Relaxations over the Local Polytope (LP)*** [43]
- AD3 [16]
- MPLP [14,13,12]
- GraphCut
- Message Passing Methods
- Dynamic Programming on acyclic graphs (also for higher-order) [24]
- Loopy Belief Propagation (LBP)** (different variant, also for higher-order) [64,24]
- Sequential Belief Propagation (BPS)** (different variant, also for higher-order) [64,51,24]
- Tree-reweighted Belief Propagation (TRBP) (also for higher order) [66]
- Move Making Methods
- Lazy Flipper [22]
- Inf and Flip [22]
- Iterated Conditional Modes (ICM) [26]
- FastPD* [53]
- Alpha-Expansion** [30]
- Alpha-Beta-Swap** [30]
- Alpha-Fusion [4]
- Kerninghan Lin Algorithm [47]
- LOC [39]
- Self-Fusion [4]
- Proposal-Based-Fusion [4]
- Local Submodular Approximation with Trust Region [6]
- Sampling
- Gibbs Sampling (beta) [36]
- Swendsen-Wang (beta) [62]
- Wrapped External Code for Discrete Graphical Models
* only available by wrapped external code
** available by native OpenGM-code and wrapped external code
*** requires CPLEX (free for academical use)