BDD

An integer linear program solver using a Lagrange decomposition into binary decision diagrams. Lagrange multipliers are updated through dual block coordinate ascent.

optimization

View on GitHub

63 Stars

13 Forks

63 Watchers

C++ Language

gpl-3.0 License

100 SrcLog Score

Cost to Build

$610.1K

Market Value

$919.6K

How is this calculated?

Growth over time

4 data points · 2022-11-01 → 2026-04-01

Stars Forks Watchers

💬

How do you feel about this project?

Ask AI about BDD

Question copied to clipboard

What is the LPMP/BDD GitHub project? Description: "An integer linear program solver using a Lagrange decomposition into binary decision diagrams. Lagrange multipliers are updated through dual block coordinate ascent.". Written in C++. Explain what it does, its main use cases, key features, and who would benefit from using it.

Question is copied to clipboard — paste it after the AI opens.

How to clone BDD

Clone via HTTPS

git clone https://github.com/LPMP/BDD.git

Clone via SSH

[email protected]:LPMP/BDD.git

Download ZIP

Download master.zip

Found an issue?

Report bugs or request features on the BDD issue tracker:

Open GitHub Issues

Similar to BDD

prepack svgo closure-compiler llvm clean-css simplify imagemin game-programming-patterns webpackmonitor reactopt BayesianOptimization nnvm MTuner webdnn easyengine gosl soot scikit-optimize DietPi faster incubator-kie-optaplanner search-engine-optimization react-ssr-optimization opticss wheels owl meshoptimizer MLBox JuMP.jl eaopt