How does Gurobi solve binary quadratic programming problem with linear constraints?
回答済みI have a programming problem. The objective of the problem is the variance of a set of data. The constraints of the problem is linear. The decision variable of the problem is binary. So the problem is a binary quadratic programming problem with linear constraints. I use Gurobi to solve it, I want to know Gurobi how to solve it. Could you give me some algrithm details, such as complexity, refrence papers.
-
正式なコメント
This post is more than two years old. Some information may not be up to date. For current information, please check the Gurobi Documentation or Knowledge Base. If you need more help, please create a new post in the community forum, or try Gurobot, our chatbot interface offering instant, expert-level support. -
Hi Shu,
You can find discussions on this topic in the following videos
Models with Products of Binary Variables Webinar Video
Products of Variables in Mixed Integer Programming
Webinar: Graph based Approaches to Solving Binary Quadratic Programsfrom the Gurobi YouTube channel, where you will also find many other useful videos and webinar recordings.
- Riley
0
投稿コメントは受け付けていません。
コメント
2件のコメント