A semidefinite programming hierarchy for packing problems in discrete geometry

Published 2014 View Full Article

Authors

Keywords

Lasserre hierarchy, Weighted independence number (stability number), Infinite graphs, Geometric packing problems, Moment measures, 90C22, 52C17

Journal

MATHEMATICAL PROGRAMMING

Volume 151, Issue 2, Pages 529-553

Publisher

Springer Nature

Online

2014-12-02

DOI

10.1007/s10107-014-0843-4

References

View 5 related references

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started