Parallel Combinatorial Optimization with Decision Diagrams

@inproceedings{Bergman2014ParallelCO,
  title={Parallel Combinatorial Optimization with Decision Diagrams},
  author={David Bergman and Andr{\'e} Augusto Cir{\'e} and Ashish Sabharwal and Horst Samulowitz and Vijay A. Saraswat and Willem Jan van Hoeve},
  booktitle={CPAIOR},
  year={2014}
}
We propose a new approach for parallelizing search for combinatorial optimization that is based on a recursive application of approximate Decision Diagrams. This generic scheme can, in principle, be applied to any combinatorial optimization problem for which a decision diagram representation is available. We consider the maximum independent set problem as a specific case study, and show how a recently proposed sequential branch-and-bound scheme based on approximate decision diagrams can be… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 26 references

New Techniques for Discrete Optimization

D. Bergman
PhD thesis, Tepper School of Business, • 2013
View 6 Excerpts
Highly Influenced

Gurobi Optimization - Gurobi Compute Server, Distributed Tuning Tool and Distributed Concurrent MIP Solver

Z. Gu
In INFORMS Annual Meeting, • 2013
View 1 Excerpt

PAMI: A Parallel Active Message Interface for the Blue Gene/Q Supercomputer

2012 IEEE 26th International Parallel and Distributed Processing Symposium • 2012
View 1 Excerpt

Similar Papers

Loading similar papers…