Fabio David
- 合計アクティビティ 16
- 前回のアクティビティ
- メンバー登録日
- フォロー 0ユーザー
- フォロワー 0ユーザー
- 投票 1
- サブスクリプション 5
アクティビティの概要
Fabio Davidさんの最近のアクティビティ-
Fabio Davidさんがコメントを作成しました:
Thank you, Jaromił. Your suggestion had a slightly better performance than my best implementation, probably because it had fewer restrictions. Just a question: Is it more efficient or correct to...
-
Fabio Davidさんがコメントを作成しました:
Thanks for the quick reply (as always)! I know there is no magic formula for this, I understand that it is necessary to implement and test to see which is the best option for each case. I made some...
-
Fabio Davidさんが投稿を作成しました:
Efficient way to avoid quadratic constraints
回答済みTo solve a specific problem, I have created a set of integer decisions variables S[i,k] with lb=0 and ub=640, with a size of approximately 1000 indices, but in some instances it can reach tens of t...
-
Fabio Davidさんがコメントを作成しました:
Hi Maliheh, Thank you for your quick response. I had checked out this option on https://www.gurobi.com/documentation/9.5/refman/scaleflag.html. However, the reference documentation for version 10.0...
-
Fabio Davidさんが投稿を作成しました:
How does the "ScaleFlag" option work?
回答済みUsing grbtune to analyze my problem, it suggested using the option ScaleFlag=1. This significantly reduced the execution time for solving it. Looking at the documentation on Gurobi site, it was not...
-
Fabio Davidさんがコメントを作成しました:
Sorry for the long response time. I followed all the suggestions, but it didn't achieve much better results. I decided to change my approach.Anyway, I really appreciate your suggestions, as they ha...
-
Fabio Davidさんが投稿を作成しました:
MCKP (multiple-choice knapsack problem) with many items
回答済みHi,I have a problem that can be modeled as a MCKP (multiple-choice knapsack problem). It is possible to calculate all items i in advance (python script) and classify them in C classes. Each item is...
-
Fabio Davidさんがコメントを作成しました:
Hi Jaromil/Gurobi staff, Thanks for your explanation. After running some tests, the blended approach seems to be much faster than the hierarquical method, at least in my application. The problem no...
-
Fabio Davidさんが投稿を作成しました:
Most efficient way to solve multiple objectives
回答済みHi I'm trying to solve a MILP with multiple objectives. For example, suppose I want to min x then min y and finally min z. I would like to know which is the most efficient way to solve it. Should I...
-
Fabio Davidさんが投稿を作成しました:
Python filter list with mathematical operation in add.constr -> NotImplementedError
I need to add a constraint so that my decision var must be in a interval, so I tried to filter somethong like this: m.addConstrs( (O[i] == 1 for i in L if x[i] >= a[i] and x[i] <= a[i]+b), "co" ) U...