Branch & Cut Algorithm for Knapsack Problem
$30-250 USD
Pagado a la entrega
We need a Branch & Cut Algorithm EXPERT - code language at this stage can be any that you are an expert in, we'll see if we can make it work with what we have so far. Our data is stored in a MySQL database. Algorithm must solve the problem in under 3 seconds within the database. The attached spreadsheet is an example of the knapsack problem we need to solve. 200 variables with 9 constraints, goal is to maximize "Score" which is total points per player. Variables are seen in columns A-F. The Constraints can be seen in columns Q-R-S rows 1-11 and are: Total players must = 9, Salary must be =<35,000, and then the 7 Position constraints within the total number of 9 players, 1-P, 1-C, 1-1B, 1-2B, 1-SS, 1-3B, 3-OF. Algorithm must be fast, and accurate. Simplex and Greedy alone will not work, must be some variation of Branch and Cut. So, if you are an expect in Branch and Cut type algorithms, please apply.
Nº del proyecto: #8328066
Sobre el proyecto
11 freelancers están ofertando un promedio de $211 por este trabajo
I look forward to discuss further about the project details and deliver the same to your specifications.
dynamic programming problem, give your answer in one day, give you source code in two day. pm me and bid me.
I have a very good academic and practical experience in optimization and operations research problem. I have enough time and material to finish the project in a timely manner.
