A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints

Published 2019 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints
Authors
Keywords
-
Journal
OPERATIONS RESEARCH LETTERS
Volume 47, Issue 6, Pages 530-536
Publisher
Elsevier BV
Online
2019-09-27
DOI
10.1016/j.orl.2019.09.013

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.