Pinned Repositories
BDD
An integer linear program solver using a Lagrange decomposition into binary decision diagrams. Lagrange multipliers are updated through dual block coordinate ascent.
BCFW-Bundle
A proximal bundle method for minimizing a sum of functions. Proximal steps for subfunctions are computed with a multi plane block coordinate Frank-Wolfe method.
dag-reachability
Reachability and transitive reduction for DAGs
LP_MP
Solving LPs with convergent message passing
LP_MP-Cell-tracking
Dual decomposition solvers for various cell tracking problem formulations based on the LP_MP library
LP_MP-MRF
Dual decomposition based Markov-Random-Fields solvers.
LP_MP-QAP
Dual decomposition solvers for the quadratic assignment problem (QAP), also called graph matching in computer vision based on the LP_MP library.
MCF-SSP
Successive shortest path minimum cost flow solver
RAMA
structured-prediction-problem-archive
Archive of structured prediction problems from computer vision and machine learning
pawelswoboda's Repositories
pawelswoboda/RAMA
pawelswoboda/LP_MP
Solving LPs with convergent message passing
pawelswoboda/dag-reachability
Reachability and transitive reduction for DAGs
pawelswoboda/LP_MP-QAP
Dual decomposition solvers for the quadratic assignment problem (QAP), also called graph matching in computer vision based on the LP_MP library.
pawelswoboda/BCFW-Bundle
A proximal bundle method for minimizing a sum of functions. Proximal steps for subfunctions are computed with a multi plane block coordinate Frank-Wolfe method.
pawelswoboda/LP_MP-Cell-tracking
Dual decomposition solvers for various cell tracking problem formulations based on the LP_MP library
pawelswoboda/LP_MP-MRF
Dual decomposition based Markov-Random-Fields solvers.
pawelswoboda/MCF-SSP
Successive shortest path minimum cost flow solver
pawelswoboda/structured-prediction-problem-archive
Archive of structured prediction problems from computer vision and machine learning
pawelswoboda/arboricity
Compute arboricity and forest decomposition of graphs.
pawelswoboda/LBDD
BDDs for large variable numbers.
pawelswoboda/tropical-convolution
efficient convolution in (min,+) algebra
pawelswoboda/DD_ILP
Construct integer linear problems pragmatically from dual decomposition based formulations. Solve them with various backends, like ILP solvers or SAT-based ones.
pawelswoboda/ConicBundle
ConicBundle software from https://www-user.tu-chemnitz.de/~helmberg/ConicBundle/ with additional cmake script
pawelswoboda/CS2-CPP
C++ implementation CS2 minimum cost flow algorithm
pawelswoboda/dense-multicut
pawelswoboda/graph
Graphs and Graph Algorithms in C++, including Minimum Cost (Lifted) Multicuts
pawelswoboda/Heap-Layers
Heap Layers: An Extensible Memory Allocation Infrastructure
pawelswoboda/lectures
pawelswoboda/lingeling
Lingeling SAT Solver
pawelswoboda/LP_MP-Cut
Dual decomposition solvers for (lifted) multicut and max cut based on the LP_MP library.
pawelswoboda/LP_MP-Discrete-tomography
Dual decomposition solvers for the discrete tomography problem based on the LP_MP library.
pawelswoboda/MQLib
Implementations of heuristics for the Max-cut and QUBO problems in C++
pawelswoboda/open-pls
OpenPLS: A open phased local search (PLS) algorithm for maximum clique and related problems
pawelswoboda/opengm
A C++ Library for Discrete Graphical Models
pawelswoboda/opengm-converter
Scripts to convert opengm models to text files.
pawelswoboda/optimization-problem-archive
archive of combinatorial problems in computer vision
pawelswoboda/pawelswoboda.github.io
pawelswoboda/PML