26

The Helmut Schmidt Universitat contains a list of past, ongoing, and future contests in Operations Research. https://www.hsu-hh.de/logistik/research/challenges For example: Active challenges: ITC 2019 on finding feasible solutions for organising student rooms and times. Past challenges: PACE 2018 on Steiner trees on an undirected edge-weighted graph ...


20

OpenSolver is an LP/IP/NLP solver that plugs into Microsoft Excel. I used it for some classroom stuff a while back and was quite pleased with it. If you are interested in metaheuristics, there are quite a few open-source contributions floating around (about which I mostly know nothing). I have used the Watchmaker Framework for Evolutionary Computation (i.e.,...


19

Mittelmann benchmarks a number of (LP-)Solvers, some of which are open source. A recent new open source solver is HiGHS.


17

I personally like Project Euler. This website has mathematical problems that usually require programming to solve them. If you solve a problem you get access to the corresponding problem forum, in which users post their code and discuss their approaches. Admittedly, I consider Project Euler to be more about mathematics and computer science than about ...


16

I compiled a list of solvers I could find last year. Several are COIN-OR-affiliated, but others include Mini-CP, DSP, BiqBin, OSQP, ECOS, and Dakota. (Edit - not all are dedicated LP, see comments below)


16

The Warehouse & Distribution Science by John J. Bartholdi III and Steven T. Hackman. From their site: This book is a work-in-progress. We are still revising and extending the material and suggest you print only what you need as you need it. Version 0.98.1, released 17 August 2019 Although the question was about books not being completed, I also ...


15

Let's make an inventory of example code for each common OR problem? Vehicle Routing Problem OptaPlanner: explanation + videos - source code (capacitated, time windows, multiple depots, ...) LocalSolver: explanation + source code (same with time windows) OR-tools: explanation + source code Jsprit: source code - company website (capacitated, time windows, ...


15

A good place to start is COIN-OR, which aims to "create for mathematical software what the open literature is for mathematical theory". You can also take a look at Google's OR-Tools. It contains many algorithms for specific problems (like knapsack or max flow) and also generic LP and CP solvers.


15

The French OR society has some interesting OR challenges http://www.roadef.org/challenge/2018/en/index.php


15

Google Hashcode had some optimization challenges in the past. Problem definitions and data from previous years can be found here.


15

There is a competition section held during MOPTA (Modeling and Optimization: Theory and Applications), which is organized annually by Lehigh University. The competition is for students only and usually devoted to a practical problem and sponsored by a solver company.


14

And we also have the DIMACS implementation challenges #ofcourse


13

Here is a link to INFORMS OR and analytics students team competition. You can also find the challenges for previous years and the presentations of the winner team. I believe you need to be registered in INFORMS in order to get the data. https://connect.informs.org/oratc/home Edit: in The Operation Research Challenge (TORCH)'s website, you can find the ...


13

Just posted on January 16, 2020: Elements of Scheduling, collected and edited by Jan Karel Lenstra and David B. Shmoys This {pdf file} presents the fragments of a book on machine scheduling. Work on the book started in 1977 but was never completed. The existing material is now made available for teaching purposes. In the winter of 1976, Alexander Rinnooy ...


12

I believe SCIP is the fastest non-commercial solver. It’s free for academic use. You can check out the benchmarks by Hans Mittelmann for other suggestions.


12

You should take a look at a series of three courses at coursera : Basic Modeling for Discrete Optimization Solving Algorithms for Discrete Optimization Advanced Modeling for Discrete Optimization They use MiniZinc as modeling language.


12

Simulation The simulation-software company Simio holds an annual student competition. Arena has one also. Forecasting There are the Makridakis Competitions, though they are infrequent. M-4 is just now getting finalized. Optimization List of active & historical competitions. (as mentioned) Grid Optimization competition. Black Box Optimization ...


12

For constraint programming, there's the Minizinc Challenge.


11

I would, for everything knapsack-like, always go to David Pisingers homepage. Here you can find very efficient codes for knapsack problems (COMBO), multiple-choice knapsack problems (Mcknap), and quadratick knapsack problems (quadknap) among others. I don't know if it qualifies as a "common OR problem" but for linear vector optimization (and therefore also ...


11

Check Coursera, edX, Udemy, or any other online courses (such as those of Stanford). For example: Free: Discrete Optimization course on Coursera, covers column generation and an introduction to (meta)heuristic Optimization with Metaheuristics in Python on Udemy Lectures of Introduction to Meta-heuristics Artificial Intelligence: Reinforcement Learning in ...


10

There are a few courses on Coursera that offer such learning materials. Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming (Intermediate) The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal ...


10

Just to add another, easily google-able, resource: Wikipedia, more or less, "maintains" a "List of optimization software" -- which includes the super handy "Mathematical optimization software" template I -- disclaimer: shameless self-plug -- started 6 years ago (and never bothered to curate) [the latter also includes references to alternat(iv)e taxonomies in ...


10

There are these great introductory lectures on coursera (not sure if that qualifies for your question as they are not research talks): Discrete Optimization, Solving Algorithms, Basic Modeling and Advanced Modeling. If you are into research seminars / current topics, Aleksandr M. Kazachkov has compiled an interesting list of online seminars on optimization....


10

In terms of conferences, the Egon Balas Symposium in 2019 contained numerous talks on mathematical optimization. For integer programming specifically, it includes the Geometric Firefighter Routing Problem (Cid de Souza) the Graphical Traveling Salesman Problem (Neil Simonetti).


9

vOptLib: Library of numerical instances for MultiObjective Linear Optimization problems From the site: vOptLib (short for vector optimization library) is a collection problem instances for benchmarking multi-objective solvers. It covers a variety of Multiobjective linear optimization problems (multiobjective combinatorial problems, multiobjective ...


9

Of the open source LP and MILP solvers, I would recommend investigating the COIN-OR based solvers CLP and CBC. These are C++ based libraries, though work has been done to make them more accessible from Java. See https://spartanideas.msu.edu/2016/06/01/using-clp-with-java/ for example.


9

In addition to the answer from @Mehdi... I've recently started to work with OR-tools and find it very nice for prototyping. The Python interface allowed me to produce a first version of my model within one day. The times to obtain a first solution seem good - it performed very favorable in the MiniZinc Challenge 2018. The main struggles/disadvantages that I'...


9

Time Series Data Library The time series data library from Rob Hyndman has hundreds (~648+) of time-series data. It depends on what you call "demand" and what you require as a "sufficiently long period of time." The entire dataset has been migrated to an R package called tsdl. It is also available on GitHub. You can find descriptions of the data in the ...


9

By chance, I happened across this paper earlier today. It discusses human performance in solving the TSP manually. The paper is short but there are a few other references in it that probably provide more details of other experiments.


9

From my experience with industry: typically, you do not obtain the human planners' solutions to compare against optimal solutions for at least two reasons: the decisions/plans/solutions are not recorded, at least not completely the manual plans sometimes violate constraints in your model. Even if both can be dealt with, companies don't want their data, let ...


Only top voted, non community-wiki answers of a minimum length are eligible