The APMOD program is now online!
0
| “ | [...] a carefully designed application-program interface for Internet optimization services would do much to encourage development of client applications„- Fourer, Goux |
The APMOD ‘Early Bird’ registration phase – just like the year 2011 – is coming to a close.
If you register before December 31st, you get your delegate ticket for 300 Euros or your student (BA/MA only) ticket for 120 Euros. In both cases you are saving 80 Euros compared to the regular price.
Below you can see a list of registration entitlements:
- Entry to all Conference Sessions
- Lunches (noon) during the 3 conference days
- Morning and afternoon teas and coffee daily
- 1 ticket to the Welcome Reception
- 1 ticket to the Conference Dinner
- Delegate Satchel
- Final Program and Abstract Book
- Free WiFi Access at the conference
- Free use of public transport during the conference
To register please visit: http://www.apmod.org/registration/
We would like to wish you and your family a Merry Christmas and a Happy New Year!
The APMOD Team
Today we released a new NuGet package, which allows you to use GLPK with the Optimization.Framework.
The great thing about this package is that
- it will also install the Optimization.Framework automatically
- it will install the precompiled assemblies of GLPK
- it configures the paths to the assemblies by changing your app.config file accordingly (at this point we assume that your process runs as a 64-bit process; if this is not the case, simply go to your app.config and change the path to the native assembly from x64 to x86)
This means, that you get a fully working C# modeling language including a precompiled and preconfigured free to use solver, so that you can start modeling right away.
This new package is licensed under the GPL, which basically means that you will most likely not use it for commercial products. The Optimization.Framework itself however will still be licensed as it has always been. So, you get to choose if you want the free one-stop package which forces you to publish your software under the GPL or if you want the version for which you need to get a Gurobi, Cplex or MOPS license but which you will still be able to use without adapting your own license.
The new package can be found via the NuGet package manager. Simply type “GPLK” in the search box. You can also go to this site and download the package manually: http://nuget.org/packages/Optimization.Solver.GLPK
If you want to fork the source code go to: https://github.com/larsbeck/Optimization.Solver.GLPKSolver
Merry Christmas and a Happy New Year everybody!
Lars
I did post this on G+ before, but I thought to share this with all non G+ users too:
The other day, when a few people from our group had their coffee break together, they thought that it was a shame, that we OR people so far don’t have super heroes…and this is what we came up with:
The setting of our story is the modern, but enormously dark city of Dantzig, Poland 
The good guys (aka iForce):
- Optiman (Superhero; weapon of choice: Feasibility pumpgun, vehicle: Hyper plane)
- Heuristic boy (Sidekick)
- Obiwan Gurobi (old guy you go to when you have a hard to solve problem – the only sentence he knows though still helpful every time: “May the iForce be with you”)
The bad guys:
- Dr. LocOpt (Villain; weapon of choice: his “Degeneration” powers (think of the Quake3 voice, saying “Regeneration” – http://fliiby.com/file/6193/obtcmihvjz.html)
- Poly hydra (Dr. LocOpt’s dangerous snake monster with many heads)
- N.P. Hard (Villain; weapon of choice: Infeasibility cloak, also: the guy who makes every easy problem enormously hard to solve, btw. no one knows his real first and middle name, only the initials)
- Two Phase (using the simplest possible decision support system ever – a coin)
The neutral characters (sometimes good, sometimes bad):
- Cutwoman (sometimes she can help by using her cuts, e.g. her director’s cut, but sometimes eliminates feasible solutions…she always has her own agenda)
- simpLex Luther (not the most clever guy, but very successful and everybody knows him)
- Cylce-Ops (drives simpLex Luther nuts)
Polititians:
- Al GOR
Guest stars:
Bender (Futurama), MethodMan (rapping: “We are the column generation”) and of course the one and only MIP Jagger
Here is an image of our whiteboard:
Characters proposed from people who commented on the G+ post:
- Nash-man (already knows what you’re going to do, the only way to defeat him is to think irrationally…) – as proposed by Vincent Knight
- Sad L. Point (villain): gives users false hope of a solution, then depresses them by dashing that hope – as proposed by Paul Rubin
- Swapman (who is protecting your neighbourhood from innefficient solutions) – as proposed by Tim Schöneberg
I’ve watched it several times (you probably too), but it’s still fun:
http://boxcar2d.com/ Shows a demo of a genetic algorithm that builds and evaluates cars.
Cool stuff. Watch the color of the parts changing, and get a deeper insight on the subpage “the algorithm”.
Best,
jp – orconomy.de
Here is how it works:
- Join our LinkedIn group before September 30th, which can be found here: APMOD2012 LinkedIn group
- Wait until you receive an EMail with a promotion code – you should find it in your inbox shortly after September 30th
- Whenever you decide to register for APMOD2012 provide the promotion code and get a 10% discount
Note: By joining the LinkedIn group you DO NOT commit to register for APMOD2012. Joining the LinkedIn group before September 30th simply enables you to save 10% of the registration fee in case you decide to register for APMOD2012.
Why are we doing this?
The results of a survey at OR-Exchange on “what conference properties are important to you?” showed that your peers who are attending a conference are rather important to you. In order to give you the chance to see who is actually interested in coming, we try to bring everybody together in our LinkedIn group.
Dear readers,
It is our pleasure to invite you submitting papers to the International Conference
APMOD – APplied mathematical programming and MODelling
The conference will take place in Paderborn during March 28-30, 2012 and is focused on but not limited to the following topics:
Optimization methods and software
- Linear programming
- Mixed-integer programming
- Stochastic programming
- Modelling systems
- Modelling languages
- Metaheuristics
- Online optimization
Applications in
- Finance
- Transportation
- Energy
- Supply chain
- Production
- Logistics
The conference webpage
provides all necessary information. You are kindly invited to submit an extended abstract of 3-5 pages until October 31, 2011. Selected papers will be published as special issues in journals such as Flexible Services and Manufacturing Journal, Journal of Asset Management and OR Spectrum.
Important Dates are:
- 31-Oct-2011 – Extended abstract deadline
- 15-Dec-2011 – Acceptance notification
- 28-Mar-2012 – Conference starts
Sincerely yours,
The APMOD team
Gurobi released a new version of their solver software.
Highlights include:
- Substantial performance improvements in our MIP and Barrier solvers:
A 31% improvement in overall MIP performance, with a 75 % improvement on models that take more than 100 seconds to solve.
A 14% improvement in overall barrier performance, with a 23 % improvement on models that take more than 100 seconds to solve. - Pay-By-The-Day licensing: A new short-term, low-cost licensing option that gives you the ability to dynamically adjust the number of licenses available to you in order to cope with variations in demand. The minimum license period is just one calendar day.
- A new default automatic setting for choosing the algorithms used to solve LP and QP models: The new default uses the concurrent optimizer for LP models and the Barrier solver for QP models. The new defaults provide substantially improved overall performance.
- A new heuristic for finding feasible solutions to difficult MIP models: This heuristic can be quite useful in cases where other approaches are unable to find a feasible solution.
- Additional information is now provided for infeasible and unbounded models: Advanced users can now obtain an unbounded ray for unbounded models and an infeasibility proof for infeasible models.
I personally like the idea of a per-day-use because it allows you to use Gurobi in a very flexible short term way. Cloud computing scenarios (which I am working on with our framework) come to mind…
For more information on the latest version of Gurobi go to their website.
In our first tutorial we explain how you can use the framework in order to build a sudoku solver.
To download the source code click here
To see the source code click read the full article.
Credits to my brother Nils, who cut this video for me. I know this is a lot of work, thanks!
[click to continue…]