Description:
Research, teaching & application of operations research.
|
|
|
how to save the B&C tree in AMPL and Cplex10
|
| |
I am trying to solve a MIP problem. I want to save the current B&C tree and use it later on. In cplex 9, there is a 'endtree' parameter that I can use, but in cplex 10, it is removed. So anyone know how to do that in cplex 10 or in AMPL 10 ? I know cplex save the tree by itself if you don't get out of the cplex... more »
|
|
|
linearize quadratic objective function
|
| |
Hi. I have a set partitioning problem where one incurs a cost of c_ {ij} if sets i and j are both chosen. In other words, the cost of choosing a particular set depends on what other sets I have selected. Define a_{ui}=1 if element u is contained in set i and a_{ui}=0 otherwise. My decision variable is y_i where y_i=1 if set i is... more »
|
|
|
Mendeley
|
| |
Hi, Since you're probably dealing with research papers and scholarly articles, we thought it might be of interest if we told you about Mendeley ([link]), a free research paper management and bibliography tool. Mendeley is a combination of free academic software (available for Windows, Mac and Linux) and a Web 2.0 research network - combined,... more »
|
|
|
Interesting new tech competition
|
| |
Hi all, Saw that in Techcrunch, this competition should interest the group: [link]. The company is looking for best ideas for games, laptops, phones, music using this new tech: the 5 winnings ideas get $6,000, and more. Ideas can be submitted by Nov 30, competition ends Dec 13th: the more... more »
|
|
|
High Precision Linear Optimization Solver
|
| |
To test a high precision linear optimization solver, the following problem has been presented: M Maximize: f(X) = Ó [2+sin(m+Pi/m)]Xm m=1 Constraints: b(n) = M[2+sin(n+Pi/n)] ; n = 1,2,..,N M Cost Matrix: Ó sin[m+Pi/(m+n)]Xm <= b(n)... more »
|
|
|
Fractional Knapsack Problem
|
| |
Hello, I would greatly appreciate it if some one could shed some light on this problem. The 0/1 Knapsack problem has been proven to be NP complete for a single knapsack as well as the multiple knapsack cases. The fractional knapsack (single knapsack case) exhibits greedy optimal solution. My questions is as follows:... more »
|
|
|
Linear algebra and its applications 3rd edition by David C. Lay SM.
|
| |
Hi dear students; We are SolutionmanualGroup.We established SolutionmanualGroup in 2004… We have solution manuals for a competitive price. I also have other manuals more than 1500..We have a lot of solutions manual in low price to get solution manual you want please send message to us.Cheapest and fastest service is our aim…... more »
|
|
|
Laser Fundamentals 2nd edition by William t. Silfvast
|
| |
Hi dear students; We are SolutionmanualGroup.We established SolutionmanualGroup in 2004… We have solution manuals for a competitive price. I also have other manuals more than 1500..We have a lot of solutions manual in low price to get solution manual you want please send message to us.Cheapest and fastest service is our aim…... more »
|
|
|
|
