Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem

Published 2015 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem
Authors
Keywords
Vertex separators, Eigenvalue bounds, Semidefinite programming bounds, Graph partitioning, Large scale, 05C70, 15A42, 90C22, 90C27, 90C59
Journal
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
Volume 63, Issue 2, Pages 333-364
Publisher
Springer Nature
Online
2015-08-20
DOI
10.1007/s10589-015-9779-8
References
View 2 related references

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Discover Peeref hubs

Discuss science. Find collaborators. Network.

Join a conversation

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
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.