Skip to content
Solving LPs with convergent message passing
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
datasets
doc Added solver documentation. Jul 5, 2019
external Add command line option for distributing edges. Jul 18, 2019
include Add command line option for distributing edges. Jul 18, 2019
src Add command line option for distributing edges. Jul 18, 2019
test
.gitmodules
.travis.yml
CMakeLists.txt Added cpp-taskflow parallelization for gaec. Jul 11, 2019
README.md

README.md

LPMP

Build Status

LPMP is a C++ framework for developing scalable dual (Lagrangean) decomposition based solvers for a wide range of LP-relaxations to discrete optimization problems. For a theoretical introduction to the techniques used and the class of problems that can be optimized see [1,2].

Solvers

We provide a range of solvers for various discrete optimization problems, including

Benchmark problems for various solvers above can be found in Multi-graph matching.

Optimization techniques

Optimization techniques include

Installation

Type git clone https://github.com/LPMP/LPMP.git for downloading, then cd LPMP and git submodule update --init --remote --recursive for downloading dependencies and finally cmake . for building.

Prerequisites:

  • Clang 5.0 or GCC 8.0 upwards for C++17 compatibility.

Documentation

A tutorial on writing a new solver from scratch can be found here.

References

You can’t perform that action at this time.